基于相遇概率时效性和重复扩散感知的机会网络消息转发算法

在机会网络中,为了更合理地选择消息传输中继节点并提高消息投递效率,设计了消息转发效用,并给出了对应的消息副本转发算法。首先,从节点历史相遇信息入手,重点分析了节点的间接相遇概率及其对应的时效性问题,提出了评估相遇信息价值的时效指标;然后,结合节点运动相似性分析了消息重复扩散问题,并提出节点移动偏离指标,用于评价节点重复扩散消息的可能性。仿真实验结果表明:与Epidemic、ProPHET、Maxprop和SAW(Spray And Wait)算法相比,综合考虑投递成功率、开销和延时指标,所提算法表现出了更好性能。

Opportunistic network message forwarding algorithm based on time-effectiveness of encounter probability and repeated diffusion perception

In order to select more reasonable relay nodes for message transmission and improve the efficiency of message delivery in opportunistic networks, message forwarding utility was designed, a corresponding message copy forwarding algorithm was proposed. Firstly, based on the historical encounter information of nodes, the indirect encounter probability of nodes and the corresponding time-effectiveness were analyzed， then a time-effectiveness indicator was proposed to evaluate the encounter information value. Secondly, combined with the similarity of node motion, the problem of message repeated diffusion was analyzed, a deviation indicator of node movement was proposed to evaluate the possibility of message repeated diffusion. Simulation results show that compared with Epidemic, ProPHET, Maxprop, SAW (Spray And Wait) algorithms, the proposed algorithm has better performance in delivery success rate, overhead and delay.