Minimum-latency data aggregation in duty-cycled wireless sensor networks under physical interference model

Data aggregation is ubiquitous in wireless sensor networks (WSNs). Much work investigates how to reduce the data aggregation latency. However, previous work assumes that nodes do not sleep, and it is unclear how to schedule the data aggregation in duty-cycled scenarios. In this paper, we focus on the Minimum-Latency Data Aggregation problem in duty-cycled WSNs under physical interference model (MLDA-DP problem). We propose two efficient algorithms and prove that their data aggregation latency is bounded. Extensive simulations are conducted to evaluate the performance of our algorithms.