Approaching the optimal schedule for data aggregation in wireless sensor networks

Authors:
Pei Wang;Yuan He;Liusheng Huang
Affiliations:
Department of Computer Science, University of Science and Technology of China, China;Department of Computer Science, Hong Kong University of Science and Technology, China;Department of Computer Science, University of Science and Technology of China, China
Venue:
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Year:
2010

Citing 9
Cited 0

Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
An analysis of a large scale habitat monitoring application

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Fast distributed algorithm for convergecast in ad hoc geometric radio networks

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Underground structure monitoring with wireless sensor networks

Proceedings of the 6th international conference on Information processing in sensor networks
Passive diagnosis for wireless sensor networks

Proceedings of the 6th ACM conference on Embedded network sensor systems
Nonthreshold-Based Event Detection for 3D Environment Monitoring in Sensor Networks

IEEE Transactions on Knowledge and Data Engineering
Canopy closure estimates with GreenOrbs: sustainable sensing in the forest

Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Iso-Map: Energy-Efficient Contour Mapping in Wireless Sensor Networks

IEEE Transactions on Knowledge and Data Engineering
Minimum data aggregation time problem in wireless sensor networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper focuses on the latency of data aggregation. Previously, it has been proved that the problem of minimizing the latency of data aggregation is NP-hard [1]. Using maximum independent set and first fit algorithms, in this study we design a scheduling algorithm, Peony-tree-based Data Aggregation (PDA), which has a latency bound of 15R + Δ - 15, where R is the network radius (measured in hops) and Δ is the maximum node degree. We theoretically analyze the performance of PDA based on different network models, and further evaluate it through extensive simulations. Both the analytical and simulation results demonstrate the advantages of PDA over the state-of-art algorithm in [2], which has a latency bound of 23R + Δ - 18.