WSN 中最小延时的数据汇集树构建与传输调度算法.

Aiming at shortcomings of the large delay at the existing data aggregation algorithms in wireless sensor networks，we study the problem of the minimum latency data aggregation tree and transmission scheduling，and an aggregation tree construction algorithm based on degree constraint (DCAT) is proposed. It works by traversing the graph in a BFS manner. As it traverses each node，the set of potential parents is determined by identifying the nodes that are one-hop closer to the sink. The potential parent with the lowest degree in the graph is selected as the parent for the currently traversed node. Furthermore，we propose two new approaches based on greedy for building a TDMA transmission schedule to perform efficient aggregation on a given tree: WIRES-G and DCAT-Greedy. We evaluate the performance of our algorithms through extensive simulations on randomly generated sensor networks of different sizes and we compare them to the previous state of the art. The results show that both our new scheduling algorithms when combined with our new tree-building algorithm obtain significantly lower latencies than that o f the previous best algorithm. [ABSTRACT FROM AUTHOR]