一种适用于缓存受限的机会网络路由改进算法  

Improved Method on Routing Algorithm in Buffer-limited Opportunistic Networks

作　　者：赖荣煊 李宁[2] 谢威[2] 王聪[2] 

机构地区：[1]解放军理工大学通信工程学院研究生1队,江苏南京210007 [2]解放军理工大学通信工程学院

出　　处：《军事通信技术》2015年第2期45-50,共6页Journal of Military Communications Technology

摘　　要：许多机会网络路由机制在节点缓存有限的情况下并不能得到足够可靠的性能保证,这是由于节点缓存不足导致大量消息不得不丢弃。此外,多数的路由机制中消息的复制及传递带有一定的盲目性,而使网络中无效消息大量扩散,对路由机制性能产生较大的影响。针对这一问题,文章提出了一种基于节点出现概率的路由改进算法(MROP),利用节点运动的历史经验知识估计消息到达目的节点所需平均跳数,并以此作为该消息跳数寿命。MROP算法是一种可叠加在多种路由机制之上的独立于原有路由算法的路由性能增强方法通过ONE仿真实验结果表明,MROP算法可以在牺牲一定传输时延的情况下,大幅提高消息投递率、减小网络负载和节约节点缓存消耗,得到较优的路由性能。Many routing algorithm cannot achieve reliable performance within a buffer-limited opportunistic network since large numbers of messages have to be discarded because of the lack of node buffer capacity. And parts of routing algorithms are more or less aimless to copy and trans- fer messages, which makes invalid messages spread in the network and greatly affects the per- formance of routing algorithms. Faced with this problem, this paper proposed a modified routing algorithm using node movement history information to evaluate the hops of message which need to arrive at the destination node and set the hope life of message. The MROP algorithm is a method that can improve routing performance and can be attached with kinds of routing algo- rithms and independent of the intrinsic routing methods. Simulation results show that the tradi- tional routing algorithm can increase the message delivery ratio, reduce the network overhead and save node buffer capacity by sacrificing little delay with the way of embedding in MROP algorithm.

关 键 词：机会网络 缓存受限 跳数寿命 出现概率 逗留时间 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]