期刊文献+

流星余迹通信网络的路由算法 被引量:1

Routing Algorithm Based on Meteor-burst Communication
下载PDF
导出
摘要 流星余迹通信是一种重要的应急通信方式。其通信网络具有传输延时长和链路间歇中断的特点,适用于这种特殊网络的路由算法具有明显的针对性,有待深入研究。文中在研究流星余迹网络拓扑结构的基础上,基于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算法在流星余迹网络中具有较强的适应性,能够为流星余迹组网的建设提供参考。 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 average duration and 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.
作者 高航 慕晓冬 易昭湘 仝彤 袁覃恩 GAO Hang;MU Xiao-dong;YI Zhao-xiang;TONG Tong;YUAN Tan-en(Department of Information Engineering,Rocket Force University of Engineering,Xi’an 710025,China)
出处 《计算机科学》 CSCD 北大核心 2018年第7期84-89,共6页 Computer Science
关键词 流星余迹通信 延时容忍网络 时延模型 OED算法 Meteor burst communication Delay tolerant network Delay model Optimistic earliest delivery algorithm
  • 相关文献

参考文献7

二级参考文献71

  • 1武广友.流星余迹通信系统与网络结构[J].移动通信,2004(z1):149-152. 被引量:4
  • 2刘志斌,陈家松.流星余迹猝发通信分析[J].舰船电子工程,2006,26(4):125-128. 被引量:9
  • 3沈荣骏.我国天地一体化航天互联网构想[J].中国工程科学,2006,8(10):19-30. 被引量:130
  • 4DAVRAS YAVUZ. Meteor Burst Communications[ J]. IEEE Communications Magazine, 1990(09 ) :40 -48.
  • 5TANG Z Y, GARCIA - LUNA - ACEVES J J. A Protocol for Topology - Dependent Transmission Scheduling in Wireless Networks [ C ]. USA : 1EEE, 1999:20 - 25.
  • 6ABEL M W. Meteor Burst Communications:Bits Per Burst Performance Bounds [ J ]. IEEE Transactions on Communications, 1986,34 (09) :927 -936.
  • 7周晓波,卢汉成,李津生,洪佩琳.AED:一种用于DTN的增强型Earliest-Delivery算法[J].电子与信息学报,2007,29(8):1956-1960. 被引量:14
  • 8Kevin Fall. A delay-tolerant network architecture for challenged internets [C]. In: Proc of ACM SIOCOMM'03. New York: ACM Press, 2003. 27-34.
  • 9S Jain, K Fall, R Patra. Routing in a delay tolerant networking [C]. In: Proc of ACM SIGCOMM'04. New York: ACM Press, 2004. 145-158.
  • 10Yili Gong, Yongqiang Xiong, Qian Zhang, et al. Anycast routing in delay tolerant networks [C]. In: Proc of GIOBECOM'06. Piscataway, NJ: IEEE Press, 2006. 1-5.

共引文献38

同被引文献23

引证文献1

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部