在传感器网络中构造延迟限定的最大化生命周期树

On the Construction of a Delay-Constrained Maximum Lifetime Tree in Wireless Sensor Networks

在一些对延迟敏感的持续性监视应用中,无线传感器网络中的数据收集需要构造延迟限定的最大化生命周期树,这属于NP完全问题.提出一个新的算法MILD,通过限定树的高度来满足延迟限定,然后通过使树上"瓶颈节点"的度最小化来延长树的生命周期.实验表明,与目前已有的协议相比,MILD能有效地限定延迟并延长树的生命周期.

In some delay-sensitive and durative surveillance applications,a tree that can satisfy user＇s requirements of maximizing the network lifetime and constraining the data gathering delay needs to be constructed in wireless sensor networks. The problem of constructing the tree is NP-complete. A novel algorithm, named MILD, is proposed to solve this problem. MILD satisfies user＇s requirement for the delay by limiting the tree＇s height, and it extends the tree lifetime by decreasing the degree of bottleneck nodes to the minimum. Simulation results show that MILD can construct a tree that has longer lifetime than previous protocols under constrained delay.