A node-centric load balancing algorithm for wireless sensor networks

Hui Dai; Richard Han

doi:10.1109/GLOCOM.2003.1258297

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 proceeding › Conference proceeding contribution › peer-review

117 Citations (Scopus)

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.

Original language	English
Title of host publication	GLOBECOM - IEEE Global Telecommunications Conference
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	548-552
Number of pages	5
ISBN (Electronic)	0780379756
ISBN (Print)	0780379748
DOIs	https://doi.org/10.1109/GLOCOM.2003.1258297
Publication status	Published - 2003
Externally published	Yes
Event	46th IEEE Global Telecommunications Conference GLOBECOM'03 - San Francisco, CA, United States Duration: 1 Dec 2003 → 5 Dec 2003

Conference

Conference	46th IEEE Global Telecommunications Conference GLOBECOM'03
Country/Territory	United States
City	San Francisco, CA
Period	1/12/03 → 5/12/03

Access to Document

10.1109/GLOCOM.2003.1258297

Cite this

@inproceedings{1dafb4b8afb94f3cbdfe7b45fb1d14f0,

title = "A node-centric load balancing algorithm for wireless sensor networks",

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.",

author = "Hui Dai and Richard Han",

year = "2003",

doi = "10.1109/GLOCOM.2003.1258297",

language = "English",

isbn = "0780379748",

pages = "548--552",

booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "46th IEEE Global Telecommunications Conference GLOBECOM'03 ; Conference date: 01-12-2003 Through 05-12-2003",

}

Dai, H & Han, R 2003, A node-centric load balancing algorithm for wireless sensor networks. in GLOBECOM - IEEE Global Telecommunications Conference. Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 548-552, 46th IEEE Global Telecommunications Conference GLOBECOM'03, San Francisco, CA, United States, 1/12/03. https://doi.org/10.1109/GLOCOM.2003.1258297

TY - GEN

T1 - A node-centric load balancing algorithm for wireless sensor networks

AU - Dai, Hui

AU - Han, Richard

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0842332478&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2003.1258297

DO - 10.1109/GLOCOM.2003.1258297

M3 - Conference proceeding contribution

SN - 0780379748

SP - 548

EP - 552

BT - GLOBECOM - IEEE Global Telecommunications Conference

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - 46th IEEE Global Telecommunications Conference GLOBECOM'03

Y2 - 1 December 2003 through 5 December 2003

ER -

A node-centric load balancing algorithm for wireless sensor networks

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this