Title :
Robust multi-pipeline scheduling in low-duty-cycle wireless sensor networks
Author :
Cao, Yongle ; Guo, Shuo ; He, Tian
Author_Institution :
Comput. Sci. & Eng, Univ. of Minnesota, Minneapolis, MN, USA
Abstract :
Data collection is one of the major traffic pattern in wireless sensor networks, which requires regular source nodes to send data packets to a common sink node with limited end-to-end delay. However, the sleep latency brought by duty cycling mode results in significant rise on the delivery latency. In order to reduce unnecessary forwarding interruption, the state-of-the-art has proposed pipeline scheduling technique by allocating sequential wakeup time slots along the forwarding path. We experimentally show that previously proposed pipeline is fragile and ineffective in reality when wireless communication links are unreliable. To overcome such challenges and improve the performance on the delivery latency, we propose Robust Multi-pipeline Scheduling (RMS) algorithm to coordinate multiple parallel pipelines and switch the packet timely among different pipelines if failure happens in former attempts of transmissions. RMS combines the pipeline features with the advantages brought by multi-parents forwarding. Large-scale simulations and testbed implementations verify that the end-to-end delivery latency can be reduced by 40% through exploiting multi-pipeline scheduled forwarding path with tolerable energy overhead.
Keywords :
radio links; scheduling; wireless sensor networks; RMS algorithm; data collection; data packets; duty cycling mode; end-to-end delay; end-to-end delivery latency; low-duty-cycle wireless sensor networks; multiparent forwarding; multiple-parallel pipelines; packet switching; robust multipipeline scheduling; sequential wakeup time slots; sink node; sleep latency; source nodes; wireless communication links; Delay; Network topology; Pipelines; Schedules; Scheduling; Switches; Wireless sensor networks;
Conference_Titel :
INFOCOM, 2012 Proceedings IEEE
Conference_Location :
Orlando, FL
Print_ISBN :
978-1-4673-0773-4
DOI :
10.1109/INFCOM.2012.6195773