摘要
针对无线传感网中经典的分簇路由协议LEACH分簇数量随机和分簇不均匀导致网络能耗大的问题,提出基于K-Means的均匀分簇路由(KUCR)算法。KUCR算法在网络初始化时由基站采用K-Means聚类算法,根据所有节点的地理位置和节点ID计算并形成k个均匀分簇并通告给网络节点,分簇后簇内节点采用分布式方法基于自身剩余能量和距基站的距离竞选簇首,剩余能量高且距离近的节点成为簇头。至此完成网络初始化,此后网络运行的每一轮中不再重新分簇只是在簇内更新簇首。簇首负责簇内数据收集并发送给基站。通过仿真比较KUCR、LEACH与LEACH-C,KUCR使得无线传感网中各个节点能耗更均衡,网络生存期更长,并降低了网络时延。
The number of clusters is random and not uniform in the classical LEACH routing protocol in wireless sensor network, so a Uniform Clustering Routing based on K-Means （KUCR） is proposed in this paper. KUCR uses K-means clustering algorithm with node position to make k uniform clusters and then informs the nodes. In clusters, every node campaigns for the header based on its residual energy and the distance to the BS, the node which has more energy and nearer distance would be the header. Every round of network operation resident, network clustering doesn＇t run again, the cluster header is only updated in the cluster based on the energy and the distance. The header will transfer the data from the node in the cluster to the BS. Compared with LEACH and LEACH-C, the KUCR algorithm could better balance the energy consumption for each node in the wireless network, prolong the lifetime, and reduce the delay of the network.
出处
《控制工程》
CSCD
北大核心
2015年第6期1181-1185,共5页
Control Engineering of China
基金
陕西省科技厅项目(2015NY047)
榆林市科技研究发展项目(2014cxy-03-3)
