PROBESYNC: Platform Based Synchronization for Enhanced Life of Large Scale Wireless Sensor Networks

Optimization in energy consumption of the existing synchronization mechanisms can lead to substantial gains in terms of network life in Wireless Sensor Networks (WSNs). In this paper, we analyze ERBS and TPSN, two existing synchronization algorithms for WSNs which use widely different approach, and compare their performance in large scale WSNs each of which consists of different type of platform and has varying node density. We, then, propose a novel algorithm, PROBESYNC, which takes advantage of differences in power required to transmit and receive a message on ERBS and TPSN and leverages the shortcomings of each of these algorithms. This leads to considerable improvement in energy conservation and enhanced life of large scale WSNs.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Understanding data flow and security requirements in wireless Body Area Networks for healthcare

The Body Area Network (BAN) is an emerging technology that focuses on monitoring physiological data in, on and around the human body. BAN technology permits wearable and implanted sensors to collect vital data about the human body and transmit it to other nodes via low-energy communication. In this paper, we investigate interactions in terms of data flows between parties involved in BANs under four different scenarios targeting outdoor and indoor medical environments: hospital, home, emergency and open areas. Based on these scenarios, we identify data flow requirements between BAN elements such as sensors and control units (CUs) and parties involved in BANs such as the patient, doctors, nurses and relatives. Identified requirements are used to generate BAN data flow models. Petri Nets (PNs) are used as the formal modelling language. We check the validity of the models and compare them with the existing related work. Finally, using the models, we identify communication and security requirements based on the most common active and passive attack scenarios.

A design procedure for micromachined antennas on semiconductor substrates

Micromachined antennas are recieving great interest as carrier frequencies move higher into the frequency spectrum due to their superior performance and amenability for integration with active devices. However their design is cumbersome owing to the complexity of the structure. To overcome this, in this paper, an iterative procedure is suggested to facilitate fast design of micromachined patch antennas based on a simulation study. A microstrip line on a micromachined Silicon substrate is simulated in a full wave simulator by solving for the ports only. From the obtained propagation constant, the effective dilectric constant for the micromachined substrate is estimated. The process is repeated for a number of values of the width of the microstrip and a plot is made for the variation of the effective dielectric constant with the microstrip width. Then an iterative method in combination with the extrapolated permittivity which includes the effect of cavity extensions in all the directions, is used to obtain the width and the corresponding effective dielectric constant. This method has been verified to be quite accurate by comparison with full wave simulations and hence it can function as a good starting point for designers to design micromachined antennas.

Peptide mimics for structural features in proteins. Crystal structures of three heptapeptide helices with a C-terminal 6-->1 hydrogen bond.

The crystal structure determination of three heptapeptides containing alpha-aminoisobutyryl (Aib) residues as a means of helix stabilization provides a high-resolution characterization of 6-->1 hydrogen-bonded conformations, reminiscent of helix-terminating structural features in proteins. The crystal parameters for the three peptides, Boc-Val-Aib-X-Aib-Ala-Aib-Y-OMe, where X and Y are Phe, Leu (I), Leu, Phe (II) and Leu, Leu (III) are: (I) space group P1, Z = 1, a = 9.903 A, b = 10.709 A, c = 11.969 A, alpha = 102.94 degrees, beta = 103.41 degrees, gamma = 92.72 degrees, R = 4.55%; (II) space group P21, Z = 2, a = 10.052 A, b = 17.653 A, c = 13.510 A, beta = 108.45 degrees, R = 4.49%; (III) space group P1, Z = 2 (two independent molecules IIIa and IIIb in the asymmetric unit), a = 10.833 A, b = 13.850 A, c = 16.928 A, alpha = 99.77 degrees, beta = 105.90 degrees, gamma = 90.64 degrees, R = 8.54%. In all cases the helices form 3(10)/alpha-helical (or 3(10)helical) structures, with helical columns formed by head-to-tail hydrogen bonding. The helices assemble in an all-parallel motif in crystals I and III and in an antiparallel motif in II. In the four crystallographically characterized molecules, I, II, IIIa and IIIb, Aib(6) adopts a left-handed helical (hL) conformation with positive phi, psi values, resulting in 6-->1 hydrogen-bond formation between Aib(2) CO and Leu(7)/Phe(7) NH groups. In addition a 4-->1 hydrogen bond is seen between Aib(3) CO and Aib(6) NH groups. This pattern of hydrogen bonding is often observed at the C-terminus of helices proteins, with the terminal pi-type turn being formed by four residues adopting the hRhRhRhL conformation.

An analytical approach to the study of cooperation in wireless ad hoc networks

In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the best interest of a node to always accept relay requests. On the other hand, if all nodes decide not to expend energy in relaying, then network throughput will drop dramatically. Both these extreme scenarios (complete cooperation and complete noncooperation) are inimical to the interests of a user. In this paper, we address the issue of user cooperation in ad hoc networks. We assume that nodes are rational, i.e., their actions are strictly determined by self interest, and that each node is associated with a minimum lifetime constraint. Given these lifetime constraints and the assumption of rational behavior, we are able to determine the optimal share of service that each node should receive. We define this to be the rational Pareto optimal operating point. We then propose a distributed and scalable acceptance algorithm called Generous TIT-FOR-TAT (GTFT). The acceptance algorithm is used by the nodes to decide whether to accept or reject a relay request. We show that GTFT results in a Nash equilibrium and prove that the system converges to the rational and optimal operating point.

The transient response of a two-terminal solion to a step-current input

The transition time associated with the time-variation of the voltage across a two-terminal diaphragm-less solion in response to a step-current stimulus has been studied experimentally. A theoretical analysis has also been made by solving the diffusion problem under the appropriate initial and boundary conditions. The behaviour of the theoretically predicted transition times is in agreement with the observed behaviour. The systems under study have been shown to be different from those used hitherto in thin-layer chronopotentiometry.

The transient response of a two-terminal solion to a stepcrrent input

The transition time associated with the time-variation of the voltage across a two-terminal diaphragm-less solion in response to a step-current stimulus has been studied experimentally. A theoretical analysis has also been made by solving the diffusion problem under the appropriate initial and boundary conditions. The behaviour of the theoretically predicted transition times is in agreement with the observed behaviour. The systems under study have been shown to be different from those used hitherto in thin-layer chronopotentiometry.

The Critical Role of N- and C-Terminal Contact in Protein Stability and Folding of a Family 10 Xylanase under Extreme Conditions

Background: Stabilization strategies adopted by proteins under extreme conditions are very complex and involve various kinds of interactions. Recent studies have shown that a large proportion of proteins have their N- and C-terminal elements in close contact and suggested they play a role in protein folding and stability. However, the biological significance of this contact remains elusive. Methodology: In the present study, we investigate the role of N- and C-terminal residue interaction using a family 10 xylanase (BSX) with a TIM-barrel structure that shows stability under high temperature,alkali pH, and protease and SDS treatment. Based on crystal structure,an aromatic cluster was identified that involves Phe4, Trp6 and Tyr343 holding the Nand C-terminus together; this is a unique and important feature of this protein that might be crucial for folding and stabilityunder poly-extreme conditions. Conclusion: A series of mutants was created to disrupt this aromatic cluster formation and study the loss of stability and function under given conditions. While the deletions of Phe4 resulted in loss of stability, removal of Trp6 and Tyr343 affected in vivo folding and activity. Alanine substitution with Phe4, Trp6 and Tyr343 drastically decreased stability under all parameters studied. Importantly,substitution of Phe4 with Trp increased stability in SDS treatment.Mass spectrometry results of limited proteolysis further demonstrated that the Arg344 residue is highly susceptible to trypsin digestion in sensitive mutants such as DF4, W6A and Y343A, suggesting again that disruption of the Phe4-Trp6-Tyr343 (F-W-Y) cluster destabilizes the N-and C-terminal interaction. Our results underscore the importance of N- and C-terminal contact through aromatic interactions in protein folding and stability under extreme conditions, and these results may be useful to improve the stability of other proteins under suboptimal conditions.

Design of incentive compatible protocols for wireless networks: A game theoretic approach

In this thesis work, we design rigorous and efficient protocols/mechanisms for different types of wireless networks using a mechanism design [1] and game theoretic approach [2]. Our work can broadly be viewed in two parts. In the first part, we concentrate on ad hoc wireless networks [3] and [4]. In particular, we consider broadcast in these networks where each node is owned by independent and selfish users. Being selfish, these nodes do not forward the broadcast packets. All existing protocols for broadcast assume that nodes forward the transit packets. So, there is need for developing new broadcast protocols to overcome node selfishness. In our paper [5], we develop a strategy proof pricing mechanism which we call immediate predecessor node pricing mechanism (IPNPM) and an efficient new broadcast protocol based on IPNPM. We show the efficacy of our proposed broadcast protocol using simulation results.

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.

QoS with selfish nodes in wireless networks

The IEEE 802.1le medium access control (MAC) standard provides distributed service differentiation or Quality-of- Service (QoS) by employing a priority system. In 802.1 le networks, network traffic is classified into different priorities or access categories (ACs). Nodes maintain separate queues for each AC and packets at the head-of-line (HOL) of each queue contend for channel access using AC-specific parameters. Such a mechanism allows the provision of differentiated QoS where high priority, performance sensitive traffic such as voice and video applications will enjoy less delay, greater throughput and smaller loss, compared to low priority traffic (e. g. file transfer). The standard implicitly assumes that nodes are honest and will truthfully classify incoming traffic into its appropriate AC. However, in the absence of any additional mechanism, selfish users can gain enhanced performance by selectively classifying low priority traffic as high priority, potentially destroying the QoS capability of the system.

An auction algorithm for procuring wireless channel in a heterogenous wireless network

In this paper, we develop a novel auction algorithm for procuring wireless channel by a wireless node in a heterogeneous wireless network. We assume that the service providers of the heterogeneous wireless network are selfish and non-cooperative in the sense that they are only interested in maximizing their own utilities. The wireless user needs to procure wireless channels to execute multiple tasks. To solve the problem of the wireless user, we propose a reverse optimal (REVOPT) auction and derive an expression for the expected payment by the wireless user. The proposed auction mechanism REVOPT satisfies important game theoretic properties such as Bayesian incentive compatibility and individual rationality.

Stochastic models of IEEE 802.11e wireless net works with multimedia applications

We provide a survey of some of our recent results ([9], [13], [4], [6], [7]) on the analytical performance modeling of IEEE 802.11 wireless local area networks (WLANs). We first present extensions of the decoupling approach of Bianchi ([1]) to the saturation analysis of IEEE 802.11e networks with multiple traffic classes. We have found that even when analysing WLANs with unsaturated nodes the following state dependent service model works well: when a certain set of nodes is nonempty, their channel attempt behaviour is obtained from the corresponding fixed point analysis of the saturated system. We will present our experiences in using this approximation to model multimedia traffic over an IEEE 802.11e network using the enhanced DCF channel access (EDCA) mechanism. We have found that we can model TCP controlled file transfers, VoIP packet telephony, and streaming video in the IEEE802.11e setting by this simple approximation.

A new scheme for establishing pairwise keys for wireless sensor networks

This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key predistribution technique. Inspired by the recent proxy-based scheme in [1] and [2], we introduce a fiiend-based scheme for establishing pairwise keys securely. We show that the chances of finding friends in a neighbourhood are considerably more than that of finding proxies, leading to lower communication overhead. Further, we prove that the friendbased scheme performs better than the proxy-based scheme in terms of resilience against node capture.