WSN中一种基于延迟限定的数据收集算法

数据收集是无线传感器网络研究中的一个关键问题,目前基于树的数据收集方法经常会造成节点负载不均衡、树的高度无法控制等问题,从而使得数据收集延迟加大。针对该问题提出了一个新的算法——基于延迟限定的数据收集算法(DBDG),该算法从一棵最少跳数树(Fewest Hops Tree,FHT)出发,迭代地选择网络中的一条边加入树,通过限定树的高度来满足延迟限定,然后通过使树上"瓶颈节点"的度最小化来延长树的生命周期。仿真实验表明,与目前已有的协议相比,DBDG能在限定的高度内构造生命周期更长的生成树。

A Data Gathering Algorithm Based on Bounded Delay for Wireless Sensor Networks

Data gathering is a key problem in wireless sensor networks. The current tree - based data gathering methods otten re- sult in problems such as load imbalance, uncontrolled tree height,larger delay of data gathering and so on. To solve these problems, the paper proposes a new algorithm DBDG. ,which constructs a Fewest Hops Tree（FHT） first,then iteratively adds an edge to the tree,and satisfies user＇s requirement for delay by limiting the tree＇s height. It can extend the tree lifetime by making the degree of nodes in the tree decrease to the minimum. Simulation results show that DBDG can construct a tree under limited tree height,which has longer life-time as compared with previous protocols.