基于K-means的无线传感器网络分簇算法研究  

Study on Clustering Algorithms in Wireless Sensor Networks Based on K-means

作　　者：蒋青云[1] 

机构地区：[1]湖南省妇幼保健院信息中心,湖南长沙410008

出　　处：《计算机与现代化》2012年第10期38-40,45,共4页Computer and Modernization

摘　　要：提出一种基于K-均值聚类的无线传感器网络分簇算法。从K-均值聚类算法中要解决的合理聚类数的确定、初始聚类中心的选择以及聚类性能对目标函数的依赖这三个问题入手,运用K-均值聚类算法来实现无线传感器网络分簇。仿真与性能分析结果表明,基于K-均值聚类的无线传感器网络分簇算法既能节省节点能量、延长网络生命,又能改善网络中的能耗均衡,并保证簇首分布的均匀性。A clustering algorithm based on K-means clustering for WSN is proposed. Since the questions of the determining number of the best clusters, the choice of initial cluster centers and objective function are settled, then the sub-clusters of WSN can be achieved with the K-means clustering algorithm. Finally, evaluating the sub-cluster algorithm performance and simulating it which shows that the WSN clustering algorithm based on the K-means clustering can not only save energy and prolong the life of the network, but also improve the energy consumption of a balanced network and ensure uniform distribution of the clustering heads.

关 键 词：无线传感器网络 分簇 K-均值聚类 簇首 簇首备份 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]