A method of developing an agent based ubiquitous node monitoring protocol

A ubiquitous network plays a critical role to provide rendered services to ubiquitous application running nodes. To provide appropriate resources the nodes are needed to be monitored continuously. Monitoring a node in ubiquitous network is challenging because of dynamicity and heterogeneity of the ubiquitous network. The network monitor has to monitor resource parameters, like data rate, delay and throughput, as well as events such as node failure, network failure and fault in the system to curb the system failure. In this paper, we propose a method to develop a ubiquitous system monitoring protocol using agents. Earlier works on network monitoring using agents consider that the agents are designed for particular network. While in our work the heterogeneity property of the network has been considered. We have shown that the nodes' behaviour can be easily monitored by using agents (both static and mobile agent). The past behavior of the application and network, and past history of the Unode and the predecessor are taken into consideration to help SA to take appropriate decision during the time of emergency situation like unavailability of resources at the local administration, and to predict the migration of the Unode based on the previous node history. The results obtained in the simulation reflects the effectiveness of the technique.

A Secure and Efficient Authentication Protocol (SEAP) for MANETs with Membership Revocation

In this paper, we propose a novel authentication protocol for MANETs requiring stronger security. The protocol works on a two-tier network architecture with client nodes and authentication server nodes, and supports dynamic membership. We use an external membership granting server (MGS) to provide stronger security with dynamic membership. However, the external MGS in our protocol is semi-online instead of being online, i.e., the MGS cannot initiate a connection with a network node but any network node can communicate with the MGS whenever required. To ensure efficiency, the protocol uses symmetric key cryptography to implement the authentication service. However, to achieve storage scalability, the protocol uses a pseudo random function (PRF) to bind the secret key of a client to its identity using the secret key of its server. In addition, the protocol possesses an efficient server revocation mechanism along with an efficient server re-assignment mechanism, which makes the protocol robust against server node compromise.

Time-Based All-Digital Technique for Analog Built-in Self-Test

A scheme for built-in self-test of analog signals with minimal area overhead for measuring on-chip voltages in an all-digital manner is presented. The method is well suited for a distributed architecture, where the routing of analog signals over long paths is minimized. A clock is routed serially to the sampling heads placed at the nodes of analog test voltages. This sampling head present at each test node, which consists of a pair of delay cells and a pair of flip-flops, locally converts the test voltage to a skew between a pair of subsampled signals, thus giving rise to as many subsampled signal pairs as the number of nodes. To measure a certain analog voltage, the corresponding subsampled signal pair is fed to a delay measurement unit to measure the skew between this pair. The concept is validated by designing a test chip in a UMC 130-nm CMOS process. Sub-millivolt accuracy for static signals is demonstrated for a measurement time of a few seconds, and an effective number of bits of 5.29 is demonstrated for low-bandwidth signals in the absence of sample-and-hold circuitry.

Optimal Timer-Based Best Node Selection for Wireless Systems with Unknown Number of Nodes

The distributed, low-feedback, timer scheme is used in several wireless systems to select the best node from the available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal metric-to-timer mappings for the practical scenario where the number of nodes is unknown. We consider two cases in which the probability distribution of the number of nodes is either known a priori or is unknown. In the first case, the optimal mapping maximizes the success probability averaged over the probability distribution. In the second case, a robust mapping maximizes the worst case average success probability over all possible probability distributions on the number of nodes. Results reveal that the proposed mappings deliver significant gains compared to the mappings considered in the literature.

Goldstone modes and bifurcations in phase-separated binary condensates at finite temperature

We show that the third Goldstone mode, which emerges in binary condensates at phase separation, persists to higher interspecies interaction for density profiles where one component is surrounded on both sides by the other component. This is not the case with symmetry-broken density profiles where one species is entirely to the left and the other is entirely to the right. We, then, use Hartree-Fock-Bogoliubov theory with Popov approximation to examine the mode evolution at T not equal 0 and demonstrate the existence of mode bifurcation near the critical temperature. The Kohn mode, however, exhibits deviation from the natural frequency at finite temperatures after the phase separation. This is due to the exclusion of the noncondensate atoms in the dynamics.

Renyi entropies of free bosons on the torus and holography

We analytically evaluate the Renyi entropies for the two dimensional free boson CFT. The CFT is considered to be compactified on a circle and at finite temperature. The Renyi entropies S-n are evaluated for a single interval using the two point function of bosonic twist fields on a torus. For the case of the compact boson, the sum over the classical saddle points results in the Riemann-Siegel theta function associated with the A(n-1) lattice. We then study the Renyi entropies in the decompactification regime. We show that in the limit when the size of the interval becomes the size of the spatial circle, the entanglement entropy reduces to the thermal entropy of free bosons on a circle. We then set up a systematic high temperature expansion of the Renyi entropies and evaluate the finite size corrections for free bosons. Finally we compare these finite size corrections both for the free boson CFT and the free fermion CFT with the one-loop corrections obtained from bulk three dimensional handlebody spacetimes which have higher genus Riemann surfaces as its boundary. One-loop corrections in these geometries are entirely determined by quantum numbers of the excitations present in the bulk. This implies that the leading finite size corrections contributions from one-loop determinants of the Chern-Simons gauge field and the Dirac field in the dual geometry should reproduce that of the free boson and the free fermion CFT respectively. By evaluating these corrections both in the bulk and in the CFT explicitly we show that this expectation is indeed true.

Capacity of Gaussian Channels With Energy Harvesting and Processing Cost

Energy harvesting sensor nodes are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting green communication. In this paper, we focus on communicating reliably over an additive white Gaussian noise channel using such an energy harvesting sensor node. An important part of this paper involves appropriate modeling of energy harvesting, as done via various practical architectures. Our main result is the characterization of the Shannon capacity of the communication system. The key technical challenge involves dealing with the dynamic (and stochastic) nature of the (quadratic) cost of the input to the channel. As a corollary, we find close connections between the capacity achieving energy management policies and the queueing theoretic throughput optimal policies.

Amide Functionalized Microporous Organic Polymer (Am-MOP) for Selective CO2 Sorption and Catalysis

We report the design and synthesis of an amide functionalized microporous organic polymer (Am-MOP) prepared from trimesic acid and p-phenylenediamine using thionyl chloride as a reagent. Polar amide (CONH) functional groups act as a linking unit between the node and spacer and constitute the pore wall of the continuous polymeric network. The strong covalent bonds between the building blocks (trimesic acid and p-phenylenediamine) through amide bond linkages provide high thermal and chemical stability to Am-MOP. The presence of a highly polar pore surface allows selective CO2 uptake at 195 K over other gases such as N-2, Ar, and O-2. The CO2 molecule interacts with amide functional groups via Lewis acid base type interactions as demonstrated through DFT calculations. Furthermore, for the first time Am-MOP with basic functional groups has been exploited for the Knoevenagel condensation reaction between aldehydes and active methylene compounds. Availability of a large number of catalytic sites per volume and confined microporosity gives enhanced catalytic efficiency and high selectivity for small substrate molecules.

Codes With Local Regeneration and Erasure Correction

Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.

Logarithmic corrections to extremal black hole entropy in N=2, 4 and 8 supergravity

We compute the logarithmic correction to black hole entropy about exponentially suppressed saddle points of the Quantum Entropy Function corresponding to Z(N) orbifolds of the near horizon geometry of the extremal black hole under study. By carefully accounting for zero mode contributions we show that the logarithmic contributions for quarter-BPS black holes in N = 4 supergravity and one-eighth BPS black holes in N = 8 supergravity perfectly match with the prediction from the microstate counting. We also find that the logarithmic contribution for half-BPS black holes in N = 2 supergravity depends non-trivially on the Z(N) orbifold. Our analysis draws heavily on the results we had previously obtained for heat kernel coefficients on Z(N) orbifolds of spheres and hyperboloids in arXiv:1311.6286 and we also propose a generalization of the Plancherel formula to Z(N) orbifolds of hyperboloids to an expression involving the Harish-Chandra character of sl (2, R), a result which is of possible mathematical interest.

Cavitation in brittle metallic glasses - Effects of stress state and distributed weak zones

Experimental studies and atomistic simulations have shown that brittle metallic glasses fail by a cavitation mechanism whose origin has been traced to the presence of intrinsic atomic density fluctuations which give rise to weak zones with reduced yield strength. It has been shown recently through continuum analysis that the presence of these zones can lower the cavitation stress considerably under equibiaxial loading. The objective of the present work is to study the effect of the applied stress state on the cavitation behavior of such a heterogeneous plastic solid with distributed weak zones. To this end, 2D plane strain finite element simulations are performed by subjecting a unit cell containing a weak zone to different (biaxiality) stress ratios. The volume fraction and yield strength of the weak zone are varied over a wide range. The results show that unlike in a homogeneous plastic solid, the cavitation stress of the heterogeneous aggregate does not reduce appreciably as the stress ratio decreases from unity when the yield strength of the weak zone is low. It is found that a non-dimensional parameter characterizing the stress state prevailing in the weak zone and its yield properties uniquely control the cavitation stress. The nature of cavitation bifurcation may change from unstable bifurcation to the left at sufficiently low stress ratio to one involving snap cavitation at high stress ratio. (C) 2014 Elsevier Ltd. All rights reserved.

Performance Analysis of Space-Shift Keying in Decode-and-Forward Multihop MIMO Networks

In this paper, space-shift keying (SSK) is considered for multihop multiple-input-multiple-output (MIMO) networks. In SSK, only one among n(s) = 2(m) available transmit antennas, chosen on the basis of m information bits, is activated during transmission. We consider two different systems of multihop co-operation, where each node has multiple antennas and employs SSK. In system I, a multihop diversity relaying scheme is considered. In system II, a multihop multibranch relaying scheme is considered. In both systems, we adopt decode-and-forward (DF) relaying, where each relay forwards the signal only when it correctly decodes. We analyze the end-to-end bit error rate (BER) and diversity order of both the systems with SSK. For binary SSK (n(s) = 2), our analytical BER expression is exact, and our numerical results show that the BERs evaluated through the analytical expression overlap with those obtained through Monte Carlo simulations. For nonbinary SSK (n(s) > 2), we derive an approximate BER expression, where the analytically evaluated BER results closely follow the simulated BER results. We show the comparison of the BERs of SSK and conventional phase-shift keying (PSK) and also show the instances where SSK outperforms PSK. We also present the diversity analyses for SSK in systems I and II, which predict the achievable diversity orders as a function of system parameters.

Discrete-Rate Adaptation and Selection in Energy Harvesting Wireless Systems

In a system with energy harvesting (EH) nodes, the design focus shifts from minimizing energy consumption by infrequently transmitting less information to making the best use of available energy to efficiently deliver data while adhering to the fundamental energy neutrality constraint. We address the problem of maximizing the throughput of a system consisting of rate-adaptive EH nodes that transmit to a destination. Unlike related literature, we focus on the practically important discrete-rate adaptation model. First, for a single EH node, we propose a discrete-rate adaptation rule and prove its optimality for a general class of stationary and ergodic EH and fading processes. We then study a general system with multiple EH nodes in which one is opportunistically selected to transmit. We first derive a novel and throughput-optimal joint selection and rate adaptation rule (TOJSRA) when the nodes are subject to a weaker average power constraint. We then propose a novel rule for a multi-EH node system that is based on TOJSRA, and we prove its optimality for stationary and ergodic EH and fading processes. We also model the various energy overheads of the EH nodes and characterize their effect on the adaptation policy and the system throughput.

A model for the classification and survey of clock synchronization protocols in WSNs

Clock synchronization in wireless sensor networks (WSNs) assures that sensor nodes have the same reference clock time. This is necessary not only for various WSN applications but also for many system level protocols for WSNs such as MAC protocols, and protocols for sleep scheduling of sensor nodes. Clock value of a node at a particular instant of time depends on its initial value and the frequency of the crystal oscillator used in the sensor node. The frequency of the crystal oscillator varies from node to node, and may also change over time depending upon many factors like temperature, humidity, etc. As a result, clock values of different sensor nodes diverge from each other and also from the real time clock, and hence, there is a requirement for clock synchronization in WSNs. Consequently, many clock synchronization protocols for WSNs have been proposed in the recent past. These protocols differ from each other considerably, and so, there is a need to understand them using a common platform. Towards this goal, this survey paper categorizes the features of clock synchronization protocols for WSNs into three types, viz, structural features, technical features, and global objective features. Each of these categories has different options to further segregate the features for better understanding. The features of clock synchronization protocols that have been used in this survey include all the features which have been used in existing surveys as well as new features such as how the clock value is propagated, when the clock value is propagated, and when the physical clock is updated, which are required for better understanding of the clock synchronization protocols in WSNs in a systematic way. This paper also gives a brief description of a few basic clock synchronization protocols for WSNs, and shows how these protocols fit into the above classification criteria. In addition, the recent clock synchronization protocols for WSNs, which are based on the above basic clock synchronization protocols, are also given alongside the corresponding basic clock synchronization protocols. Indeed, the proposed model for characterizing the clock synchronization protocols in WSNs can be used not only for analyzing the existing protocols but also for designing new clock synchronization protocols. (C) 2014 Elsevier B.V. All rights reserved.