Data aggregation scheduling in duty-cycled multihop wireless networks subject to physical interference

Document Type

Conference Proceeding

Publication Date


Publication Title

Proceedings - 2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks, MSN 2019

First Page


Last Page



Data aggregation schedule, Duty-cycled scenarios, Multihop wireless networks, Physical interference model


© 2019 IEEE. Minimum-Latency Aggregation Scheduling (MLAS) has been well studied when all the networking nodes are always active. However, it is well-known that the nodes often switch between the active state and the sleep state to save energy. A node in duty-cycled scenarios with active/sleep cycles may require transmitting multiple times to send the message to all of its neighbors due to their different active times. MLAS in multihop wireless networks with Duty-Cycled scenarios (MLASDC) has also been well-studied under graph-based interference models such as the protocol interference model. To the best of our knowledge, no approximation algorithms have been proposed for MLASDC subject to physical interference. This is the first paper to develop efficient approximation algorithms for MLASDC subject to physical interference. The data aggregation schedule produced by our algorithm proposed in this paper achieves an approximation ratio at most a constant time of the length of a scheduling period if the maximum degree Δ of the network is bounded.

This document is currently not available here.