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

发布时间：2018-03-22 22:01

本文选题：无线传感器网络　切入点：数据汇集　出处：《计算机科学》2017年S1期 　论文类型：期刊论文

【摘要】：针对现有的无线传感器网络数据汇集算法延时较大的不足,对最小延时数据汇集树和传输调度问题进行了研究。提出一种基于度约束的汇集树构建算法(DCAT)。该算法按照BFS方式遍历图,当遍历到每个节点时,通过确定哪些节点与汇点更近来确定潜在母节点集合。然后,选择图中度数最小的潜在母节点作为当前被遍历节点的母节点。此外,为了在给定的汇集树上进行高效的数据汇集,还提出两种新的基于贪婪的TDMA传输调度算法:WIRES-G和DCAT-Greedy。利用随机生成的不同规模的传感器网络,参照当前最新算法,对所提方法的性能进行了全面评估。结果表明,与当前最优算法相比,将所提调度算法与所提汇集树构建算法结合起来,可显著降低数据汇集的延时。
[Abstract]:Aiming at the shortcomings of the existing data collection algorithms in wireless sensor networks, In this paper, the minimum delay data collection tree and transmission scheduling problem are studied. An algorithm for constructing aggregation tree based on degree constraints is proposed. The algorithm traverses the graph according to BFS mode, when traversing every node, By determining which nodes and meeting points are more recent in determining the set of potential parent nodes, then select the potential parent node with the smallest degree in the graph as the current parent node of the node being traversed. In order to collect data efficiently on a given collection tree, two new greedy TDMA transmission scheduling algorithms:: WIRES-G and DCAT-Greedyare proposed. The performance of the proposed method is comprehensively evaluated. The results show that the proposed scheduling algorithm can significantly reduce the delay of data collection by combining the proposed scheduling algorithm with the proposed collection tree construction algorithm compared with the current optimal algorithm.
【作者单位】：惠州学院计算机科学系;湖南大学软件学院;
【基金】：国家自然科学基金(61300218)资助
【分类号】：TN929.5;TP212.9

【相似文献】