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

发布时间：2018-01-16 22:24

本文关键词：WSN中最小延时的数据汇集树构建与传输调度算法　出处：《实验室研究与探索》2017年01期 　论文类型：期刊论文

【摘要】：针对现有无线传感器网络数据汇集算法延时较大这一不足,对最小延时数据汇集树和传输调度问题进行了研究。提出一种基于度约束的汇集树构建算法(DCAT)。该算法按照BFS方式遍历图,当遍历到每个节点时,通过确定哪些节点与汇点更近来确定潜在母节点集合。然后,选择图中度数最小的潜在母节点作为当前被遍历节点的母节点。此外,为了在给定的汇集树上进行高效数据汇集,文中还提出两种新的基于贪婪的TDMA传输调度算法:WIRES-G和DCAT-Greedy。利用随机生成的不同规模的传感器网络,参照当前最新算法,对本方法的性能进行了全面评估。结果表明,与当前最优算法相比,本调度算法与汇集树构建算法结合起来,可显著降低数据汇集的延时。
[Abstract]:Aiming at the shortcomings of the existing data collection algorithms in wireless sensor networks (WSN), the delay is long. 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 each node, determine which nodes and meeting points are more recent to determine the set of potential parent nodes. Then, select the potential master node with the smallest degree in the graph as the current node of the node being traversed. In addition. In order to efficiently aggregate data on a given collection tree. Two new greedy TDMA transmission scheduling algorithms:: WIRES-G and DCAT-Greedy. are also proposed, using randomly generated sensor networks of different sizes. According to the latest algorithms, the performance of this method is comprehensively evaluated. The results show that compared with the current optimal algorithm, the proposed scheduling algorithm combined with the collection tree construction algorithm can significantly reduce the delay of data collection.
【作者单位】：广东工程职业技术学院信息工程学院;湖南大学软件学院;
【基金】：国家自然科学基金(61300218) 广东省软科学研究计划项目(142400410179)
【分类号】：TP212.9;TN929.5
【正文快照】： q弓丨胃在无线传感器网络(Wireless Sensor Networks,WSN)的多种应用中,数据由传感器节点采集后发往汇点(Sink)处,这种通信模式称为汇集模式[叫。该模式通过构建以汇点为根并通往汇点的树,然后沿着树向汇点传输报文,进而完成数据汇集。在部分应用中, 、汇集树上的部分节点

【相似文献】