论文部分内容阅读
许多机会网络路由机制在节点缓存有限的情况下并不能得到足够可靠的性能保证,这是由于节点缓存不足导致大量消息不得不丢弃。此外,多数的路由机制中消息的复制及传递带有一定的盲目性,而使网络中无效消息大量扩散,对路由机制性能产生较大的影响。针对这一问题,文章提出了一种基于节点出现概率的路由改进算法(MROP),利用节点运动的历史经验知识估计消息到达目的节点所需平均跳数,并以此作为该消息跳数寿命。MROP算法是一种可叠加在多种路由机制之上的独立于原有路由算法的路由性能增强方法通过ONE仿真实验结果表明,MROP算法可以在牺牲一定传输时延的情况下,大幅提高消息投递率、减小网络负载和节约节点缓存消耗,得到较优的路由性能。
Many opportunistic network routing mechanisms do not provide sufficiently reliable performance guarantees when node caching is limited due to the lack of cache in the nodes that cause a large number of messages to be discarded. In addition, the replication and transmission of messages in most routing mechanisms have a certain degree of blindness. As a result, a large number of invalid messages in the network are widely distributed, which has a great impact on the performance of the routing mechanism. In order to solve this problem, this paper proposes a routing improvement algorithm (MROP) based on the probability of occurrence of a node. It uses the historical experience of node motion to estimate the average number of hops that a message needs to reach its destination node. MROP algorithm is a routing performance enhancement method which can be superimposed on multiple routing mechanisms independent of the original routing algorithm. The simulation results of ONE simulation show that MROP algorithm can greatly improve the delivery of messages at the expense of certain transmission delay Rate, reduce network load and save node cache consumption, get better routing performance.