Energy consumption has emerged as a primary issue in the deployment of Wireless Sensor Networks (WSNs). This issue arises due to the energy constraints associated with the Sensor Nodes (SNs) which are considered as their basic component. Since, the functioning of the WSNs completely relies on the sensing and communicating ability of the sensor nodes so the fore most challenge is how to minimize the power dissipation of these nodes. Clustering proved to be an appropriate mechanism to deal with this issue [1]. This paper investigates three partitional clustering algorithms namely K-means, K-medoids, Fuzzy C Means by incorporating an evolutionary technique Differential Evolution (DE). Performance comparison of the proposed algorithms has been done on the basis of the metrics like network throughput, network lifetime and dead nodes per round. The simulation results have shown that suggested algorithm, hybrid K-means/DE performs better than its counterparts.
CITATION STYLE
Sharma, R., Vashisht, V., & Singh, U. (2020). Performance Analysis of Evolutionary Technique Based Partitional Clustering Algorithms for Wireless Sensor Networks. In Advances in Intelligent Systems and Computing (Vol. 1053, pp. 171–180). Springer. https://doi.org/10.1007/978-981-15-0751-9_16
Mendeley helps you to discover research relevant for your work.