集中式数据收集算法难以实际应用于外部环境恶劣、实时性要求高的无线传感器网络场景中。为解决此问题，采用分布式思想来构造算法，从而提出一种易于实现且有效的算法DBEGA(distributed delay-bounded energy-efficient data gathering algorithm)。DBEGA算法的基本步骤是：先生成1棵最少跳数的数据收集树来满足特定应用中延迟受限的要求；在此基础上，借用时间复用的方法，将一特定长度的时间段分割成n个等长的独立时间片，然后将这些时间片唯一地分配给每个节点，每个节点就能互不干扰地对已生成的数据收集树进行调整，使得各个节点的负载尽量均衡，从而达到延长网络生命周期的目的。研究结果表明：与随机路由和分布式算法LMST相比，DBEGA所构造的数据收集树能够在满足延迟受限要求的同时将网络生命周期提高20%以上。%The centralized data gathering algorithms are difficult to be used in the high dynamic wireless sensor networks. For solving the problem, a distributed delay-bounded energy-efficient data gathering algorithm (DBEGA) was proposed, and a delay-bounded data gathering tree was constructed. DBEGA algorithm involves two steps. In the first step, the minimum hop count tree was constructed in a distributed manner for meeting the requirements of being delay-bounded. In the second step, DBEGA divided a specific length of time inton equal-length independent time slices and these time slices were uniquely assigned to each node. So an undisturbed environment was created for every node to adjust the load of nodes in the generated tree to balance energy consumption of different nodes, which effectively extended the lifetime of the network. In the adjustment, both the number of children of a node and their residual energy were considered. The results show that DBEGA achieves better tradeoff between delay and network lifetime than LMST algorithm, and it can prolong the lifetime by 20%.
展开▼
