Hierarchical Clustering Routing Algorithm for Wireless Sensor Networks

Abstract

Aiming at the problem that the uneven node distribution and the limited energy of nodes in wireless sensor networks, a clustering routing algorithm for wireless sensor networks based on hierarchical clustering is proposed. No need to calculate the optimal number of cluster heads in advance. Randomly distributed nodes in the network were divided into several original clusters according to the hierarchical clustering algorithm. During network working, the clusters were selected according to node residual energy and position in the original clusters. The cluster head got the distance of the node farthest from it within the original cluster and used that distance as the communication range for sending broadcast messages. Ordinary nodes chose to communicate with the cluster head of the same original cluster or with the sink node depending on the distance. The simulation results show that the algorithm can reasonably complete the clustering and better extend the network life cycle compared with LEACH and KM-LEACH.