考虑相遇强度的约束扩散路由算法

A Constrained Diffusion Routing Algorithm Considering EncounterIntensity

为了提高机会网络的转发效率,论文提出了一种考虑相遇强度的约束扩散路由算法(EICD)。该算法针对概率路由中预测不准确导致的投递率低,提出了相遇强度并给出了其计算公式。相遇强度将时间作为计算的重要依据,更能准确反映两个节点下次相遇的可能性。同时,针对多拷贝算法中过多的消息副本和已投递消息的冗余副本占用大量的网络资源等问题,通过约束扩散和去冗余两种方法来降低网络负载和转发时延。仿真实验结果表明,与其它经典路由算法相比,EICD算法能够提高消息投递率,降低网络负载和转发时延。

In order to improve the forwarding efficiency of opportunistic networks,this paper proposes a Constrained Diffusion routing algorithm considering Encounter Intensity(EICD).Aiming at the low delivery rate caused by inaccurate prediction in proba⁃bilistic routing,the algorithm presents the encounter intensity and its calculation formula.The encounter intensity takes time as an important basis for calculation,which can more accurately reflect the possibility of the next encounter between two nodes.At the same time,for the problem that too many copies of messages and redundant copies of delivered messages occupy a lot of network re⁃sources in multi-copy algorithms,two methods of constrained diffusion and deredundancy are used to reduce network load and for⁃warding delay.Simulation results show that the EICD algorithm can improve message delivery rate and reduce network load and for⁃warding delay compared with classical routing algorithms.