DocumentCode :
1946741
Title :
Safeguarding schedule updates in wireless sensor networks
Author :
Cao, Yongle ; Zhong, Ziguo ; Gu, Yu ; He, Tian
Author_Institution :
Comput. Sci. & Eng., Univ. of Minnesota, Minneapolis, MN, USA
fYear :
2011
fDate :
10-15 April 2011
Firstpage :
606
Lastpage :
610
Abstract :
Working in the duty cycling mode enables sensor nodes to utilize limited energy efficiently instead of unnecessary idle listening. In such networks, awareness of neighboring nodes´ working schedules is essential, especially when each node sets up the schedule independently. Most traditional research assumes that a node can always share its working schedule with its neighbors once it joins the network. However, dynamic energy supply and varied requirements of system performance make adjusting duty cycles necessary. Consequently, sensor nodes have to regularly change their schedules and advertise the new schedule to their one-hop neighbors. In this work, instead of changing nodes´ working schedule directly, we introduce SSD, a staged and smooth design for safeguarding schedule updates. Our design is aimed at bounding average packet loss rate with a minimum energy cost. We evaluate our design with large-scale simulation and show that under the comparable packet loss rate, our design saves up to 35% energy compared with the minimal packet loss solution.
Keywords :
wireless sensor networks; dynamic energy supply; idle listening; large-scale simulation; minimum energy cost; neighboring nodes; one-hop neighbors; packet loss rate; safeguarding schedule updates; sensor nodes; wireless sensor networks; Loss measurement; Merging; Radiation detectors; Receivers; Schedules; Synchronization; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM, 2011 Proceedings IEEE
Conference_Location :
Shanghai
ISSN :
0743-166X
Print_ISBN :
978-1-4244-9919-9
Type :
conf
DOI :
10.1109/INFCOM.2011.5935236
Filename :
5935236
Link To Document :
بازگشت