An adaptive wakeup scheme to support fast routing in sensor networks

  • Authors:
  • Yew-Fai Wong;Lek-Heng Ngoh;Wai-Choong Wong

  • Affiliations:
  • Institute for Infocomm Research, Singapore;Institute for Infocomm Research, Singapore;The National University of Singapore, Singapore

  • Venue:
  • PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.