DTN中基于时间因素的拥塞感知路由算法

摘要

In order to solve the problem of blindness in choice of relay nodes in spray and wait routing, a routing named CARA based on time factor is proposed in this paper. Considered time’s influence over the forwarding probability, this algo-rithm improves the forwarding probability of Prophet algorithm. The improved probability chooses relay nodes which dynamically distribute packets, and optimize congestion control by congestion-aware adaptive mechanism. The simula-tion results show CARA algorithm achieves an improvement in delivery by 10.21% and a reduction in delay by 7.05%compared with CS-DTN algorithm, and realizes a reduction in overhead by 8.16%compared with BSW algorithm.%为了解决散发等待路由算法中，中继节点的选择存在盲目性的问题，提出一种基于时间因素的拥塞感知路由算法CARA。该算法考虑时间因素对转发概率的影响，改进Prophet算法中的转发概率。根据改进的转发概率选择中继节点，动态分配报文转发数目，并以拥塞感知自适应的方式实现拥塞控制的优化。仿真结果表明，CARA算法和网络投递率及延迟表现最好的CS-DTN算法相比，投递率提高了10.21%，延迟降低了7.05%，同网络开销表现最好的BSW算法相比，开销降低了8.16%。