基于预期延迟值的扩散转发路由算法

刘鑫; 金光; 江先亮; 钮俊

doi:10.11959/j.issn.1000-0801.2016294

您当前的位置：

首页 >

文章列表页 >

基于预期延迟值的扩散转发路由算法

研究与开发 | 更新时间：2024-06-05

- 基于预期延迟值的扩散转发路由算法
- Meeting delay expect value in spray and forward routing algorithm
- 电信科学 2016年32卷第11期页码：56-63
- 作者机构：
- 作者简介：
  
  [ "刘鑫（1991-），男，宁波大学硕士生，主要研究方向为无线传感网络、机会网络。" ]
  [ "金光（1972-），男，宁波大学教授、硕士生导师，主要研究方向为无线网络、物联网、网络协议等。" ]
  [ "江先亮（1986-），男，宁波大学讲师，主要研究方向为数据驱动网络协议、数据中心网络传输和调度、软件定义和虚拟化网络等。" ]
  [ "钮俊（1976-），男，宁波大学副教授、硕士生导师，主要研究方向为物联网、软件定义网络、模型检测等。" ]
- 基金信息：
  
  国家自然科学基金资助项目;The National Natural Science Foundation of China(61601252);宁波市科技创新团队研究计划基金资助项目;Science and Technology Innovation Team Research Project of Ningbo(2011B81002);宁波大学人才工程项目;NBU Research Project
- DOI：10.11959/j.issn.1000-0801.2016294
  中图分类号： TP393
- 网络出版日期：2016-11，
  
  纸质出版日期：2016-11-20
- 稿件说明：
移动端阅览
刘鑫, 金光, 江先亮, 等. 基于预期延迟值的扩散转发路由算法[J]. 电信科学, 2016,32(11):56-63.

Xin LIU, Guang JIN, Xianliang JIANG, et al. Meeting delay expect value in spray and forward routing algorithm[J]. Telecommunications science, 2016, 32(11): 56-63.
刘鑫, 金光, 江先亮, 等. 基于预期延迟值的扩散转发路由算法[J]. 电信科学, 2016,32(11):56-63. DOI： 10.11959/j.issn.1000-0801.2016294.

Xin LIU, Guang JIN, Xianliang JIANG, et al. Meeting delay expect value in spray and forward routing algorithm[J]. Telecommunications science, 2016, 32(11): 56-63. DOI： 10.11959/j.issn.1000-0801.2016294.

摘要

针对现有延迟容忍网络路由算法在消息传递过程中分发不灵活的问题，提出基于节点通话历史记录计算预期通断时长以及消息传递延迟值，并根据结果选择节点、分配副本数进行消息转发的路由算法（MDESF）。在算法不同阶段，根据节点的活跃度选择中继节点，再分配传递消息的副本数目，加快分发，降低延迟。同时为保证消息及时传递，在单副本阶段选择最优节点转发。本算法同时提出内存管理策略，提高消息转发成功率。仿真实验表明，该算法相对其他同类算法在投递率、交付时延和网络拥塞比率方面综合表现更优。

Abstract

The existing DTN routing algorithms tend to make data transition inflexible and have a long delay in contact.To solve those problems

an algorithm was proposed which called meeting delay expect value in spray and forward routing algorithm for DTN（MDESF）.This algorithm will use mobile node's contact history to conduct the expected average contact/disconnect time and message expected wait value（EWV）.With those attributes the MDESF will proportionally distribute replicas of a message between two nodes in multiple replicas phase.A buffer management strategy was proposed in order to improve the success rate of imformation fornarded.The simulation results illustrate that the proposed MDESF protocol outperform other existing ones.

关键词

Keywords

references

KEVIN . A delay-tolerant network architecture for challenged internets [J ] . ACM Sigcomm Computer Communication Review , 2003 , 33 ( 4 ): 27 - 34 .

BURLEIGH S , HOOKE A , TORGERSON L , et al . Delay-tolerant networking:an approach to interplanetary Internet [J ] . IEEE Communications Magazine , 2003 , 41 ( 6 ): 128 - 136 .

熊永平，孙利民，牛建伟，等 . 机会网络 [J ] . 软件学报， 2009 , 20 ( 1 ): 124 - 137 .

XIONG Y P , SUN L M , NIU J W , et al . Opportunistic networks [J ] . Journal of Software , 2009 , 20 ( 1 ): 124 - 137 .

CAO Y , SUN Z . Routing in delay/disruption tolerant networks:ataxonomy,survey and challenges [J ] . IEEE Communications Surveys＆Tutorials , 2011 , 41 ( 2 ): 297 - 327 .

VAHDAT A , BECKER D . Epidemic routing for partially-connected Ad Hoc networks [J ] . Master Thesis , 2000 .

SPYROPOULOS , THRASYVOULOS , PSOUNIS , et al . Spray and wait:an efficient routing scheme for intermittently connected mobile networks [J ] . ACM WDTN , 2015 : 252 - 259 .

蒋庆丰，门朝光，贾美娟，等 . 基于双向拍卖的 DTN拥塞感知激励策略 [J ] . 电信科学， 2015 , 31 ( 1 ): 15 - 22 .

JIANG Q F , MEN C G , JIA M J , et al . Congestion-aware incentive scheme based on double auction for DTN [J ] . Telecommunications Science , 2015 , 31 ( 1 ): 15 - 22 .

刘耀，王建新，等 . 一种基于节点运动范围自感知的路由算法 [J ] . 华南理工大学学报， 2009 , 37 ( 10 ): 79 - 83 .

LIU Y , WANG J X . A routing scheme based on awareness of node motion scope [J ] . Journal of South China University of Technology（Natural Science Edition） , 2009 , 37 ( 10 ): 79 - 83 .

王恩，杨永健，李莅 . DTN中基于生命游戏的拥塞控制策略 [J ] . 计算机研究与发展， 2014 , 51 ( 11 ): 2393 - 2470 .

WANG E , YANG Y J , LI L . Game of life based congestion control strategy in delay tolerant networks [J ] . Journal of Computer Research and Development , 2014 , 51 ( 11 ): 2393 - 2470 .

ZHENG H , WANG Y , WU J , et al . Optimizing multi-copy two-hop routing in mobile social networks [C ] // 11th IEEE International Conference on Sensing,Communication,and Networking , June 9 - 12 , 2014 , Singapore . New Jersey : IEEE Press , 2014 : 573 - 581 .

GAO W , LI Q , CAO G . Forwarding redundancy in opportunistic mobile networks:Investigation and elimination [C ] // IEEE Conference on Computer Communications , July 11 - 13 , 2014 , New York,USA . New Jersey : IEEE Press , 2014 : 2301 - 2309 .

JONES E P C , LI L , WARD P A S . Practical routing in delay-tolerant networks [C ] // ACM SIGCOMM Workshop on Delay-Tolerant Networking ACM , October 3 - 5 , 2005 , Philadelphia,USA . New Jersey : IEEE Press , 2005 : 237 - 243 .

WANG E , YANG Y , WU J . A knapsack-based message scheduling and drop strategy for delay-tolerant networks [J ] . Wireless Sensor Networks , 2015 : 120 - 134 .

王联，王新华，穗敬麒 . 机会网络模拟器ONE及其扩展研究 [J ] . 计算机应用研究， 2012 , 29 ( 1 ): 272 - 277 .

WANG L , WANG X H , SUI J L . Extending research for ONE simulator of opportunistic network [J ] . Application Research of Computers , 2012 , 29 ( 1 ): 272 - 277 .

HUI P , CROWCROFT J , YONEKI E . Bubble rap:social-based forwarding in delay tolerant networks [J ] . IEEE Transactions on Mobile Computing , 2011 , 10 ( 11 ): 1576 - 1589 .

PAPANIKOS N . Coordinating replication decisions in multi-copy routing for opportunistic networks [C ] // 10th IEEE wiMob . April 23 - 29 , 2014 , Bowcelona,Spain . New Jersey : IEEE Press , 2014 .

BURGESS J , GALLAGHER B , JENSEN D , et al . MaxProp:routing for vehicle-based disruption-tolerant networks [C ] // 25th IEEE International Conference on Computer Communications , April 23 - 29 , 2006 , Barcelona,Spain . New Jersey : IEEE Press , 2006 : 1 - 11 .

浏览量

466

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

空间延迟容忍网络半物理仿真平台的设计和实现

延迟容忍网络中基于邻居信息精确度的查询算法