计算机工程

• 移动互联与通信技术 • 上一篇    下一篇

容延网络中一种改进的概率路由协议

刘文锋   

  1. (菏泽学院计算机与信息工程系,山东 菏泽 274015)
  • 收稿日期:2014-07-15 出版日期:2015-07-15 发布日期:2015-07-15
  • 作者简介:刘文锋(1978-),男,讲师、硕士,主研方向:容延网络,大数据处理。

An Improved Probabilistic Routing Protocol in Delay Tolerant Network

LIU Wenfeng   

  1. (Department of Computer and Information Engineering,Heze University,Heze 274015,China)
  • Received:2014-07-15 Online:2015-07-15 Published:2015-07-15

摘要: 容延网络大多基于历史路由协议和粗粒度信息做出消息转发决策,然而这些粗粒度信息无法较好地描述网络节点间的接触模式,降低了转发决策的准确性。为此,提出基于细粒度接触表征的概率路由协议FG-PRoPHET,利用时隙滑动窗口机制维护细粒度实时统计数据,通过调整滑动窗口尺寸控制历史数据粒度,进而描述网络节点间的接触模式。根据细粒度接触统计数据及相遇节点间所有接触事件的持续时间,计算节点接触概率。实验结果表明,与现有概率路由协议相比,FG-PRoPHET具有较高的报文投递率和网络缓存资源利用率,以及较低的通信开销。

关键词: 容延网络, 概率路由, 消息转发, 细粒度, 时隙滑动窗口机制, 贪婪转发

Abstract: Most existing history-based routing protocols for Delay Tolerant Network(DTN)make message forwarding decisions according to coarse-grained encounter information.However,these coarse-grained information can not give precise expression of the contact patterns between nodes in the network,thereby leading to inaccurate forwarding decisions.This paper presents a Fine-grained Probabilistic Routing Protocol Using History of Encounters and Transitivity(FG-PRoPHET),it uses slotted sliding window mechanism for maintaining fine-grained real-time statistics,and controls the historical data granularity by adjusting the size of sliding window,further describes the contact patterns between network nodes.Based on the statistics of fine-grained contact and the overall duration of all contact events occurring during sliding window of the encountering peer to peer nodes,it can compute the probability of node contact.Experimental results show that,compared with existing probabilistic routing protocols,FG-PRoPHET can significantly enhance message delivery rate and resource utilization of network caching with lower communication overhead.

Key words: Delay Tolerant Network(DTN), probabilistic routing, message forwarding, fine-grained, slotted sliding window mechanism, greedy forwarding

中图分类号: