计算机与数字工程2019，Vol.47Issue(10)：2392-2395,2401,5.DOI:10.3969/j.issn.1672-9722.2019.10.003
基于K均值聚类的非均匀分簇路由算法∗
Non-uniform Clustering Routing Algorithm Based on K-means Clustering
摘要
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.关键词
LEACH协议/K均值聚类/无线传感网络/最优簇头数Key words
LEACH protocol/K-means clustering/WSN/optimal number of cluster heads分类
信息技术与安全科学引用本文复制引用
孙丽,孙顺远..基于K均值聚类的非均匀分簇路由算法∗[J].计算机与数字工程,2019,47(10):2392-2395,2401,5.基金项目
国家自然科学基金项目(编号:61702228,61773182) （编号:61702228,61773182）
江苏省"六大人才高峰"高层次人才项目(编号:DZXX-026) （编号:DZXX-026）
江苏省博士后科研计划(编号:1601012A) （编号:1601012A）
江苏省自然基金项目(编号:BK20170198)资助. （编号:BK20170198）
