An Improved Earliest-Delivery Routing Algorithm in Double-layered Satellite Delay Tolerant Networks

G. Zhao, Mingchuan Yang, Qing Guo, G. Wang
{"title":"An Improved Earliest-Delivery Routing Algorithm in Double-layered Satellite Delay Tolerant Networks","authors":"G. Zhao, Mingchuan Yang, Qing Guo, G. Wang","doi":"10.1109/ISNCC.2018.8530902","DOIUrl":null,"url":null,"abstract":"Since presented by K. Fall, the new-type network Delay and Disruption Tolerant Network (DTN) came to become a hot area of research. In recent years, many kinds of DTN routing algorithms have been proposed. With the characteristics of long time delay, high packet loss rate and intermittent connectivity. Satellite networks also belong to a kind of DTN. But meanwhile, they have their unique characteristics of satellite nodes regular running in orbits and predictable inter-satellite links on and off, for which deterministic routing algorithm is more suited in Satellite DTN networks. This paper focuses on studying the theoretical knowledge of a kind of deterministic DTN routing algorithm, Earliest-Delivery(ED) algorithm. And combining with the characteristics of the satellite network above, we propose an improved ED algorithm from three aspects of distributed routing, routing update strategy and tag - based dynamic storage scheme. Ultimately, we simulate the LEO/MEO two-layer satellite delay tolerant network in OPNET, and analyze the performance of two algorithms upon packet delivery ratio, average end-to-end delay and the number of packets destroyed in the storage queue. The result shows the improved algorithm performs better in satellite DTN network.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISNCC.2018.8530902","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Since presented by K. Fall, the new-type network Delay and Disruption Tolerant Network (DTN) came to become a hot area of research. In recent years, many kinds of DTN routing algorithms have been proposed. With the characteristics of long time delay, high packet loss rate and intermittent connectivity. Satellite networks also belong to a kind of DTN. But meanwhile, they have their unique characteristics of satellite nodes regular running in orbits and predictable inter-satellite links on and off, for which deterministic routing algorithm is more suited in Satellite DTN networks. This paper focuses on studying the theoretical knowledge of a kind of deterministic DTN routing algorithm, Earliest-Delivery(ED) algorithm. And combining with the characteristics of the satellite network above, we propose an improved ED algorithm from three aspects of distributed routing, routing update strategy and tag - based dynamic storage scheme. Ultimately, we simulate the LEO/MEO two-layer satellite delay tolerant network in OPNET, and analyze the performance of two algorithms upon packet delivery ratio, average end-to-end delay and the number of packets destroyed in the storage queue. The result shows the improved algorithm performs better in satellite DTN network.
一种改进的双层卫星容延迟网络中最早投递路由算法
自K. Fall提出新型网络延迟与中断容忍网络(Delay and Disruption Tolerant network, DTN)以来,已成为研究的热点。近年来,人们提出了多种DTN路由算法。具有时延长、丢包率高、间歇性连接等特点。卫星网络也属于数字电视的一种。但同时,它们又具有卫星节点轨道运行规律和星间链路开断可预测的独特特点,因此确定性路由算法更适合于卫星DTN网络。本文重点研究了一种确定性DTN路由算法——最早投递(ED)算法的理论知识。并结合上述卫星网络的特点,从分布式路由、路由更新策略和基于标签的动态存储方案三个方面提出了一种改进的ED算法。最后,我们在OPNET中模拟了LEO/MEO两层卫星容忍延迟网络,并分析了两种算法在分组分发率、端到端平均延迟和存储队列中销毁的分组数量方面的性能。结果表明,改进后的算法在卫星DTN网络中具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信