A less computationally complex clustering algorithm based on dynamic K-means for increasing lifetime of wireless sensor networks Online publication date: Mon, 07-Feb-2022
by Anupam Choudhary; Sapna Jain; Abhishek Badholia; Anurag Sharma; Brijesh Patel
International Journal of Computer Applications in Technology (IJCAT), Vol. 67, No. 1, 2021
Abstract: Clustering in wireless sensor networks is a critical issue based on network lifetime, energy efficiency, connectivity and scalability. Sensor nodes are capable to collect data from any geographical region using routing protocol. This research endeavours to design a less computationally time complex clustering algorithm for hierarchical homogeneous wireless sensor network to extend network lifetime. It forms optimal number of clusters and reduces data communication span of sensor nodes using dynamic K-means algorithm. Selection of suitable cluster head is based on ratio of remaining energy of sensor node to its distance from centre of cluster. The simulation results prove that algorithm that has been presented achieves better energy efficiency when compared to other hierarchical homogeneous cluster based algorithms. It increases network lifetime, number of alive nodes per round, data delivered to base station, time of first node, middle node and last node to die for scalable situations in terms of node density and size of sensing region.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com