| 基于历史相遇间隔的机会网络路由协议 |
| |
| 引用本文： | 张翼,周四望.基于历史相遇间隔的机会网络路由协议[J].计算机工程,2011,37(14):85-87. |
| |
| 作者姓名： | 张翼 周四望 |
| |
| 作者单位： | 湖南大学软件学院,长沙,410082 |
| |
| 基金项目： | 国家自然科学基金资助项目，湖南省自然科学基金资助项目，中国博士后科学基金资助项目 |
| |
| 摘 要： | 针对大多数机会网络路由协议在寻找端到端通信链路时不能很好地抓住节点社会性质的问题，提出一种基于历史相遇间隔(HICR) 协议的路由算法。HICR协议利用社会关系的特点，根据节点之间的历史相遇间隔判断它们的亲密程度，转发消息给离目的节点更亲近的节点，使得消息朝更靠近目的节点方向发送。仿真结果表明，该HICR协议在网络资源有限的的情况下，与Epidemic协议和Prophet协议相比，能获得更高的消息交付率。
|
| 关 键 词： | 机会网络 路由 网络协议 多拷贝 社会性 |
| 收稿时间： | 2011-01-05 |
Opportunistic Networks Routing Protocol Based on Historical Intervals of Contacts |
| |
| ZHANG Yi,ZHOU Si-wang.Opportunistic Networks Routing Protocol Based on Historical Intervals of Contacts[J].Computer Engineering,2011,37(14):85-87. |
| |
| Authors: | ZHANG Yi ZHOU Si-wang |
| |
| Affiliation: | (Software School,Hunan University,Changsha 410082,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | opportunistic networks routing network protocols multi-copy sociality |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
|
