计算机应用 ›› 2011, Vol. 31 ›› Issue (05): 1170-1172.DOI: 10.3724/SP.J.1087.2011.01170

• 网络与通信 • 上一篇    下一篇

DTN中考虑连接时间的概率路由算法

王贵竹,何诚,王炳庭   

  1. 安徽大学 计算智能与信号处理教育部重点实验室, 合肥230039
  • 收稿日期:2010-10-08 修回日期:2010-12-07 发布日期:2011-05-01 出版日期:2011-05-01
  • 通讯作者: 何诚
  • 基金资助:

    国家自然科学基金资助项目(61071168);安徽大学“211工程”学术创新团队基金资助项目。

Probabilistic routing algorithm based on contact duration in DTN

WANG Gui-zhu, HE Cheng, WANG Bing-ting   

  1. Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei Anhui 230039, China
  • Received:2010-10-08 Revised:2010-12-07 Online:2011-05-01 Published:2011-05-01
  • About author:王贵竹(1965-),男,安徽郎溪人,副教授,博士,主要研究方向:网络通信、信息安全;何诚(1985-),男,安徽桐城人,硕士研究生,主要研究方向:DTN路由协议、拥塞控制;王炳庭(1984-),男,安徽滁州人,硕士研究生,主要研究方向:DTN路由协议、拥塞控制。

摘要: 鉴于连接时间对报文能否成功传输有重要影响,提出考虑连接时间的概率路由算法。该算法基于连接时间和历史相遇频率两个因素来估计递交概率,从而大大提高了报文成功递交的概率,减少了报文传输中断的发生。仿真结果表明,与传统的概率路由相比该路由算法具有较高的报文递交概率和较低的网络开销率。

关键词: 容迟网络, 概率路由, 相遇频率, 连接时间, 报文递交概率

Abstract: Considering that contact duration has significant influence on whether packet can be transmitted successfully or not, the authors proposed a Probabilistic Routing Protocol using History of Encounters and Transitivity based on Contact Duration (PRoPHET-CD), which combined contact duration with encounter frequency to estimate delivery probability. This protocol could improve the delivery probability significantly and reduce the interruption of packet transmission. The simulation results show that the protocol of PRoPHET-CD can significantly enhance the message delivery probability and reduce the overhead ratio.

Key words: Delay Tolerant Network (DTN), probabilistic routing, encounter frequency, contact duration, message delivery probability