论文部分内容阅读
由于延迟容忍网络具有高延迟,低数据传输率,拓扑动态变化等特点,设计有效的路由算法一直是延迟容忍网络研究的热点问题.该文在概率模型的DTN中提出了一种数据聚集算法DADTN(Data Aggregation algorithm for Delay Tolerant Networks).对于目的节点相同的一些数据包可以通过网内聚合(In-network aggregation)方法聚集成为一个数据包.为了衡量每个节点聚集局部数据包和交付数据包到目的节点的能力,算法定义了聚集交付能力的概念.数据包则由聚集交付能力小的节点向聚集能力大的节点进行传输,实施聚集操作.仿真分析表明,与Epidemic和PRoPHET算法相比,DADTN算法能以较低的数据包转发次数获得较高的数据传输成功率.
Due to the characteristics of delay tolerant networks such as high delay, low data rate and dynamic topology, designing efficient routing algorithms has been a hot issue in delay tolerant networks.This paper proposes a data aggregation algorithm DADTN (Data Aggregation algorithm for Delay Tolerant Networks.) Some packets that are the same for the destination node can be aggregated into one packet by the In-network aggregation method In order to measure that each node aggregates the partial packet and delivers the packet The ability of the destination node, the algorithm defines the concept of aggregate delivery capability, and the data packet is transmitted from nodes with small aggregate delivery capacity to nodes with large aggregation capacity to perform aggregation operations. Simulation results show that, compared with Epidemic and PRoPHET algorithms, DADTN The algorithm can achieve a higher success rate of data transmission with lower data packet forwarding times.