Towards Energy Efficient k-MEANS Based Clustering Scheme for Wireless Sensor Networks

Clustering is one of the effective methods which are applied in the wireless sensor networks to preserve the precious battery power of sensor nodes. Various clustering approaches have been proposed in the literature and LEACH is one of clustering and routing schemes which can be used to manage the sensor network. In this paper, we present an improved version of LEACH protocol which uses Kmeans clustering algorithm for selecting better nodes for clusterhead role. Our proposed solution tries to create symmetric clusters and by reducing the average intra-cluster communications distance, improves the network lifetime. It also, considers the sink location when the sink node is positioned far away and selects nodes as clusterhead which will consume less energy for handling cluster members. Thus, because, sensed data are transmitted to the closer clusterheads, our proposed clustering solution can prolong the network lifetime.