无线传感器网络分簇路由中基于自适应的簇头轮换算法  

An Adaptive Cluster-Heads Rotating Algorithm for the Clustering Routing in Wireless Sensor Networks

作　　者：冯咲[1] 张慧档[1] FENG Xiao;ZHANG Huidang(College of Information Science and Engineering,Henan University of Technology,Zhengzhou 450001,China)

机构地区：[1]河南工业大学信息科学与工程学院,郑州450001

出　　处：《传感技术学报》2018年第6期949-956,共8页Chinese Journal of Sensors and Actuators

基　　金：河南省科技攻关项目(142102210039);郑州市新兴产业研究(20150506)

摘　　要：分簇路由方案是无线传感器网络中低能耗路由设计的主要方法,簇头轮换机制是平衡分簇路由中节点能耗的有效手段。然而,如何优化簇头轮换间隔却鲜见文献研究。基于簇树工作周期的概念,提出了一个簇头轮换间隔的优化算法,实现了自适应簇头轮换机制。同时,为了减少簇头数量,该文提出了一个基于连通支配集CDS(Connected Dominating Set)的分簇算法。仿真中,与4种不同长度的定长间隔簇头轮换策略进行了对比试验,结果表明自适应簇头轮换策略具有最长的网络寿命和最大的网络能量利用率;与Top Disc和Guho等经典算法进行了对比,该文提出的算法构造的CDS具有最小规模和直径。In wireless sensor networks,clustering routing scheme is the main method for low energy routing design,and cluster-heads rotating algorithm is an effective way to balance the nodes energy consumption in clustering routing. However,few studies have been done on how to calculate cluster-heads rotating intervals. A cluster-heads rotating interval optimization algorithm is proposed based on the concept of cluster-tree working period,and the adaptive cluster-heads rotating mechanism is implemented. Meanwhile,in order to reduce the number of the cluster-heads,this paper proposes a clustering algorithm based on CDS（ connected dominating set）. In the simulation experiment,compared with four cluster-heads rotating strategies which have different fixed-length rotating intervals,the results show that the adaptive cluster-heads rotating algorithm has the longest network lifetime; compared with classical algorithms such as TopDisc and Guho,the results show that the CDS constructed by the proposed algorithm has the minimum size and diameter.

关 键 词：无线传感器网络 连通支配集 分簇路由 簇头轮换 

分 类 号：TN92[电子电信—通信与信息系统]