Authors: Susmit Bagchi
Addresses: Samsung India Software Operations, C.V. Raman Nagar, Bangalore, India
Abstract: The clustering of sensor nodes of the Wireless Sensor Networks (WSNs) has received considerable research attention in recent time. The sensor devices of a WSN are severely resource constrained having limited operational lifetime. The clustering of sensor nodes provides longer operational lifetime of the nodes and facilitates data aggregation. This paper proposes a distributed algorithm for clustering of sensor nodes based on the one-hop-neighbours of the nodes. The cluster heads of the clusters are elected based on the local energy levels of the nodes without involving any distributed messaging. This paper presents the design, analysis and experimental evaluation of the algorithm. A comparative analysis of the algorithm is also included.
Keywords: wireless sensor networks; WSNs; mote; clustering algorithms; message complexity; hopping; energy-aware clustering; distributed algorithms; wireless networks.
International Journal of Sensor Networks, 2010 Vol.7 No.1/2, pp.37 - 43
Available online: 26 Feb 2010 *Full-text access for editors Access for subscribers Purchase this article Comment on this article