期刊文献+

一种适应卫星网络的DTN分组路由策略

A DTN Packet Routing Strategy for Satellite Networks
下载PDF
导出
摘要 在空间延迟容忍网络(DTN)中,由于卫星节点运行轨道的限制,造成节点运动并不具有典型随机性。节点间历史接触时间的长短和未来接触的概率往往存在正相关,并且根据卫星运行轨道的异同,接触的可能也存在较大差异。针对以上特点,结合现有DTN路由算法的优势,设计了一种基于历史信息统计的DTN分组路由策略,通过将卫星节点按运行轨道分组,并结合历史接触时长计算接触概率,以适应卫星网络节点运动场景,使接触概率预测更加准确,进而提高消息下一跳选择的准确性。仿真结果表明,该路由策略与现有路由算法相比,具有较低的缓存消耗,并有较高的消息投递率和较优的投递时延。 In the space delay tolerant network(DTN),the node motion is not typically random due to the limitation of the orbit of the satellite.There is a positive correlation between the length of historical contact time and the probability of future contact between nodes,and according to the similarities and differences of satellite orbit,the possibility of contact is also quite different.This paper aims at the above characteristics,combined with the advantages of existing DTN routing algorithms,designed a DTN packet routing strategy based on historical information statistics.By grouping satellite nodes into operational orbits,the contact probability is calculated by the historical contact time,and adapt to the motion of satellite network.To get more accurate contact probability predict,and improve the accuracy of next hop selection.The simulation results show that compared with the existing routing algorithm,this routing strategy has lower cache consumption,higher message delivery rate and better delivery delay.
作者 毛一丁 田洲 赵雨 孙汉汶 徐伟琳 赵毅 MAO Yiding;TIAN Zhou;ZHAO Yu;SUN Hanwen;XU Weilin;ZHAO Yi(China Academy of Space Technology(Xi′an),Xi′an 710100,China)
出处 《西北工业大学学报》 EI CAS CSCD 北大核心 2020年第S01期113-119,共7页 Journal of Northwestern Polytechnical University
关键词 延迟容忍网络(DTN) 分组路由 接触概率 delay tolerant network(DTN) packet routing contact probability
  • 相关文献

参考文献2

二级参考文献16

  • 1林闯,雷蕾.下一代互联网体系结构研究[J].计算机学报,2007,30(5):693-711. 被引量:64
  • 2Fall K.A delay tolerant network architecture for challenged internets[A].Proc of the 2003 Conf on Applications,Technologies,Architectures and Protocols for Computer Communications[C].Karlsruhc,Germany:ACM,2003.27-34.
  • 3Ahlswede R,et al.Network information flow[J].IEEE Transactions on Information Theory,2000,46(4):1204-1216.
  • 4Shuo Yen Robert Li,et al.Linear network coding[J].IEEE Transactions on Information Theory,2003,49(2):371-381.
  • 5Tracey H,Muriel M'E,Ralf K,et al.A random linear network coding approach to multicast[J].IEEE Transactions on Information Theory,2006,52(10):4413-4430.
  • 6Salim E L Rouayheb,Alex Sprintson,Costas Georghiades.Robust network codes for unicast conneoions:a case study[J].IEEE/ACM Transactions on Networking,2011,19 (3):644-656.
  • 7Bao Chun Li,Di Niu.Random network coding in Peer-to-Peer networks:from theory to practice[J].Proceedings of the IEEE,2011,99(3):513-523.
  • 8Fong S L,et al.Variable-rate linear network coding[J].IEEE Trans on Information Theory,2010,56(6):2618-2625.
  • 9Youail,R S,Wenqing Cheng,Shaoguo Tao.Cost minimization for multi-source multi-sinks network coding[A].ICYCS 2008[C].Hunan,China:IEEE,2008.253-258.
  • 10Eugster P T,Felber P A,Guerraoui K Kermarrec A M.The many faces of publish/subscribe[J].ACM Computing Surveys,2003,35(2):114-131.

共引文献77

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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