论文部分内容阅读
数据收集是无线传感网络研究的关键问题,是诸多无线传感网络应用的基础.降低数据聚集的延迟是数据聚集研究中的重点问题.现有的面向延迟的数据聚集算法,多是通过在树型网络结构上设计无冲突的节点调度算法,来降低数据聚集的延迟,没有考虑到无线网络数据易丢失的特性,不能达到期望的延迟效果.本文针对上述问题,提出一种采用任意播(anycast)方式的机会数据收集算法(OA算法).该算法利用机会传输(opportunistic transmission)的思想,用任意播方式传输数据,通过减少数据聚集中重传数据包的数目,来降低数据聚集的延迟.实验表明,与SPT(Shortest path tree)上的数据聚集延迟相比,该方法的发包数目减少了15%,延迟降低了10%.
Data collection is the key issue of wireless sensor network research and is the basis of many wireless sensor network applications.Decreasing the delay of data aggregation is a key issue in data aggregation research.At present, the delay-oriented data aggregation algorithms are mostly based on In this paper, a collision-free node scheduling algorithm is designed on the tree network structure to reduce the delay of data aggregation without taking into account the characteristics of easy loss of data in the wireless network and can not achieve the desired delay effect.This paper presents a method using anycast anycast) algorithm (OA algorithm), which uses the idea of opportunistic transmission to transmit data in anycast mode and reduces the delay of data aggregation by reducing the number of retransmitted data packets in data aggregation Experiments show that compared with the data aggregation delay on SPT (Shortest path tree), this method reduces the number of packets by 15% and the delay by 10%.