A node-centric load balancing algorithm for wireless sensor networks

Hui Dai*, Richard Han

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

117 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages5
ISBN (Electronic)0780379756
ISBN (Print)0780379748
Publication statusPublished - 2003
Externally publishedYes
Event46th IEEE Global Telecommunications Conference GLOBECOM'03 - San Francisco, CA, United States
Duration: 1 Dec 20035 Dec 2003


Conference46th IEEE Global Telecommunications Conference GLOBECOM'03
Country/TerritoryUnited States
CitySan Francisco, CA


Dive into the research topics of 'A node-centric load balancing algorithm for wireless sensor networks'. Together they form a unique fingerprint.

Cite this