%0 Journal Article
%A CUI Meng-yao
%A DONG Ying
%A NI Jia-wei
%A WANG Yu-hou
%A WU Hao
%T LEACH Coverage Preserving Protocol Based on Dead Nodes and Radius Scheduling
%D 2016
%R 10.13190/j.jbupt.2016.06.009
%J Journal of Beijing University of Posts and Telecommunications
%P 47-52
%V 39
%N 6
%X 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.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2016.06.009