By Topic

A load balancing algorithm based on probabilistic multi-tree for 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

5 Author(s)
Tzu-Ping Chung ; Dept. of Bio-Ind. Mechatron. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Tzu-Shiang Lin ; Xiang-Yao Zheng ; Ping-Lang Yen
more authors

To extend the lifetime of a large wireless sensor network, it is important to spread the inevitable energy consumption (loads) across the network, and thus reduce hot spots. This article introduces a two-step solution to this issue based on the AODV tier allocation with multiple paths to disperse loads from hot spots. After the allocation, paths for nodes to transmit data back to the sink are decided through a probabilistic approach. By computer simulation, it is shown with various indexes that the performance of the proposed algorithm is better than that of deterministic approaches after network deployment, and an appropriate state can be reached in reasonable time.

Published in:

Sensing Technology (ICST), 2011 Fifth International Conference on

Date of Conference:

Nov. 28 2011-Dec. 1 2011