Non-uniform Clustering Routing Algorithm Based on K-means Clustering
SUN Li
SUN Shunyuan
Abstract：Aiming at the problems of randomness,frequentness and irrationality of cluster head selection in LEACH protocol, a non-uniform clustering routing algorithm based on K-means clustering is proposed. This algorithm obtains the optimal number of cluster heads of network nodes by finding the optimal solution. Combined with K-means clustering algorithm,randomly distributed nodes in the network are divided into several clusters according to the number of cluster heads. In each cluster,distance cluster cen?ters the nearest node as a cluster head simplifies the cluster establishment phase in the LEACH protocol and effectively reduces the energy consumption of the frequent cluster head selection and cluster establishment in the network,which prolongs the network life cycle. By analyzing the Matlab simulation results,compared with the traditional LEACH protocol and the SEP protocol,the pro?posed algorithm can optimize the cluster structure,reduce the unnecessary energy consumption of nodes,improve the network sta?bility and effectively extend the life cycle of the entire network.
Keywords：LEACH protocolK-means clusteringWSNoptimal number of cluster heads
Publication Date：2019-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 2392-2395,2401 )