By Topic

Utility driven balanced communication (UDBC) algorithm for data routing 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
$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

3 Author(s)
Afshin Behzadan ; WINCORE Laboratory, Ryerson University, Toronto, Canada ; Alagan Anpalagan ; Bobby Ma

In this paper, a distributed algorithm for the construction of load balanced routing trees in wireless sensor networks is proposed with the goal of prolonging network lifetime. The proposed method, called UDBC, achieves load balancing by adjusting the number of children among parents as much as possible. Child adjustment is considered as a game between parents and child nodes by defining their utility functions. At the game termination, each individual node gains the maximum benefit based on its utility function, and the network as a whole reaches the global goal of forming the balanced tree. UDBC generates more balanced trees compared to similar work in the literature by imposing less time and communication overheads, which is proved by analytical evaluations and simulation results.

Published in:

Communications (QBSC), 2010 25th Biennial Symposium on

Date of Conference:

12-14 May 2010