容迟网络中基于节点间相遇概率的路由算法

A routing algorithm based on the probability of encounter between nodes in delay-tolerant network

容迟网络DTN(Delay Tolerant Network)是物联网中的一种新型的计算机网络,该网络中的源节点和目的节点之间可能并不总是存在完整的端到端的通信链路。DTN间歇连接的特点对设计有效路由算法是巨大的挑战。文章在原有Epidemic和Prophet路由算法的基础上,提出了一种改进的基于节点间相遇概率的路由算法RAEPBN(Routing Algorithm Based on Encounter Probability Between Nodes),并详细介绍了该算法的路由建立过程。仿真结果表明,与现有的Epidemic和Prophet路由算法相比,RAEPBN在投递率、平均时延和网络开销上的性能均最优。

Delay Tolerant Network(DTN)is a new type of computer network in the Internet of Things.In DTN,a complete endto-end communication link between the source node and the destination node may not always be available.The intermittent connection characteristics of DTN make the design of an effective routing algorithm face a huge challenge.Based on the original Epidemic and Prophet routing algorithms,this paper proposes an improved routing algorithm based on the encounter probability between nodes RAEPBN(Routing Algorithm Based on Encounter Probability Between Nodes),and introduces the routing establishment process of the algorithm in detail.The simulation results show that RAEPBN has the best performance in delivery rate,average delay,and network overhead,compared with the existing Epidemic and Prophet routing algorithms.