Sciweavers

Share
ICC
2007
IEEE

Load-Balanced Clustering Algorithms for Wireless Sensor Networks

9 years 1 months ago
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 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 3 2 -approximation algorithm for the problem.
Chor Ping Low, Can Fang, Jim Mee Ng, Yew Hock Ang
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Where ICC
Authors Chor Ping Low, Can Fang, Jim Mee Ng, Yew Hock Ang
Comments (0)
books