Second-Order Absorbing Boundary Conditions for TLM Analysis of Open Region Scattering Problems

A set of second-order absorbing boundary conditions is derived for the three-dimensional finite-difference TLM analysis of open region scattering problems. These boundary conditions are implemented into a computer code using a two-level discretization scheme. A simulation experiment using a 4-term Blackman-Harris pulse excitation with very low sidelobes is used to examine the efficiency of the boundary conditions. It is observed that the absorbing boundaries are perfectly transparent to waves impinging upon them at angles between 0 and 45 degrees, and the normal incidence reflection coefficient is less than -35 dB.     

Game theory and time utility functions for a radio aware scheduling algorithm for WiMAX networks

In WiMAX systems the Base Station scheduler plays a key role as it controls the sharing of the radio resources among the users. The goal of the scheduler is multiple: achieve fair usage of the resources, satisfy the QoS requirements of the users, maximize goodput, and minimize power consumption, and at the same time ensuring feasible algorithm complexity and system scalability. Since most of these goals are contrasting, scheduler designers usually focus their attention on optimizing one aspect only. In this scenario, we propose a scheduling algorithm (called GTS_Nmathrm{GTS_N}) whose goal is to contemporaneously achieve efficiency and fairness, while also taking into account the QoS requirements and the channel state. GTS_Nmathrm{GTS_N} exploits the properties of Time Utility Functions (TUFs) and Game Theory. Simulations prove that the performance of GTS_N,mathrm{GTS_N}, when compared to that of several well-known schedulers, is remarkable. GTS_Nmathrm{GTS_N} provides the best compromise between the two contrasting objectives of fairness and efficiency, while QoS requirements are in most cases guaranteed. However, the exponential complexity introduced by the game theory technique makes it rather impractical and not computationally scalable for a large number of users. Thus we developed a suboptimal version, named sub-GTS_N.mathrm{GTS_N}. We show that this version retains most of the features and performance figures of its brother, but its complexity is linear with the number of users.     

Secure Distributed Key Generation for Discrete-Log Based Cryptosystems

A Distributed Key Generation (DKG) protocol is an essential component of threshold cryptosystems required to initialize the cryptosystem securely and generate its private and public keys. In the case of discrete-log-based (dlog-based) threshold signature schemes (ElGamal and its derivatives), the DKG protocol is further used in the distributed signature generation phase to generate one-time signature randomizers (r = g^k). In this paper we show that a widely used dlog-based DKG protocol suggested by Pedersen does not guarantee a uniformly random distribution of generated keys: we describe an efficient active attacker controlling a small number of parties which successfully biases the values of the generated keys away from uniform. We then present a new DKG protocol for the setting of dlog-based cryptosystems which we prove to satisfy the security requirements from DKG protocols and, in particular, it ensures a uniform distribution of the generated keys. The new protocol can be used as a secure replacement for the many applications of Pedersen's protocol. Motivated by the fact that the new DKG protocol incurs additional communication cost relative to Pedersen's original protocol, we investigate whether the latter can be used in specific applications which require relaxed security properties from the DKG protocol. We answer this question affirmatively by showing that Pedersen's protocol suffices for the secure implementation of certain threshold cryptosystems whose security can be reduced to the hardness of the discrete logarithm problem. In particular, we show Pedersen's DKG to be sufficient for the construction of a threshold Schnorr signature scheme. Finally, we observe an interesting trade-off between security (reductions), computation, and communication that arises when comparing Pedersen's DKG protocol with ours.     

A distributed laxity-based priority scheduling scheme for time-sensitive traffic in mobile ad hoc networks

Characteristics of Mobile Ad hoc Networks such as shared broadcast channel, bandwidth and battery power limitations, highly dynamic topology, and location dependent errors, make provisioning of quality of service (QoS) in such networks very difficult. The Medium Access Control (MAC) layer plays a very important role as far as QoS is concerned. The MAC layer is responsible for selecting the next packet to be transmitted and the timing of its transmission. We have proposed a new MAC layer protocol that includes a laxity-based priority scheduling scheme and an associated back-off scheme, for supporting time-sensitive traffic. In the proposed scheduling scheme, we select the next packet to be transmitted, based on its priority value which takes into consideration the uniform laxity budget of the packet, the current packet delivery ratio of the flow to which the packet belongs, and the packet delivery ratio desired by the user. The back-off mechanism devised by us grants a node access to the channel, based on the rank of its highest priority packet in comparison to other such packets queued at nodes in the neighborhood of the current node. We have studied the performance of our protocol that combines a packet scheduling scheme and a channel access scheme through simulation experiments, and the simulation results show that our protocol exhibits a significant improvement in packet delivery ratio under bounded end-to-end delay requirements, compared to the existing 802.11 DCF and the Distributed Priority Scheduling scheme proposed recently in [ACM Wireless Networks Journal 8 (5) (2002) 455–466; Proceedings of ACM MOBICOM '01, July 2001, pp. 200–209].     

BN–Graphene Composites Generated by Covalent Cross‐Linking with Organic Linkers

Composites of boron nitride (BN) and carboxylated graphene are prepared for the first time using covalent cross‐linking employing the carbodiimide reaction. The BN_1–xG_x (x ≈ 0.25, 0.5, and 0.75) obtained are characterized using a variety of spectroscopic techniques and thermogravimetric analysis. The composites show composition‐dependent electrical resistivity, the resistivity decreasing with increase in graphene content. The composites exhibit microporosity and the x ≈ 0.75 composite especially exhibits satisfactory performance with high stability as an electrode in supercapacitors. The x ≈ 0.75 composite is also found to be a good electrocatalyst for the oxygen reduction reaction in fuel cells.     

Quantitative Electron Microscopic Investigation of the Pore Structure in 10:90 Colloidal Silica/Potassium Silicate Sol-Gels

Transmission electron microscopy (TEM), scanning electron microscopy (SEM), mercury intrusion porosimetry (MIP), and nitrogen sorption technique (BET) were utilized to characterize the microstructure of a 10:90 wt% colloidal silica/potassium silicate gel as first described by Shoup. Gels in the unsintered state (15% theoretical density) were prepared for microscopy by the techniques of ultramicrotomy, Pt/C replication, and pore casting. Electron microscopic images of the ultramicrotomed thin sections (70 nm) show that the unfired gel possesses three distinct species of pores which are referred to as the micropores, mesopores, and macropores. The average micropore diameter was found to be 4 nm as determined by nitrogen desorption. Quantitative stereological analysis of the ultramicrotomed sections indicated that the average circular and lengthwise dimensions of the cylindrical mesopores were 0.15 and 0.39 μm, respectively. Similarly, this same analysis determined the average spherical macropore diameter to be 0.83 μm. In contrast, MIP results suggested that these gels possessed a unimodal pore size distribution centered around the 0.2-μm pore size. The discrepancy between MIP and microscopy can be explained by viewing the void space as a pore-throat network. Experimental evidence for this type of pore geometry was obtained from stereo pairs of Pt/C replicas and thick microtomed sections (0.5 μm) which gave information about particle connectivity and pore casts which depicted the pore connectivity in three dimensions.     

建立精密的直流浮动电流源

尽管有源滤波器的理论家和设计者都对GIC（通用阻抗变换器）非常熟悉，但一般模拟人员对它并不了解。一个单端口有源电路一般包括低成本运放、电阻和电容，GIC将容抗转换为感抗，因而可以替代滤波器中以RLC传输函数描述的电感。另外，GIC输入阻抗方程的灵活性允许进行虚拟阻抗的设计，这在实际元器件中是不存在的，例如依赖频率的电阻。GIC是30年前推出的，已广泛应用于交流电路和有源滤波电路。     

An energy efficient middleware for an ad-hoc AAL wireless sensor network

DIA (Dispositivo Inteligente de Alarma, in Spanish) is an AAL (Ambient Assisted Living) system that allows to infer a potential dangerous action of an elderly person living alone at home. This inference is obtained by a specific sensorisation with sensor nodes (portables and fixes) and a reasoning layer embedded in a PC that learns of the users behaviour patterns and advices when actual one differs significantly of the normal patterns. In AAL systems, energy is a limited resource therefore sensor devices need to be properly managed to conserve energy. In this paper, we introduce the design and implementation of innovative and specific mechanisms at the sensory layer middleware which is capable of, first to discriminate spurious motion detections assuming that these signals do not resemble the patterns of real motion detections and, second to reduce the dynamics of messages by a sensor signal processing in order to compress the whole information in one single event. The middleware achieves power saving by modifying the raw information from sensors and adapting it to the predefined semantic of the reasoning layer. It manages the important task of data processing from sensors (raw information), and transfers the pre-processed information into the top layer of reasoning in a more energy efficient way. We also address the trade-off between reducing power consumption and reducing delay for incoming data. We present results from experiments using our implementation of these mechanisms at the middleware that comprises from node firmware to the PC driver. The number of messages of the proposed method with respect to the raw data is reduced by approximately 98.5%. The resources used in the PIR signal processing is reduced by approximately 85%. The resulting delay introduced is small (10–19 s) but system dynamics is slow enough to avoid contextualisation errors or reduction of system performance. We consider these results as very satisfactory.     

Design and Dimensioning of a WDM Mesh Network to Groom Dynamically Varying Traffic

In this paper, we address the traffic grooming problem in WDM mesh networks when the offered traffic is characterized by a set of traffic matrices—a variant of dynamically changing traffic. We justify the need to address this problem in mesh networks and also argue for the validity of our approach to solve this problem. Our primary objective is to design the network in terms of the number of wavelengths and transceivers required to support any offered traffic matrix. We provide a simple and generic framework to minimize the number of transceivers needed in the network. Simulation results have been presented in contrast with a possible approach, to enable comparison with our solution strategy. An ILP formulation of our approach is also presented.