摘要
针对经典分簇路由算法LEACH在选取簇头时没有充分考虑节点剩余能量的问题,在LEACH协议的基础上,改进了簇首选择、最优簇首数和簇形成过程,提出一个自适应分布式算法,即ADCP-LEACH算法,该算法可以应用于周期性的采集数据,根据每个节点竞选簇头时的阈值不同,让剩余能量大的节点当选簇头的概率更大.NS2仿真实验表明,改进的协议有效延长了网络的存活时间,性能优于LEACH协议.
Classical clustering routing algorithm for LEACH cluster head is selected without full consideration of the remaining energy of node problem, based on LEACH protocol to improve the cluster＇s first choice, the optimal cluster number and cluster formation of the first proposed an adaptive distribution type algorithm, which ADCP-LEACH algorithm can be applied to periodic data collection, each cluster head node election when the threshold is different for the remaining energy of a large cluster head node election probability greater. NS2 simulation results show improved agreement effectively extended the survival time of the network, better performance than LEACH protocol.
出处
《微电子学与计算机》
CSCD
北大核心
2010年第8期128-131,共4页
Microelectronics & Computer
