Improved LEACH Algorithm Based on K-means in Clustering
英文摘要
As the classic rounting algorithm in WSN, LEACH would bring the problem that the number of cluster heads are far from expectation and cluster heads distribution are concentrated.In order to solve that, we propose an improved LEACH algorithm based on K-means in clustering.The algorithm divide network nodes into k fixed clus ters at set-up using K-means clustering.At each round the largest energy node is selected as cluster head(CH).Then the aggregated data is transmitted from CH to Base Station(BS).Simulation results show that it can increase the number of alive nodes and improve network performance.What＇＇s more, it＇＇s more significant on uneven distributed network.
