一种基于融合器的多跳能量均衡算法

A multi-hop energy balancing algorithm based on aggregator

为了解决现有的分簇算法能量消耗不均衡问题,提出了一种新的基于融合器的多跳能量均衡(MEB)算法.该算法采用定时器并且考虑节点的剩余能量来优化簇头选举,通过选举簇中最多能量的节点作为融合器,对簇头转发的传感数据进行数据融合,然后通过由融合器构建的多跳路由树发送到基站.该算法同时达到了簇内和簇间的能量均衡.仿真结果表明,MEB算法第1个节点死亡的时间比LEACH算法延长了80%左右,比TB-LEACH算法延长了60%左右.MEB算法第1个节点死亡到最后1个节点死亡经历的时间非常短.因此,MEB算法实现了整个网络的能量均衡,提高了网络的稳定度,延长了网络的生命周期.

To resolve the energy unbalancing problem in the current clustering algorithms,a new multi-hop energy balancing(MEB)algorithm based on the aggregator is proposed.The proposed algorithmutilized timers and considered node residual energy to optimize the cluster head selection.It selects the maximum residual energy node from the intra-cluster nodes as the aggregator,fuses data from the sensing data that cluster heads relay and then forwards data to the sink through the multi-hop routing tree constructed by the aggregators.The algorithm simultaneously realized intra-cluster and inter-cluster energy balancing.The simulation results show that the MEB algorithm can enhance first node dies(FND)by about80%compared with the low-energy adaptive clustering hierarchy(LEACH)algorithm and by about60%compared with the time-based cluster-head selection algorithm for LEACH(TB-LEACH).The MEB algorithm costs very short time from the death of the first node until the death of the last node.Therefore,the MEB algorithm achieves energy balancing for the entire network,improves the network stability,and prolongs the network lifetime.