Research on Clustering Algorithm of Wireless Sensor Networks Based on K-means
SHANG Lixin
JIAO Xinquan
Abstract：For the problems of uneven energy consumption caused by unreasonable cluster header election and uneven cluster-ing of traditional hierarchical routing protocol LEACH in wireless sensor network,this paper proposes an improved WSN clustering algorithm LEACH-KTM based on K-means clustering algorithm.The algorithm is mainly improved from three aspects:cluster es-tablishment,cluster head election and data transmission.The algorithm uses the radio energy loss model to establish the expression of the optimal number of cluster heads,and proposes that the triangle midline method KTM(K-means Triangle midline)reasonably selects the initial cluster center and completes the clustering by combining the optimal number of cluster heads.Each round is car-ried out within the cluster by an improved cluster head election threshold function.The data transmission adopts a combination of single-hop and multi-hop,and relay nodes are elected within the cluster to share the cluster head task.The algorithm proposes the intercluster deviation function and the reclustering condition,and the number of rounds that meet the clustering condition during the network operation needs to be reclustered.The simulation results show that the LEACH-KTM algorithm has more balanced energy consumption,which effectively prolongs the life cycle of the network.
Keywords：wireless sensor networkenergy consumption balanceuniform clusteringLEACHK-means
Publication Date：2025-08-20
Online Publishing Date：2025-12-12(First online date of this platform, not the publication date of the document)
Pages：7( 2101-2107 )