Please use this identifier to cite or link to this item: https://doi.org/10.1145/1089803.1089807
Title: An adaptive wakeup scheme to support fast routing in sensor networks
Authors: Wong, Y.-F.
Ngoh, L.-H.
Wong, W.-C. 
Keywords: Adaptive
Cyclic Block Design
Lonely Node
Pruning Reconstruction
Wakeup Schedule
Issue Date: 2005
Source: Wong, Y.-F.,Ngoh, L.-H.,Wong, W.-C. (2005). An adaptive wakeup scheme to support fast routing in sensor networks. PE-WASUN'05 - Proceedings of the Second ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks : 18-24. ScholarBank@NUS Repository. https://doi.org/10.1145/1089803.1089807
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. Copyright 2005 ACM.
Source Title: PE-WASUN'05 - Proceedings of the Second ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks
URI: http://scholarbank.nus.edu.sg/handle/10635/69275
ISBN: 1595931821
DOI: 10.1145/1089803.1089807
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

11
checked on Dec 5, 2017

Page view(s)

12
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.