Load-Balanced Clustering Algorithms for Wireless Sensor Networks

In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gateway nodes, will act as cluster-heads for each cluster and the objective is to balance the load among these gateways. Load bala...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2007 IEEE International Conference on Communications S. 3485 - 3490
Hauptverfasser: Low, Chor Ping, Fang, Can, Ng, Jim Mee, Ang, Yew Hock
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2007
Schlagworte:
Approximation algorithms
Clustering algorithms
Communications Society
Degradation
Peer to peer computing
Polynomials
Scalability
Sensor phenomena and characterization
Telecommunication traffic
Wireless sensor networks
ISBN:9781424403530, 1424403537
ISSN:1550-3607
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gateway nodes, will act as cluster-heads for each cluster and the objective is to balance the load among these gateways. Load balanced clustering increases system stability and improves the communication between the various nodes in the network. We call the problem addressed in this paper as the load-balanced clustering problem (LBCP). We first show that a special case of LBCP (whereby the traffic load contributed by all sensor nodes are the same) is optimally solvable in polynomial time. We next prove that the general case of LBCP is NP-hard. We then proposed an efficient 2/3-approximation algorithm for the problem.
ISBN:9781424403530
1424403537
ISSN:1550-3607
DOI:10.1109/ICC.2007.576