DocumentCode :
2466057
Title :
A node-centric load balancing algorithm for wireless sensor networks
Author :
Dai, Hui ; Han, Richard
Author_Institution :
Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA
Volume :
1
fYear :
2003
fDate :
1-5 Dec. 2003
Firstpage :
548
Abstract :
By spreading the workload across a sensor network, load balancing reduces hot spots in the sensor network and increases the energy lifetime of the sensor network. In this paper, we design a node-centric algorithm that constructs a load-balanced tree in sensor networks of asymmetric architecture. We utilize a Chebyshev Sum metric to evaluate via simulation the balance of the routing trees produced by our algorithm. We find that our algorithm achieves routing trees that are more effectively balanced than the routing based on breadth-first search (BFS) and shortest-path obtained by Dijkstra´s algorithm.
Keywords :
resource allocation; telecommunication network routing; tree searching; wireless sensor networks; Chebyshev Sum metric; asymmetric architecture; breadth-first search; load balancing; node-centric load balancing algorithm; routing trees; wireless sensor networks; Algorithm design and analysis; Base stations; Biomedical monitoring; Chebyshev approximation; Collaborative work; Computer science; Energy consumption; Load management; Routing; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE
Print_ISBN :
0-7803-7974-8
Type :
conf
DOI :
10.1109/GLOCOM.2003.1258297
Filename :
1258297
Link To Document :
بازگشت