A Combination of Kruskal and K-means Algorithms for Network Lifetime Extension in Wireless Sensor Networks
Wadii Jlassi, Rim Haddad, Ridha Bouallègue, Raed M. Shubair · 2021
Recently, the deployment of Wireless Sensor Networks (WSNs) increases in various applications. These networks are dispersed in an inaccessible area and have to operate on small batteries. Energy is one of the most critical resources since sensor nodes sense, collect, process and send data to its base station. Many researches have demonstrated the importance of clustering to extend the lifetime of wireless sensor networks. Clustering algorithms consider several parameters like the density, the residual energy, and the distance separating the base station and the nodes to select the appropriate cluster heads. In this paper, K-means algorithm is first used to select a set of Cluster Heads (CHs) from all the nodes. Then we propose the Kruskal algorithm to define the optimal path between CHs and BS. Simulation results show that the proposed combination allows improved lifetime extension compared with existing algorithms.