基于历史相遇间隔的机会网络路由协议  

Opportunistic Networks Routing Protocol Based on Historical Intervals of Contacts

作　　者：张翼[1] 周四望[1] 

机构地区：[1]湖南大学软件学院,长沙410082

出　　处：《计算机工程》2011年第14期85-87,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60973127);湖南省自然科学基金资助项目(09JJ3123);中国博士后科学基金资助项目(20090461005)

摘　　要：针对大多数机会网络路由协议在寻找端到端通信链路时不能很好地抓住节点社会性质的问题,提出一种基于历史相遇间隔(HICR)协议的路由算法。HICR协议利用社会关系的特点,根据节点之间的历史相遇间隔判断它们的亲密程度,转发消息给离目的节点更亲近的节点,使得消息朝更靠近目的节点方向发送。仿真结果表明,该HICR协议在网络资源有限的的情况下,与Epidemic协议和Prophet协议相比,能获得更高的消息交付率。When most of the opportunity networks routing protocols seek end to end communication links, they often do not grasp the node＇s feature of sociality properly. A routing protocol based on Historical Intervals of Contacts（HICR） is proposed, which can take advantage of the characteristics of sociality, determine the acquaintance according to the intervals of contacts between nodes, and forward messages to nodes closer to the destination node. So message will be sent towards the direction of destination node. Simulation results show that, compared with Epidemic and Prophet, HICR can achieve higher message delivery rate under the condition where network resources are limited.

关 键 词：机会网络 路由 网络协议 多拷贝 社会性 

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