Conference Paper

An adaptive wakeup scheme to support fast routing in sensor networks.

DOI: 10.1145/1089803.1089807 Conference: Proceedings of the 2nd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2005, Montreal, Quebec, Canada, October 10-13, 2005
Source: DBLP

ABSTRACT We propose a novel routing asynchronous wakeup scheme - Adaptive Wakeup Schedule Function (AWSF), which adapts to deployment topography to support fast routing in sensor networks. Unlike most other wakeup schemes such as the random and cyclic designs, AWSF guarantees hard delay bounds, have better average delays and smaller delay variances, and eliminates the "Lonely Node" problem where nodes wakeup to find no communicable neighbours. Since AWSF assumes complete radio turn-off in the "sleep" mode, it is largely different from most data-centric wakeup schemes where the radio modules are only put to "idle" mode for "data snooping" where real energy savings cannot be achieved. We provide simulation results to support our claims and have implemented our solution on real Crossbow Mica2 motes.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Recently, sensors networks are proposed for underwater industrial applications - such as the lucrative business of seismic imaging of underwater oil wells. Underwater sensing systems present a far more challenging problem to solve, given additional communication bandwidth constraints and a sparse deployment of these underwater sensor nodes. We present a suitable wakeup schedule designed for underwater monitoring applications and support our scheme with simulation results.
    Industrial Informatics, 2006 IEEE International Conference on; 09/2006
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present an efficient data reporting control scheme in a cluster-based hierarchical wireless sensor network, which has two components: (i) intra-cluster data reporting control (IntraDRC) scheme and (ii) inter-cluster control (InterDRC) scheme. The IntraDRC scheme controls the amount of traffic generated in a cluster by selecting a certain number of data reporting nodes based on the desired throughput specified by the end system. On the other hand, the InterDRC scheme offers differentiated reporting paths from a cluster to a sink based on the traffic characteristics. InterDRC considers two parameters: one is the hop counts to a sink to deal with the end-to-end delay constraint while the other is the amount of traffic, generated in a cluster and forwarded from its adjacent clusters, to deal with energy consumption. The proposed scheme applies the block design concept from Combinatorial theory to design a novel data reporting node selection approach. IntraDRC employs the node sets created by block designs as the initial reporting schedule. This schedule can be updated by the request of a reporting node when its queue size approaches a predefined threshold. We consider two network models in the paper. The first model considers homogeneous networks in which every node has the same capabilities and adjacent cluster heads are connected in a multi-hop manner. The second model considers heterogeneous networks in which the cluster heads have high capabilities in terms of processing power and transmission range to directly reach adjacent cluster heads in a single-hop manner. Simulation results show that our scheme achieves good throughput performance while providing stable data reporting that is independent of the network density. The scheme also allows for energy savings by using load balanced data reporting paths.
    Computer Communications 07/2010; · 1.08 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks typically conserve energy by following a periodic wakeup-sleep schedule: nodes minimize idle time and spend most of their time in a low power sleep state. In order to communicate and exchange data in such a network, the current duty-cycling MAC protocols either require tight synchronization between the neighbor wakeup schedules or spend a significant amount of energy in signaling the sleeping nodes. In contrast, this paper presents Neighborhood-based Power Management (NPM), an energy efficient asynchronous MAC protocol that minimizes signaling overhead through opportunistically gained knowledge about neighbor wakeup schedules. Unlike the synchronization-based MAC protocols, NPM does not require a priori knowledge of the wakeup schedules. Using only a minimal exchange of schedule information, NPM reduces the signaling overhead by shortening the wakeup signal. Furthermore, NPM uses its wakeup signal to awaken all receivers in the neighborhood of the sender, enabling all sender-receiver pairs in that neighborhood to communicate. Our extensive evaluations show that NPM outperforms popular B-MAC, X-MAC and SCP protocols under all network conditions. NPM reduces the signaling overhead, with up to 74% savings in energy and 80% reduction in delay.
    Mobile Adhoc and Sensor Systems (MASS), 2010 IEEE 7th International Conference on; 12/2010