TY - GEN
T1 - Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links
AU - Gu, Yu
AU - He, Tian
PY - 2007
Y1 - 2007
N2 - In extremely low duty-cycle sensor networks, end-to-end communications cannot afford to maintain an always-awake communication backbone. Low duty-cycle, accompanied by the unreliable nature of wireless communication, makes it essential to design a new data forwarding scheme for such networks, so as to achieve network energy efficiency, reliability, and timeliness in an integrated fashion. In this work, we introduce the concept of dynamic switchbased forwarding (DSF) that optimizes the (i) expected data delivery ratio, (ii) expected communication delay, or (iii) expected energy consumption. DSF is designed for networks with possibly unreliable communication links and predetermined node communication schedules. Interestingly, we reveal that allowing opportunistic looping can actually reduce the end-to-end delay. To our knowledge, these are the most encouraging results to date in this new research direction. In this paper, DSF is evaluated with a theoretical analysis, extensive simulation, and physical testbed consisting of 20 MicaZ motes. Results reveal the remarkable advantage of DSF in extremely low duty-cycle sensor networks in comparison to three well-known solutions (ETX [3], PRRxD [19] and DESS [16]). We also demonstrate our solution defaults into ETX in always-awake networks and DESS in perfect-link networks.
AB - In extremely low duty-cycle sensor networks, end-to-end communications cannot afford to maintain an always-awake communication backbone. Low duty-cycle, accompanied by the unreliable nature of wireless communication, makes it essential to design a new data forwarding scheme for such networks, so as to achieve network energy efficiency, reliability, and timeliness in an integrated fashion. In this work, we introduce the concept of dynamic switchbased forwarding (DSF) that optimizes the (i) expected data delivery ratio, (ii) expected communication delay, or (iii) expected energy consumption. DSF is designed for networks with possibly unreliable communication links and predetermined node communication schedules. Interestingly, we reveal that allowing opportunistic looping can actually reduce the end-to-end delay. To our knowledge, these are the most encouraging results to date in this new research direction. In this paper, DSF is evaluated with a theoretical analysis, extensive simulation, and physical testbed consisting of 20 MicaZ motes. Results reveal the remarkable advantage of DSF in extremely low duty-cycle sensor networks in comparison to three well-known solutions (ETX [3], PRRxD [19] and DESS [16]). We also demonstrate our solution defaults into ETX in always-awake networks and DESS in perfect-link networks.
KW - DSF
KW - Data forwarding
KW - Lossy radio link
KW - Low duty-cycle
UR - http://www.scopus.com/inward/record.url?scp=77954257263&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77954257263&partnerID=8YFLogxK
U2 - 10.1145/1322263.1322294
DO - 10.1145/1322263.1322294
M3 - Conference contribution
AN - SCOPUS:77954257263
SN - 9781595937636
T3 - SenSys'07 - Proceedings of the 5th ACM Conference on Embedded Networked Sensor Systems
SP - 321
EP - 334
BT - SenSys'07 - Proceedings of the 5th ACM Conference on Embedded Networked Sensor Systems
T2 - 5th ACM International Conference on Embedded Networked Sensor Systems, SenSys'07
Y2 - 6 November 2007 through 9 November 2007
ER -