Open Access
Translator Disclaimer
2013 Layer-Based Data Aggregation and Performance Analysis in Wireless Sensor Networks
Hongju Cheng, Yongzhao Chen, Naixue Xiong, Feifei Li
J. Appl. Math. 2013(SI26): 1-12 (2013). DOI: 10.1155/2013/502381


Due to the similarity and correlation among sensed data in wireless sensor network, it is an important way to reduce the number of packets transmitted with data aggregation technology so as to prolong the network lifetime. However, data aggregation is still a challenging issue since quality-of-service, such as end-to-end delay, is generally considered as a severe criterion required in many applications. We focus on the minimum-latency data aggregation problem and proposed a new efficient scheme for it. The basic idea is that we first build an aggregation tree by ordering nodes into layers, and then we proposed a scheduling algorithm on the basis of the aggregation tree to determine the transmission time slots for all nodes in the network with collision avoiding. We have proved that the upper bound for data aggregation with our proposed scheme is bounded by ( 15 R + Δ - 15 ) for wireless sensor networks in two-dimensional space. Extensive simulation results have demonstrated that the proposed scheme has better practical performance compared with related works.


Download Citation

Hongju Cheng. Yongzhao Chen. Naixue Xiong. Feifei Li. "Layer-Based Data Aggregation and Performance Analysis in Wireless Sensor Networks." J. Appl. Math. 2013 (SI26) 1 - 12, 2013.


Published: 2013
First available in Project Euclid: 7 May 2014

zbMATH: 06950710
MathSciNet: MR3096024
Digital Object Identifier: 10.1155/2013/502381

Rights: Copyright © 2013 Hindawi


Vol.2013 • No. SI26 • 2013
Back to Top