Lossy links, low power, high throughput
Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems
Delay-efficient data aggregation scheduling in duty-cycled wireless sensor networks
Proceedings of the 2012 ACM Research in Applied Computation Symposium
| Hi-index | 0.00 |
In this work, we introduce the concept of Dynamic Switch-based Forwarding (DSF) that optimizes the 1) expected data delivery ratio, 2) expected communication delay, or 3) expected energy consumption for low-duty-cycle wireless sensor networks under unreliable communication links. DSF is designed for networks with possibly unreliable communication links and predetermined node communication schedules. 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 [CHECK END OF SENTENCE], {\rm PRR}\times{\rm D} [CHECK END OF SENTENCE], and DESS [CHECK END OF SENTENCE]). We also demonstrate our solution defaults into ETX in always-awake networks and DESS in perfect-link networks.