Research on clustering routing algorithm based on K-means++ for WSN

Clustering routing algorithm is frequently applied in Wireless Sensor Network, which has the characteristics of high efficiency and long life cycle. However, the randomness of choosing cluster head leads to uneven clustering and unbalanced energy consumption. The method of single-hop data transmission also increases the energy burden of the nodes. In order to address the above problems, an improved algorithm is proposed in this paper. In the clustering stage, the base station uses K-means++ algorithm to divide the cluster evenly, then the improved cluster head election formula is uesd to choose cluster head, finally, the shortest path is selected for inter-cluster transmission in the stage of data transmission. The simulation results show that the proposed algorithm is better than traditional clustering routing algorithm in prolonging life cycle of nodes and improving the life cycle of the network.