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

LEACH Coverage Preserving Protocol Based on Dead Nodes and Radius Scheduling

提出了一种基于死亡节点与半径调度的低功耗自适应集簇分层型(LEACH)覆盖保持协议,对簇头的随机选择机制进行了阈值的联合优化,采用泰森多边形对簇头节点进行Voronoi图划分,并根据簇头节点和簇内节点覆盖半径的不同进行分簇.在增大簇头节点通信半径及减小簇内节点的通信半径时,同时考虑网络中死亡节点数目,修正簇头节点的阈值选择公式,根据该阈值对网络的簇数重新选择和分簇.仿真结果表明,该算法对网络的覆盖度可保持在1 700轮左右,提高了网络的数据传输能力,延长了生命周期.

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 adopts the optimized random selection mechanism in the algorithm. The cluster head nodes are divided by Voronoi diagram. And there are several clusters divided by the coverage radiuses of the cluster head nodes and the coverage radiuses of the clusters inter nodes. When the radiuses of cluster nodes increases,the radiuses of cluster nodes and considered the number of dead nodes in the network reduces. The function of the executive thereafter chooses a certain number of clusters nodes and renews the LEACH clustering. Simulation shows that the LEACH_ DNA algorithm for network coverage has maintained at 1 700 round,the function of the network data transmission capacity is improved,and the network life time is extended.