资源受限的自适应DTN路由算法研究

发布时间：2019-03-22 13:53

【摘要】：随着信息技术的高速发展,传统的Internet网络体系结构在应对一些通信链路时常中断、网络传输时延高、节点能量及存储能力有限的场景中出现了许多无法解决的问题。延迟容忍网络(DTN,Delay Tolerant Network)是为了适应上述场景而提出的一种网络模型。在DTN网络研究当中,路由算法的研究更是其重中之重。当前,有许多种不同的DTN路由算法。按照路由策略可以分为泛洪路由算法和转发路由算法。典型的泛洪路由算法有Epidemic,Spray and Wait,Spray and Focus,Multi-Simbet 等,典型的转发路由算法有 Single Recent,Direct Transmission,One Hop Encounter Prediction 等。本文将资源受限条件抽象为了节点能够同时处理的消息数量。同时选用了 Epidemic,Spray and Wait,Multi-Simbet,Single Recent,Direct Transmission五个典型的路由算法,采用Python仿真,在MIT、SW数据集下对这五个算法进行性能评估分析。并在此基础上提出一种能够根据网络实时负载情况自适应选择路由算法的自适应方法。该算法综合利用各个经典路由算法的优缺点,选择合适算法进行路由,实现了性能消耗比的大幅提升。仿真结果表明,自适应路由算法能够在提高传输成功率的同时降低路由资源消耗。
[Abstract]:With the rapid development of information technology, the traditional Internet network architecture is dealing with some communication links often interrupted, the network transmission delay is high, the node energy and storage capacity is limited in the scenario there are many problems that can not be solved. Delay tolerant Network (DTN,Delay Tolerant Network) is a network model proposed to adapt to the above scenarios. In the research of DTN network, the research of routing algorithm is the most important. At present, there are many different DTN routing algorithms. According to the routing policy, it can be divided into flooding routing algorithm and forwarding routing algorithm. Typical flood routing algorithms such as Epidemic,Spray and Wait,Spray and Focus,Multi-Simbet and Single Recent,Direct Transmission,One Hop Encounter Prediction are typical forwarding routing algorithms. In this paper, the resource-constrained condition is abstracted as the number of messages that a node can handle at the same time. At the same time, five typical routing algorithms of Epidemic,Spray and Wait,Multi-Simbet,Single Recent,Direct Transmission are selected and simulated with Python, and the performance of these five algorithms is evaluated and analyzed under the MIT,SW dataset. On this basis, an adaptive routing algorithm based on real-time network load is proposed. This algorithm makes use of the advantages and disadvantages of each classical routing algorithm, chooses the appropriate algorithm to route, and achieves the significant improvement of the performance-consumption ratio. The simulation results show that the adaptive routing algorithm can not only improve the transmission success rate but also reduce the routing resource consumption.
【学位授予单位】：南京大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP393.02

【相似文献】