基于历史效用的机会网络路由算法  

Routing algorithm in opportunistic network based on historical utility

作　　者：刘期烈[1] 许猛[1] 李云[1] 杨军[2] 

机构地区：[1]重庆邮电大学移动通信技术重点实验室,重庆400065 [2]重庆有线电视网络有限公司,重庆400060

出　　处：《计算机应用》2013年第2期361-364,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(61071118;60702055);重庆市教育委员会资助项目(KJ110524);重庆市科委自然科学基金资助项目(CSTCJJA40039;CSTC2009BB2279)

摘　　要：针对机会网络中传统的概率路由协议投递率较低的问题,提出一种基于历史相遇预测的改进概率路由(HMPR)算法。该算法根据节点历史接触时间和接触频率两个因素,预测数据包成功投递到目的节点的效用值,通过比较其效用值大小来决定数据包是否转发到下一跳节点。仿真结果表明,与传统的传染路由和概率路由相比,该路由在数据包投递率、平均延迟时间和平均缓存时间方面比上述两个路由协议的性能更好。In view of the low delivery ratio of conventional probabilistic routing in opportunistic networks, an improved routing algorithm based on History Meeting Predictability Routing （HMPR） was put forward. The algorithm was primarily based on the contact duration and the meeting frequency of history information of nodes, and predicted the utility of packets successfully delivered to the destination. Through comparing the utility value, nodes could determine packets whether to be forwarded from them to next hop nodes. The simulation results show that, compared with traditional epidemic routing and probabilistic routing, the proposed routing scheme has better performance in the delivery ratio of packets, the average delay time and the average buffer time.

关 键 词：机会网络 传染路由 概率路由 缓存时间 投递率 延迟时间 

分 类 号：TN915.04[电子电信—通信与信息系统]