An Energy-Efficient Distributed Algorithm for Minimum-Latency Aggregation Scheduling in Wireless Sensor Networks

Authors:
Yingshu Li;Longjiang Guo;Sushil K. Prasad
Affiliations:
-;-;-
Venue:
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Year:
2010

Citing 0
Cited 8

Query-based data aggregation within WSN through Monte Carlo simulation

Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
Minimum-time aggregation scheduling in duty-cycled wireless sensor networks

Journal of Computer Science and Technology - Special issue on Natural Language Processing
An efficient data collection scheme through multi-path routing structures in wireless sensor networks

International Journal of Sensor Networks
Continuous data aggregation and capacity in probabilistic wireless sensor networks

Journal of Parallel and Distributed Computing
Distributed data collection in large-scale asynchronous wireless sensor networks under the generalized physical interference model

IEEE/ACM Transactions on Networking (TON)
Latency-minimizing data aggregation in wireless sensor networks under physical interference model

Ad Hoc Networks
Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks

Journal of Parallel and Distributed Computing
An efficient algorithm for scheduling sensor data collection through multi-path routing structures

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data aggregation is an essential yet time-consuming task in wireless sensor networks (WSNs). This paper studies the well-known Minimum-Latency Aggregation Schedule (MLAS) problem and proposes an energy-efficient distributed scheduling algorithm named Clu-DDAS based on a novel cluster-based aggregation tree. Our approach differs from all the previous schemes where Connected Dominating Sets or Maximal Independent Sets are employed. We prove that Clu-DDAS has a latency bound of 4R′ + 2Delta − 2, where Delta is the maximum degree and R′ is the inferior network radius which is smaller than the network radius R. Clu-DDAS has comparable latency as the previously best centralized algorithm E-PAS, while Clu-DDAS consumes 78% less energy as shown by the simulation results. Clu-DDAS outperforms the previously best distributed algorithm DAS whose latency bound is 16R′ + Delta − 14 on both latency and energy consumption. On average, Clu-DDAS transmits 67% fewer total messages than DAS does. We also propose an adaptive strategy for updating the schedule to accommodate dynamic network topology.