针对一些实时性要求比较高的应用场景,如地震监测、火警探测等,提出一种限定延迟的最大化网络生命周期算法DCLB(Delay-Constrained and Load-Balance data aggregation algorithm)。DCLB以一棵具有最小跳生成树为基础,在满足限制树高的前提下,迭代的转移树上负载最大节点的子孙到负载小的节点上去。实验表明,与目前已有算法相比,DCLB算法具有更低的时间复杂度,能有效地减少延迟并延长树的生命周期。
This paper proposes a maximised network life cycle algorithm with constrained delay,named DCLB,for some of the applied scenarios with higher real-time demand,such as seismic monitoring,fire detection,etc. DCLB is based on a minimum jump spanning tree,and on the premise of meeting the limited tree height,DCLB continues to transfer descendants of high-load nodes to low-load nodes.Experimental results show that compared with existing algorithms,DCLB has a lower time complexity,which can effectively reduce the delay and extend the life cycle of the tree.