摘要
分析了经典的LEACH算法,包括簇的建立阶段与稳定通信阶段。针对LEACH算法选择簇头时具有概率性且分布不均匀的缺点,基于粒子群思想提出了一种确定最优簇头坐标的计算方法。同时针对LEACH算法需要轮回更换簇头的缺点,设计了辅助簇头并且延长了每轮的持续时间,并且给出了辅助簇头产生的计算方法。经过MATLAB仿真表明,改进算法的网络能耗低于LEACH算法,有效地延长了网络的生命周期。
This paper presents a detailed analysis of the classical LEACH algorithm,including cluster establishment phase and stable communication stage.The LEACH algorithm chooses cluster heads with probability and has the problem of uneven distribution.Based on particle swarm theory,a calculation method of determining optimal cluster head coordinate is presented.At the same time because LEACH algorithm requires the transmigration replacement cluster head,aided cluster head is designed and the duration of each wheel is prolonged.Method of computing aided cluster head is worked out precisely.The result of MATLAB simulation shows that the improved algorithm has less network energy consumption than LEACH algorithm,and effectively prolong the network life cycle.
出处
《科技通报》
北大核心
2012年第12期143-145,共3页
Bulletin of Science and Technology
关键词
LEACH算法
能耗
簇头
生命周期
low energy adaptive clustering hierarchy algorithm
energy consumption
cluster head
life cycle
