基于K均值聚类的非均匀分簇路由算法

Non-uniform Clustering Routing Algorithm Based on K-means Clustering

针对LEACH协议中簇头选择存在随机性,频繁性,不合理性等问题,提出了一种基于K均值聚类的非均匀分簇路由算法。该算法通过求最优解得到网络节点的簇头最优数,结合K-means聚类算法,将网络中随机分布的节点按照簇头数分成若干簇,在每个簇中选择距离聚类中心最近的节点作为簇头,简化了LEACH协议中的簇建立阶段,有效减少了网络中频繁进行簇头选择和簇建立过程的能量消耗,使得网络生命周期得以延长。通过分析Matlab仿真结果,可以看出与传统LEACH协议、SEP协议相比,论文算法能够更好地优化簇结构,减少节点不必要的能耗从而提高网络的稳定性,有效延长整个网络的生存周期。

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 centers 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 proposed algorithm can optimize the cluster structure,reduce the unnecessary energy consumption of nodes,improve the network stability and effectively extend the life cycle of the entire network.