Efficient Load-Balanced Clustering Algorithms for wireless sensor networks

Computer Communications

Volumn 31, Issue 4, 2008, Pages 750-759

  Low, Chor Ping ^a   Fang, Can ^a   Ng, Jim Mee ^a   Ang, Yew Hock ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Clustering; Load balancing; NP hard approximation algorithm; Wireless sensor networks

Indexed keywords

APPROXIMATION ALGORITHMS; CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; RESOURCE ALLOCATION;

DYNAMIC COMMUNICATIONS; LOAD-BALANCED CLUSTERING ALGORITHMS; POLYNOMIAL TIME; SENSOR NODES;

WIRELESS SENSOR NETWORKS;

EID: 39049111000     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2007.10.020     Document Type: Article

References (12)

1. Akyildiz I.F., Su W., Sankarasubramaniam Y., and Cayirci E. Wireless sensor networks: a survey. Computer Networks 38 (2002) 393-422
2. M. Younis, M. Youssef, K. Arisha, Energy-aware routing in cluster-based sensor networks, in: Proc. IEEE/ACM Intl. Symp. on Modeling, Analysis and Simulation of Computer Systems (MASCOTS 2002), TX, USA, 2002.
3. A. Cerpa, D. Estrin, ASCENT: Adaptive self-configuring sensor networks topologies, in: Proc. INFOCOM 2002, New York, June 2002.
4. W. Rabiner Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy-efficient communication protocols for wireless microsensor networks, in: Proc. Hawaii Intl. Conf. on System Sciences (HICSS 00), January 2000.
5. D.J. Baker, A. Emphemides, A distributed algorithm for organizing mobile radio telecommunication networks, in: Proc. Intl. Conf. in Distributed Computer Systems, April 1981.
6. Gerla M., and Tsai J.T.C. Multicluster, mobile, multimedia radio network, ACM/Baltzer. Journal of Wireless Networks 1 (1995) 255-265
7. A.K. Parekh, Selecting routers in Ad-hoc wireless networks, in: Proc. SBT/IEEE Intl. Telecommunications Symposium, August 1994.
8. Krishnan R., and Starobinski D. Efficient clustering algorithms for self-organizing wireless sensor networks. Ad Hoc Networks 4 (2006) 36-39
9. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, New York
10. Lenstra J.K., Shmoys D.B., and Tardos E. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46 (1990) 259-271
11. E.V. Shchepin, N.V. Vakhania, Task distributions on multiprocessor systems, in: Lecture Notes in Computer Science, vol. 1872, 2000, pp. 112-125.
12. Berge C. Two theorems in graph theory. Proceedings of the National Academy Science of United States America 43 (1957) 842-844