TY - GEN
T1 - Robust multi-pipeline scheduling in low-duty-cycle wireless sensor networks
AU - Cao, Yongle
AU - Guo, Shuo
AU - He, Tian
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84861620203&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84861620203&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2012.6195773
DO - 10.1109/INFCOM.2012.6195773
M3 - Conference contribution
AN - SCOPUS:84861620203
SN - 9781467307758
T3 - Proceedings - IEEE INFOCOM
SP - 361
EP - 369
BT - 2012 Proceedings IEEE INFOCOM, INFOCOM 2012
T2 - IEEE Conference on Computer Communications, INFOCOM 2012
Y2 - 25 March 2012 through 30 March 2012
ER -