概率路由中基于连接时间的机会转发算法

Opportunistic Forwarding Algorithm Based on Connection Time in Probabilistic Routing

概率预测PRoPHET路由没有考虑到转发节点的有效性,存在多个中继节点预测性相同的情况时,移动性会使得节点间的连接时间不同而导致消息投递率低和网络负载过大的缺点.因此,预测概率还需考虑节点相遇持续时间对消息数据完整传递的影响,本文提出了一种基于连接时间的概率路由算法(PRoPHET-CT),增加了节点间连接时间占空比的影响因素.对比实验结果表明在节点密度较大的机会网络环境中,该改进算法有着较高的投递概率,同时降低了网络负载以及节点的平均跳数.

In probabilistic prediction PROPHET routing the effectiveness of the forwarding node was not considered. There are disadvantages that in the case of the same predictability of the multiple relay nodes,mobility will cause the connection time between nodes to be different,resulting in the low message delivery rate and excessive network load.Therefore,the influence of the node encounter duration on the complete transmission of message data should be considered when calculating the prediction probabilities.This paper proposes a probabilistic routing algorithm based on Connection Time (PRoPHET-CT),which incorporates the factors that influence the duty cycle of the connection time between nodes.The comparison experimental results show that the improved algorithm has a higher probability of delivery in the network environment with high node density.And also,this algorithm can reduce the network load and the average hops of the nodes.