TY - GEN
T1 - Safeguarding schedule updates in wireless sensor networks
AU - Cao, Yongle
AU - Zhong, Ziguo
AU - Gu, Yu
AU - He, Tian
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=79960869259&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960869259&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2011.5935236
DO - 10.1109/INFCOM.2011.5935236
M3 - Conference contribution
AN - SCOPUS:79960869259
SN - 9781424499212
T3 - Proceedings - IEEE INFOCOM
SP - 606
EP - 610
BT - 2011 Proceedings IEEE INFOCOM
T2 - IEEE INFOCOM 2011
Y2 - 10 April 2011 through 15 April 2011
ER -