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.

Acoustic response of vortex breakdown modes in a coaxial isothermal unconfined swirling jet

The present experimental work is concerned with the study of amplitude dependent acoustic response of an isothermal coaxial swirling jet. The excitation amplitude is increased in five distinct steps at the burner's Helmholtz resonator mode (i.e., 100 Hz). Two flow states are compared, namely, sub-critical and super-critical vortex breakdown (VB) that occur before and after the critical conical sheet breakdown, respectively. The geometric swirl number is varied in the range 2.14-4.03. Under the influence of external pulsing, global response characteristics are studied based on the topological changes observed in time-averaged 2D flow field. These are obtained from high resolution 2D PIV (particle image velocimetry) in the longitudinal-mid plane. PIV results also illustrate the changes in the normalized vortex core coordinates (r(vcc)/(r(vcc))(0) (Hz), y(vcc)/(y(vcc))(0) (Hz)) of internal recirculation zone (IRZ). A strong forced response is observed at 100 Hz (excitation frequency) in the convectively unstable region which get amplified based on the magnitude of external forcing. The radial extent of this forced response region at a given excitation amplitude is represented by the acoustic response region (b). The topological placement of the responsive convectively unstable region is a function of both the intensity of imparted swirl (characterized by swirl number) and forcing amplitude. It is observed that for sub-critical VB mode, an increase in the excitation amplitude till a critical value shifts the vortex core centre (particularly, the vortex core moves downstream and radially outwards) leading to drastic fanning-out/widening of the IRZ. This is accompanied by similar to 30% reduction in the recirculation velocity of the IRZ. It is also observed that b < R (R: radial distance from central axis to outer shear layer-OSL). At super-critical amplitudes, the sub-critical IRZ topology transits back (the vortex core retracts upstream and radially inwards) and finally undergoes a transverse shrinkage ((r(vcc))/(r(vcc))(0 Hz) decreases by similar to 20%) when b >= R. In contrast, the vortex core of super-critical breakdown mode consistently spreads radially outwards and is displaced further downstream. Finally, the IRZ fans-out at the threshold excitation amplitude. However, the acoustic response region b is still less than R. This is explained based on the characteristic geometric swirl number (S-G) of the flow regimes. The super-critical flow mode with higher S-G (hence, higher radial pressure drop due to rotational effect which scales as Delta P similar to rho u theta(2) and acts inwards towards the center line) compared to sub-critical state imposes a greater resistance to the radial outward spread of b. As a result, the acoustic energy supplied to the super-critical flow mode increases the degree of acoustic response at the pulsing frequency and energizes its harmonics (evident from power spectra). As a disturbance amplifier, the stronger convective instability mode within the flow structure of super-critical VB causes the topology to widen/fan-out severely at threshold excitation amplitude. (C) 2015 AIP Publishing LLC.

Molecular Dissection of Mycobacterium tuberculosis Integration Host Factor Reveals Novel Insights into the Mode of DNA Binding and Nucleoid Compaction

The annotated whole-genome sequence of Mycobacterium tuberculosis indicated that Rv1388 (Mtihf) likely encodes a putative 20 kDa integration host factor (mIHF). However, very little is known about the functional properties of mIHF or organization of mycobacterial nucleoid. Molecular modeling of the mIHF three-dimensional structure, based on the cocrystal structure of Streptomyces coelicolor IHF-duplex DNA, a bona fide relative of mIHF, revealed the presence of Arg170, Arg171, and Arg173, which might be involved in DNA binding, and a conserved proline (P150) in the tight turn. The phenotypic sensitivity of Escherichia coli Delta ihfA and Delta ihfB strains to UV and methylmethanesulfonate could be complemented with the wild-type Mtihf, but not its alleles bearing mutations in the DNA-binding residues. Protein DNA interaction assays revealed that wild-type mIHF, but not its DNA-binding variants, bind with high affinity to fragments containing attB and attP sites and curved DNA. Strikingly, the functionally important amino acid residues of mIHF and the mechanism(s) underlying its binding to DNA, DNA bending, and site-specific recombination are fundamentally different from that of E. coli IHF alpha beta. Furthermore, we reveal novel insights into IHF-mediated DNA compaction depending on the placement of its preferred binding sites; mIHF promotes compaction of DNA into nucleoid-like or higher-order filamentous structures. We hence propose that mIHF is a distinct member of a subfamily of proteins that serve as essential cofactors in site-specific recombination and nucleoid organization and that these findings represent a significant advance in our understanding of the role(s) of nucleoid-associated proteins.

Experimental and numerical studies on protection of buried pipelines and underground utilities using geocells

This paper presents the results of the laboratory model tests and the numerical studies conducted on small diameter PVC pipes, buried in geocell reinforced sand beds. The aim of the study was to evaluate the suitability of the geocell reinforcement in protecting the underground utilities and buried pipelines. In addition to geocells, the efficacy of only geogrid and geocell with additional basal geogrid cases were also studied. A PVC (Poly Vinyl Chloride) pipe with external diameter 75 mm and thickness 1.4 mm was used in the experiments. The vehicle tire contact pressure was simulated by applying the pressure on the top of the bed with the help of a steel plate. Results suggest that the use of geocells with additional basal geogrid considerably reduces the deformation of the pipe as compared to other types of reinforcements. Further, the depth of placement of pipe was also varied between 1B to 2B (B is the width of loading plate) below the plate in the presence of geocell with additional basal geogrid. More than 50% reduction in the pressure and more than 40% reduction in the strain values were observed in the presence of reinforcements at different depths as compared to the unreinforced beds. Conversely, the performance of the subgrade soil was also found to be marginally influenced by the position of the pipe, even in the presence of the relatively stiff reinforcement system. Further, experimental results were validated with 3-dimensional numerical studies using FLAC(3D) (Fast Lagrangian Analysis of Continua in 3D). A good agreement in the measured pipe stain values were observed between the experimental and numerical studies. Numerical studies revealed that the geocells distribute the stresses in the lateral direction and thus reduce the pressure on the pipe. In addition, the results of the 1-g model tests were scaled up to the prototype case of the shallow buried pipeline below the pavement using the appropriate scaling laws. (C) 2015 Elsevier Ltd. All rights reserved.

An addition to the endemic Indian radiation of Eutropis: Phylogenetic position of Eutropis dissimilis Hallowell (Squamata: Scincidae)

Skinks of the genus Eutropis represent one of the most widespread and speciose lizard groups in tropical Asia. Numerous recent studies have utilized a variety of genes and methods to reconstruct the phylogeny of these lizards, however these studies have not resolved the placement of one of the widely distributed Eutropis Fitzinger, E. dissimilis. We have sequenced a specimen of E. dissimilis from the type locality and our result suggests that it is part of the Indian radiation of Eutropis and not related to African Trachylepis Fitzinger or Southeast Asian Dasia Gray as previously suggested. Furthermore, we report that the sequence of E. dissimilis used in an earlier study of the once cosmopolitan genus `Mabuya' may have been erroneously identified and appears to be a sequence of E. novemcarinata. We also demonstrate that the evolution of a clear lower eyelid, which was considered a synapomorphy for the sister genus Trachylepis, has arisen multiple times in Eutropis.

An approximation to the QoS aware throughput region of a tree network under IEEE 802.15.4 CSMA/CA with application to wireless sensor network design

In the context of wireless sensor networks, we are motivated by the design of a tree network spanning a set of source nodes that generate packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count, that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive explicit conditions on the packet generation rates at the sources, so that the tree network approximately provides certain quality of service (QoS) such as end-to-end delivery probability and mean delay. The structures of our conditions provide insight on the dependence of the network performance on the arrival rate vector, and the topological properties of the tree network. Our numerical experiments suggest that our approximations are able to capture a significant part of the QoS aware throughput region (of a tree network), that is adequate for many sensor network applications. Furthermore, for the special case of equal arrival rates, default backoff parameters, and for a range of values of target QoS, we show that among all path-length-bounded trees (spanning a given set of sources and the data sink) that meet the conditions derived in the paper, a shortest path tree achieves the maximum throughput. (C) 2015 Elsevier B.V. All rights reserved.

Uncertainty Quantification in Ultrasonic Wave Based Detection of Delamination in Composite Structures

In this paper we consider the problem of guided wave scattering from delamination in laminated composite and further the problem of estimating delamination size and layer-wise location from the guided wave measurement. Damage location and region/size can be estimated from time of flight and wave packet spread, whereas depth information can be obtained from wavenumber modulation in the carrier packet. The key challenge is that these information are highly sensitive to various uncertainties. Variation in reflected and transmitted wave amplitude in a bar due to boundary/interface uncertainty is studied to illustrate such effect. Effect of uncertainty in material parameters on the time of flight are estimated for longitudinal wave propagation. To evaluate the effect of uncertainty in delamination detection, we employ a time domain spectral finite element (tSFEM) scheme where wave propagation is modeled using higher-order interpolation with shape function have spectral convergence properties. A laminated composite beam with layer-wise placement of delamination is considered in the simulation. Scattering due to the presence of delamination is analyzed. For a single delamination, two identical waveforms are created at the two fronts of the delamination, whereas waves in the two sub-laminates create two independent waveforms with different wavelengths. Scattering due to multiple delaminations in composite beam is studied.

Campaigning in Heterogeneous Social Networks: Optimal Control of SI Information Epidemics

We study the optimal control problem of maximizing the spread of an information epidemic on a social network. Information propagation is modeled as a susceptible-infected (SI) process, and the campaign budget is fixed. Direct recruitment and word-of-mouth incentives are the two strategies to accelerate information spreading (controls). We allow for multiple controls depending on the degree of the nodes/individuals. The solution optimally allocates the scarce resource over the campaign duration and the degree class groups. We study the impact of the degree distribution of the network on the controls and present results for Erdos-Renyi and scale-free networks. Results show that more resource is allocated to high-degree nodes in the case of scale-free networks, but medium-degree nodes in the case of Erdos-Renyi networks. We study the effects of various model parameters on the optimal strategy and quantify the improvement offered by the optimal strategy over the static and bang-bang control strategies. The effect of the time-varying spreading rate on the controls is explored as the interest level of the population in the subject of the campaign may change over time. We show the existence of a solution to the formulated optimal control problem, which has nonlinear isoperimetric constraints, using novel techniques that is general and can be used in other similar optimal control problems. This work may be of interest to political, social awareness, or crowdfunding campaigners and product marketing managers, and with some modifications may be used for mitigating biological epidemics.

Generic identity of Camptorrhiza indica (Colchicaceae) based on cytogenetics and molecular phylogenetics

The tribe Iphigenieae (Colchicaceace, Liliales) includes two genera, viz. Camptorrhiza and Iphigenia, which are distributed in Africa, India, and Australasia. Iphigenia is represented by 12 species, of which six occur in India while Camptorrhiza comprises one species each in Africa (C. strumosa) and India (C. indica). The genus Camptorrhiza possesses a knee-shaped tuber attached to the corms, filaments with a thick bulge in the middle and styles with single stigma. Iphigenia on the other hand lacks knee-shaped tuber, bears linear filaments and has styles with three stigmas. Camptorrhiza indica possesses ovoid corms, linear filaments and styles with a single stigma. These characters are intermediate between Iphigenia and Camptorrhiza and hence we studied the cytogenetics and phylogenetic placement of this species to ascertain its generic identity. Somatic chromosome count (2n = 22) and karyotypic features of C. indica are very similar to that of Iphigenia species. Molecular phylogenetic studies based on atpB-rbcL, rps16, trnL, and trnL-F regions showed that C. indica is nested within a lineage of Indian Iphigenia species. Thus, C. indica was reduced to a species of Iphigenia, i.e., I. ratnagirica. Camptorrhiza is now a monotypic genus restricted only to southern Africa. A key to the Indian Iphigenia species is provided. In addition, a new combination Wurmbea novae-zelandiae is proposed for Iphigenia novae-zelandiae.

Fast Multiple Access Selection through variable power transmissions

Many wireless applications demand a fast mechanism to detect the packet from a node with the highest priority ("best node") only, while packets from nodes with lower priority are irrelevant. In this paper, we introduce an extremely fast contention-based multiple access algorithm that selects the best node and requires only local information of the priorities of the nodes. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities onto the receive power. It is based on a key result that shows that mapping onto a set of discrete receive power levels is optimal, when the power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture, idle channel, or collision. We also show how reliable information regarding the total received power at the receiver can be used to improve the algorithm by enhancing the feedback mechanism. The algorithm detects the packet from the best node in 1.5 to 2.1 slots, which is considerably lower than the 2.43 slot average achieved by the best algorithm known to date.

A Slotted Aloha joint MAC-cum-Routing protocol for data gathering sensor network applications

In this paper we have proposed and implemented a joint Medium Access Control (MAC) -cum- Routing scheme for environment data gathering sensor networks. The design principle uses node 'battery lifetime' maximization to be traded against a network that is capable of tolerating: A known percentage of combined packet losses due to packet collisions, network synchronization mismatch and channel impairments Significant end-to-end delay of an order of few seconds We have achieved this with a loosely synchronized network of sensor nodes that implement Slotted-Aloha MAC state machine together with route information. The scheme has given encouraging results in terms of energy savings compared to other popular implementations. The overall packet loss is about 12%. The battery life time increase compared to B-MAC varies from a minimum of 30% to about 90% depending on the duty cycle.

Asymmetric allylic alkylation by palladium-bisphosphinites

A series of new chiral palladium-bisphosphinite complexes have been prepared from readily available, naturally occurring chiral alcohols. The complexes were used to efficiently carry out catalytic allylic alkylation of 1,3-diphenylpropene-2-yl acetate with dimethyl malonate. The complexes based on derivatives of ascorbic acid carry out enantioselective alkylations, one of which showed an ee as high as 97%. Based on the structural characterization, it can be surmised that strategic placement of phenyl groups is key to higher enantioselectivities.

Correlation, Coding, and Cooperation in Wireless Sensor Networks

We consider a single-hop data-gathering sensor network, consisting of a set of sensor nodes that transmit data periodically to a base-station. We are interested in maximizing the lifetime of this network. With our definition of network lifetime and the assumption that the radio transmission energy consumption forms the most significant portion of the total energy consumption at a sensor node, we attempt to enhance the network lifetime by reducing the transmission energy budget of sensor nodes by exploiting three system-level opportunities. We pose the problem of maximizing lifetime as a max-min optimization problem subject to the constraint of successful data collection and limited energy supply at each node. This turns out to be an extremely difficult optimization to solve. To reduce the complexity of this problem, we allow the sensor nodes and the base-station to interactively communicate with each other and employ instantaneous decoding at the base-station. The chief contribution of the paper is to show that the computational complexity of our problem is determined by the complex interplay of various system-level opportunities and challenges.

Optimized Policies for the Retransmission Probabilities in Slotted Aloha

In this paper, we study the behaviour of the slotted Aloha multiple access scheme with a finite number of users under different traffic loads and optimize the retransmission probability q(r) for various settings, cost objectives and policies. First, we formulate the problem as a parameter optimization problem and use certain efficient smoothed functional algorithms for finding the optimal retransmission probability parameter. Next, we propose two classes of multi-level closed-loop feedback policies (for finding in each case the retransmission probability qr that now depends on the current system state) and apply the above algorithms for finding an optimal policy within each class of policies. While one of the policy classes depends on the number of backlogged nodes in the system, the other depends on the number of time slots since the last successful transmission. The latter policies are more realistic as it is difficult to keep track of the number of backlogged nodes at each instant. We investigate the effect of increasing the number of levels in the feedback policies. Wen also investigate the effects of using different cost functions (withn and without penalization) in our algorithms and the corresponding change in the throughput and delay using these. Both of our algorithms use two-timescale stochastic approximation. One of the algorithms uses one simulation while the other uses two simulations of the system. The two-simulation algorithm is seen to perform better than the other algorithm. Optimal multi-level closed-loop policies are seen to perform better than optimal open-loop policies. The performance further improves when more levels are used in the feedback policies.

An efficient pricing based protocol for broadcasting in wireless ad hoc networks

In many applications of wireless ad hoc networks, wireless nodes are owned by rational and intelligent users. In this paper, we call nodes selfish if they are owned by independent users and their only objective is to maximize their individual goals. In such situations, it may not be possible to use the existing protocols for wireless ad hoc networks as these protocols assume that nodes follow the prescribed protocol without deviation. Stimulating cooperation among these nodes is an interesting and challenging problem. Providing incentives and pricing the transactions are well known approaches to stimulate cooperation. In this paper, we present a game theoretic framework for truthful broadcast protocol and strategy proof pricing mechanism called Immediate Predecessor Node Pricing Mechanism (IPNPM). The phrase strategy proof here means that truth revelation of cost is a weakly dominant-strategy (in game theoretic terms) for each node. In order to steer our mechanism-design approach towards practical implementation, we compute the payments to nodes using a distributed algorithm. We also propose a new protocol for broadcast in wireless ad hoc network with selfish nodes based on IPNPM. The features of the proposed broadcast protocol are reliability and a significantly reduced number of packet forwards compared to the number of network nodes, which in turn leads to less system-wide power consumption to broadcast a single packet. Our simulation results show the efficacy of the proposed broadcast protocol.