基于节点密度自适应的DTN路由算法

摘要

文章研究了DTN(延迟容忍网络)中一种基于副本受限的散播和等待路由算法，针对散播和等待路由算法的弊端，提出了一种基于节点密度自适应的路由算法。该算法根据当前区域的节点密度自适应地分配消息副本，并对散播和等待路由算法的等待阶段进行了改进，使较为活跃的节点携带消息。仿真结果表明，与 BSW(二分法散播和等待)算法以及经典的 Epi-demic算法相比，文章所提出的算法能有效地降低传输时延，提高消息传递成功率。%This paper investigates a replica-constrained spray and wait routing algorithm in Delay-Tolerant Network (DTN)and in view of the disadvantages of the spray and wait routing algorithm,it introduces a node-density adaptive routing algorithm. This algorithm adaptively distributes message replicas according to the node density of current area and improves the wait stage of the spray and wait routing algorithm so that the messages are carried by active nodes.The simulation results show that com-pared with BSW algorithm and the classical Epidemic algorithm,the proposed algorithm can effectively reduce transmission de-lay and improve the success rate of message delivery.