一种基于死亡节点与半径调度的LEACH覆盖保持协议分析.PDFVIP

2016年12月 北 京 邮 电 大 学 学 报 Dec.2016 第39卷 第6期 Journal of Beijing University of Posts and Telecommunications Vol.39 No.6 摇 摇 文章编号:1007鄄5321(2016)06鄄0047鄄06 DOI:10.13190/ j.jbupt.2016.06.009 一种基于死亡节点与半径调度的LEACH覆盖保持协议 董摇 颖,摇 倪佳伟,摇 吴摇 昊,摇 崔梦瑶,摇 王雨后 (吉林大学 通信工程学院,长春 130012) 摘要:提出了一种基于死亡节点与半径调度的低功耗自适应集簇分层型(LEACH)覆盖保持协议,对簇头的随机选 择机制进行了阈值的联合优化,采用泰森多边形对簇头节点进行Voronoi 图划分,并根据簇头节点和簇内节点覆盖 半径的不同进行分簇. 在增大簇头节点通信半径及减小簇内节点的通信半径时,同时考虑网络中死亡节点数目,修 正簇头节点的阈值选择公式,根据该阈值对网络的簇数重新选择和分簇. 仿真结果表明,该算法对网络的覆盖度可 保持在1700轮左右,提高了网络的数据传输能力,延长了生命周期. 关摇 键摇 词:低功耗自适应集簇分层型协议;Voronoi 图;半径调度;覆盖保持协议 中图分类号:TN393摇 摇 摇 摇 文献标志码:A LEACH Coverage Preserving Protocol Based on Dead Nodes and Radius Scheduling DONG Ying,摇 NIJia鄄wei,摇 WU Hao,摇 CUI Meng鄄yao,摇 WANG Yu鄄hou (College of Communication Engineering,Jilin University,Changchun 130012,China) Abstract:A low energy adaptive clustering hierarchy (LEACH) coverage preserving protocol based on dead nodes and radius scheduling (LEACH_DNA) was proposed. The selection of the cluster head a鄄 dopts the optimized random selection mechanism in the algorithm. The cluster head nodesare divided by Voronoi diagram. And there are several clusters divided by the coverage radiuses of the cluster head nodes andthecoverageradiusesoftheclustersinternodes. Whentheradiusesof clusternodesincreases, the radiuses of cluster nodesandconsideredthenumber of deadnodesinthenetworkreduces. Thefunc鄄 tion of the executivethereafter choosesa certain number of clustersnodesandrenewsthe LEACHcluste鄄 ring. Simulation shows that the LEACH_DNA algorithm for network coverage has maintained at 1700 round,the function of the network data transmission capacity is improved,and the network li