A nonuniform clustering routing algorithm based on an improved k-means algorithm

Abstract

In a large-scale wireless sensor network (WSN), densely distributed sensor nodes process a large amount of data. The aggregation of data in a network can consume a great amount of energy. To balance and reduce the energy consumption of nodes in a WSN and extend the network life, this paper proposes a nonuniform clustering routing algorithm based on the improved K-means algorithm. The algorithm uses a clustering method to form and optimize clusters, and it selects appropriate cluster heads to balance network energy consumption and extend the life cycle of the WSN. To ensure that the cluster head (CH) selection in the network is fair and that the location of the selected CH is not concentrated within a certain range, we chose the appropriate CH competition radius. Simulation results show that, compared with LEACH, LEACH-C, and the DEEC clustering algorithm, this algorithm can effectively balance the energy consumption of the CH and extend the network life.