Abstract
For low-duty-cycle wireless sensor networks, multihop broadcasting is a challenging problem, since every node has its own working schedules. In this paper, we design a novel broadcasting algorithm, of which key idea is to let some early wake-up nodes postpone their wake-up slots to overhear broadcasting message from its neighbors. This design utilizes the spatiotemporal locality of broadcasting to reduce the number of transmissions. We show that to find the broadcasting schedule with minimal latency and optimized total energy consumption is NP-hard, and then design an approximation algorithm that can guarantee the optimality of broadcasting latency and achieve a polylogarithmic approximation ratio for total energy consumption. Compared with the traditional solution, extensive experimental results show that our algorithm achieves the minimal broadcasting latency while reducing energy consumption significantly.
Original language | English |
---|---|
Title of host publication | Proceedings - IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2013 |
Pages | 163-167 |
Number of pages | 5 |
DOIs | |
Publication status | Published - 1 Dec 2013 |
Event | 10th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2013 - Hangzhou, China Duration: 14 Oct 2013 → 16 Oct 2013 |
Conference
Conference | 10th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2013 |
---|---|
Country/Territory | China |
City | Hangzhou |
Period | 14/10/13 → 16/10/13 |
Keywords
- Broadcast scheduling
- Energy efficient
- Low-duty-cycle WSNs
- Minimal latency
ASJC Scopus subject areas
- Computer Networks and Communications