By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chor Ping Low ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Jim Mee Ng ; Yew Hock Ang

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.

Published in:

Computer Communications and Networks, 2006. ICCCN 2006. Proceedings.15th International Conference on

Date of Conference:

9-11 Oct. 2006