An Approximation Algorithm for The Load-Balanced Clustering Problem in Wireless Sensor Networks

Wireless sensor networks have been receiving increasing attention in recent years due to their potential applications in the establishment of dynamic communications for emergency/rescue operations, disaster relief efforts, and military networks. In this paper, we investigate the problem of grouping...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of 15th International Conference on Computer Communications and Networks S. 143 - 148
Hauptverfasser: Chor Ping Low, Jim Mee Ng, Yew Hock Ang
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.10.2006
Schlagworte:
approximation algorithm
Approximation algorithms
Biomedical monitoring
clustering
Clustering algorithms
Communication system security
Degradation
Electronic mail
load balancing
NP-hard
Scalability
Sensor phenomena and characterization
Telecommunication traffic
Wireless sensor networks
ISBN:1424405726, 9781424405725
ISSN:1095-2055
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Wireless sensor networks have been receiving increasing attention in recent years due to their potential applications in the establishment of dynamic communications for emergency/rescue operations, disaster relief efforts, and military 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 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 prove that LBCP is NP-hard and we proposed an efficient 3/2-approximation algorithm for the problem.
ISBN:1424405726
9781424405725
ISSN:1095-2055
DOI:10.1109/ICCCN.2006.286262