By Topic

An Efficient Scheme for Minimum-Latency Data Aggregation in Two- and Three-Dimensional Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hongju Cheng ; Coll. of Math. & Comp. Sci., Fuzhou Univ., Fuzhou, China ; Feifei Li ; Laurence T. Yang ; Naixue Xiong

Data aggregation is generally considered an important method used to reduce traffic and increase lifetime of wireless sensor networks in both two- and three-dimensional space. It is challenging to develop efficient data aggregation solution for the wireless sensor networks since quality-of-service, such as end-to-end delay, is considered as a severe criterion required in many scenarios. In this paper we focus on the minimum-latency data aggregation problem, which was proved to be NP-hard, and proposed a new efficient scheme including both the aggregation tree construction process and the scheduling algorithm to determine the transmission time for all nodes in the network with collision avoided. We have proved that the upper bound for data aggregation with our proposed scheme is bounded by (15R + Λ - 15) for wireless sensor networks in two-dimensional space. We have also simulated the case in three-dimensional wireless sensor networks. Extensive simulation results have shown that the proposed scheme has better performance compared with related works.

Published in:

Cloud and Green Computing (CGC), 2012 Second International Conference on

Date of Conference:

1-3 Nov. 2012