By Topic

A spanning tree algorithm for data aggregation in 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
$31 $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

2 Author(s)
Jie Shao ; Coll. of Inf. Sci. & Technol., Nanjing Univ. of Aeronaut. & Astronaut., Nanjing ; Ning Ye

Wireless sensor network can be applied to both abominable and military environments. A primary goal in the design of wireless sensor networks is lifetime maximization, constrained by the energy capacity of batteries. One well-known method to reduce energy consumption in such networks is data aggregation. A spanning tree algorithm for data aggregation based on estimate cost was presented. The paper adopted directed transmission model and message route mechanism. The idea of this algorithm is optimization of data aggregation route by estimate cost about energy, distant and aggregation gain, and then realizes data aggregation trade-off in energy and delay. The benefits of the algorithm were verified through simulation experiments.

Published in:

Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on

Date of Conference:

25-27 June 2008