计算机科学

计算机科学 ›› 2018, Vol. 45 ›› Issue (7): 84-89.doi: 10.11896／j.issn.1002-137X.2018.07.013

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

流星余迹通信网络的路由算法

高航,慕晓冬,易昭湘,仝彤,袁覃恩   

  1. 火箭军工程大学信息工程系 西安710025
  • 出版日期:2018-07-30 发布日期:2018-07-30
  • 作者简介:高 航(1993-),硕士生,主要研究方向为计算机仿真,E-mail:2796314705@qq.com;慕晓冬(1965-),博士生导师,主要研究方向为计算机仿真,E-mail:wascom4@sina.com(通信作者);易昭湘(1980-),副教授,主要研究方向为通信仿真;仝 彤(1992-),硕士生,主要研究方向为计算机仿真;袁覃恩(1994-),硕士生,主要研究方向为计算机仿真。

Routing Algorithm Based on Meteor-burst Communication

GAO Hang, MU Xiao-dong, YI Zhao-xiang ,TONG Tong, YUAN Tan-en   

  1. Department of Information Engineering,Rocket Force University of Engineering,Xi’an 710025,China
  • Online:2018-07-30 Published:2018-07-30

PDF (PC)

782

摘要： 流星余迹通信是一种重要的应急通信方式。其通信网络具有传输延时长和链路间歇中断的特点,适用于这种特殊网络的路由算法具有明显的针对性,有待深入研究。文中在研究流星余迹网络拓扑结构的基础上,基于OPNET仿真软件构建流星余迹组网模型,结合适用于DTN(Delay Tolerant Network)网络的ED(Earliest Delivery)算法和EDLQ(Earliest Delivery with Local Queue)算法的特点,分析通信时延模型,提出一种改进的OED(Optimistic Earliest Delivery)算法。基于已建立的模型对数据传输成功率和网络吞吐量进行仿真。仿真结果表明,OED算法在组网网络的数据吞吐量和数据传输成功率方面优于ED算法和EDLQ算法,能够避免因队列溢出导致的数据包丢失;通过增大节点容量,OED算法的数据通过率相对于ED算法和EDLQ算法分别提升了20%和8%;路由算法的选择不影响流星余迹节点间链路的平均持续时间和平均中断等待时间。OED算法在流星余迹网络中具有较强的适应性,能够为流星余迹组网的建设提供参考。

关键词: OED算法, 流星余迹通信, 时延模型, 延时容忍网络

Abstract: Meteor-burst communication is an important emergency communication mode,and the communication network has the characteristics of long delay transmission and intermittent interruption of link.The routing algorithm applicable to this special network has obvious pertinence and needs further study.Based on the study of meteor topology network topology,this paper built a meteor network model based on OPNET simulation software,and proposed an improved algorithm OED (Optimistic Earliest Delivery) by analyzing the communication delay model combined with ED (Earliest Delivery) algorithm and EDLQ(Earliest Delivery with Local Queue) algorithm for DTN (Delay Tolerant Network).Based on the established model,the data transmission success rate and network throughput were simulated.The simulation results show that the OED algorithm is superior to the ED algorithm and EDLQ algorithm in terms of data throughput and data transmission success rate of network,and it can overcome the packet loss caused by the queue overflow.By increasing the node capacity,the data pass rate of OED algorithm is increased by 20% compared with ED algorithm and is increased by 8% compared with EDLQ algorithm.The choice of routing algorithm does not affect the ave-rage durationand the average interruption latency time of link between the meteor nodes.OED algorithm has strong adaptability in meteor trail network,which can provide reference for meteor burst network construction.

Key words: Delay model, Delay tolerant network, Meteor burst communication, Optimistic earliest delivery algorithm

中图分类号: 

  • TP393
[1]LI Q,ZHU L D.Modeling and Simulation of Meteor Burst Communication[J].Communications Technology,2010,43(11):78-80.(in Chinese)
黎庆,朱立东.流星余迹通信网络建模与仿真[J].通信技术,2010,43(11):78-80.
[2]WANG Y C,LI H Y.Research of Routing Algorithm Based on the Meteor-Burst Communication [D].Xi’an:Xidian University,2009.(in Chinese)
王永灿,李红艳.基于流星余迹通信网络的路由算法研究[D].西安:西安电子科技大学,2009.
[3]JIA J X,LIU G Z,XU M.Probability Routing Algorithm in DTN Based on Time and Space and Sociality[J].Computer Scien-ce,2017,43(6A):295-301.(in Chinese)
贾建新,刘广忠,徐明.DTN基于时空和社会性的概率路由算法[J].计算机科学,2017,43(6A):295-301.
[4]ZHANG L,CHEN Z G,WU J,et al.Optimal Selection ofNeighbor Node Routing Protocol[J].Journal of Chinese Computer System,2017,38(1):62-66.(in Chinese)
张霖,陈志刚,吴嘉,等.最优化选择邻居节点路由协议[J].小型微型计算机系统,2017,38(1):62-66.
[5]FRAIRE J A,MADOERY P G,FINOCHIETTO J M.On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks[J].IEEE Sensors Journal,2014,14(11):3874-3882.
[6]ZHAO H,LIANG H.Contact Gragh Routing Algorithm Based on Capacity Constraints in Deep Space Communication[J].Science Technology and Engineering,2016,16(17):210-214.(in Chinese)
赵辉,梁花.基于容量约束的深空接触图路由算法[J].科学技术与工程,2016,16(17):210-214.
[7]ZHAO G S,CHEN M.Congestion control mechanism based on accepting threshold in delay tolerant networks[J].Journal of Software,2013,24(1):153-163.(in Chinese)
赵广松,陈鸣.基于接收阈值的容延网络拥塞控制机制[J].软件学报,2013,24(1):153-163.
[8]YAN H C,GUO J,ZHANG H J.Performance evaluation ofrouting algorithms on space delay/disruption tolerant networks[J].Institute of Spacecraft System Engineering,2016,36(4):38-46.(in Chinese)
燕宏成,郭坚,张红军.空间延迟/中断容忍网络路由算法性能评估[J].空间科学与技术,2016,36(4):38-46.
[9]ZHOU X B,ZHOU J,LU H C.Analysis of Delay Model in DTN[J].Journal of Computer Research and Development,2008,45(6):960-966.(in Chinese)
周晓波,周健,卢汉成.DTN网络的延时模型分析[J].计算机研究与发展,2008,45(6):960-966.
[10]WANG E,YANG Y J,LI L.Game of Life Based CongestionControl Strategy in Delay Tolerant Networks[J].Journal of Computer Research and Development,2014,51(11):2393-2407.(in Chinese)
王恩,杨永健,李莅.DTN中基于生命游戏的拥塞控制策略[J].计算机研究与发展,2014,51(11):2393-2407.
[11]QIU K.Performance of DTN Bundle Routing Protocol in Deep Space[D].Harbin:Harbin Institute of Technology,2012.(in Chinese)
邱坤.深空DTN集束层路由协议研究[D].哈尔滨:哈尔滨工业大学,2012.
[12]陈敏.OPNET 网络仿真[M].北京:清华大学出版社,2004.
[1] 孙蓉 刘景伟 王新梅.
基于流星余迹通信系统的低密度校验码的分析设计

计算机科学, 2008, 35(4): 78-81.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
地址：重庆市渝北区洪湖西路18号    邮编：401121  
电话：023-63500828（编辑部） 023-67039612（会议/专题） 023-67039623（财务/发票）
E-mail：jsjkx12@163.com
本系统由北京玛格泰克科技发展有限公司设计开发