Title: A survey on clustering algorithms for wireless sensor networks

Authors: Olutayo Boyinbode, Hanh Le, Makoto Takizawa

Addresses: Computer Science Department, University of Cape Town, Room 314.10, Computer Science Building, Rondebosch 7700, South Africa. ' Computer Science Department, University of Cape Town, Room 314.10, Computer Science Building, Rondebosch 7700, South Africa. ' Department of Computer and Information Science, Seikei University, 3-3-1 Kichijoji-kitamachi, Musashino-shi, Tokyo 180-8633, Japan

Abstract: A wireless sensor network (WSN) consisting of a large number of tiny sensors can be an effective tool for gathering data in diverse kinds of environments. The data collected by each sensor is communicated to the base station, which forwards the data to the end user. Clustering is introduced to WSNs because it has proven to be an effective approach to provide better data aggregation and scalability for large WSNs. Clustering also conserves the limited energy resources of the sensors. This paper synthesises existing clustering algorithms in WSNs and highlights the challenges in clustering.

Keywords: wireless sensor networks; WSNs; clustering algorithms; energy consumption; energy efficiency; wireless networks.

DOI: 10.1504/IJSSC.2011.040339

International Journal of Space-Based and Situated Computing, 2011 Vol.1 No.2/3, pp.130 - 136

Published online: 26 Mar 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article