Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Multicluster, mobile, multimedia radio network
Wireless Networks
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Energy-Aware Routing in Cluster-Based Sensor Networks
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
A fully distributed node allocation scheme for partition protection in MANET
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Secure clustering and symmetric key establishment in heterogeneous wireless sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
Improved load balanced clustering algorithm for wireless sensor networks
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
A Sink-Oriented Layered Clustering Protocol for Wireless Sensor Networks
Mobile Networks and Applications
ELACCA: Efficient Learning Automata Based Cell Clustering Algorithm for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.24 |
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 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 32-approximation algorithm for the problem.