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

Full description

Saved in:
Bibliographic Details
Main Authors: Chor Ping Low, Jim Mee Ng, Yew Hock Ang
Format: Conference Proceeding
Language:English
Subjects:
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
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1095-2055
2637-9430
DOI:10.1109/ICCCN.2006.286262