Inter-cluster multi-hop routing algorithm based on K-means

In this paper, a clustering routing algorithm (KICMH) of uniform clustering and load balancing based on K-means is proposed aimed at LEACH algorithm existing defects of uneven clustering and the randomness of cluster-head election. First, the K-means clustering algorithm is used to cluster the network according to the location information of nodes, so as to achieve load balancing of the whole network. The nodes run for cluster heads according to their distance from the center of the cluster and from the base station and the remaining energy to achieve load balancing within the cluster. After the success of the cluster head campaign, the Dijkstra algorithm is used to generate the shortest path of the cluster head to the base station according to the overhead of sending data to the base station and to build a network topology. In order to reduce the additional energy loss caused by constructing the network topology, the process is realized by the base station. For verifying the performance and accuracy of the algorithm proposed in this paper, simulation is carried out by experiments. The results show that the KICMH algorithm proposed in this paper is significantly better than the original algorithm in clustering uniformity, energy load balancing and network lifetime.