摘要： 目前基于树的数据收集方法经常会造成节点负载不均衡、树的高度无法控制等问题，从而使得数据收集延迟加大。针对该问题，提出一个新的数据收集算法(DBDG)。该算法从一棵最少跳数树出发，迭代地选择网络中的一条边加入树，通过限定树的高度满足延迟限定，采用使树上瓶颈节点的度最小化来延长树的生命周期。仿真实验结果表明，与目前已有的协议相比，该算法能在限定的高度内构造生命周期更长的生成树。

关键词: 无线传感器网络, 数据收集, 负载均衡, 延迟限定, 瓶颈节点, 生命周期

Abstract: Data gathering is a key problem in Wireless Sensor Network(WSN), the current tree-based data gathering methods often result in some problems, such as the load imbalance, the uncontrolled height of the tree, the larger delay of data gathering and so on. To solve this problem, this paper proposes a new algorithm DSDA((Delay Bounded Data Gathering). The algorithm constructs a Fewest Hops Tree(FHT). It iteratively adds an edge to the tree, and it satisfies with user’s requirement for delay by limiting tree’s height, and it can extend the tree lifetime by making the degree of nodes in the tree which is decreased to the minimum. Simulation results show that the algorithm can construct a tree under limited tree’s height, which has longer lifetime than previous protocols.

Key words: Wireless Sensor Network(WSN), data gathering, load balancing, delay limit, bottleneck node, lifetime

中图分类号: 

• TP393