基于动态能量阈值的LEACH改进算法  

Improved LEACH Algorithm Based on Dynamic Energy Threshold

作　　者：顾逸 倪晓军 GU Yi;NI Xiaojun(School of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China)

机构地区：[1]南京邮电大学计算机学院、软件学院、网络空间安全学院,江苏南京210023

出　　处：《计算机与现代化》2025年第2期70-76,共7页Computer and Modernization

摘　　要：针对LEACH协议存在簇头分布不合理、部分节点能耗过快等问题,本文在IMPROVED-LEACH协议的基础上提出一种改进算法LEACH-ECP。在分簇阶段,综合考虑能量、密度和距离3种影响因素,为节点设置了一个预测能耗,通过该预测能耗计算出节点当选簇头后的剩余能量,再根据所有节点的剩余能量预测值给出动态变化的能量阈值,并对簇头选取机制以及成员节点入簇机制进行了修改,从而达到延长网络生命周期、降低能量耗损的目的。本文将LEACH-ECP协议同LEACH和LEACH-IMPROVED算法进行对比,仿真实验结果表明:LEACH-ECP第一个死亡节点的出现时间相较于LEACH延长了71%,相较于LEACH-IMPROVED延长了13%。LEACH-ECP算法可以更加合理地选取簇头,延长网络生命周期。Aiming at the problems of unreasonable cluster head distribution and fast energy consumption of some nodes in the LEACH protocol,an improved algorithm LEACH-ECP is proposed based on the IMPROVED-LEACH protocol.In the clustering stage,a predicted energy consumption is set for the node,taking into account three influencing factors:energy,density,and dis-tance.Based on this predicted energy consumption,the remaining energy of the node after being selected as the cluster head is calculated.Then,dynamic energy thresholds are given based on the predicted values of the remaining energy of all nodes.The cluster head selection mechanism and member node entry mechanism are modified to extend the network lifecycle and reduce en-ergy consumption.This article compares the LEACH-ECP protocol with LEACH and LEACH-IMPROVED algorithms.Simula-tion experiment results show that the appearance time of the first dead node in LEACH-ECP is 71%longer than LEACH and 13%longer than LEACH-IMPROVED.The LEACH-ECP algorithm can select cluster heads more reasonably and prolong the network lifecycle.

关 键 词：无线传感网络 LEACH协议 簇头选取 能耗预测 能量阈值 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]