A distributed on-demand routing algorithm for large-scale low Earth orbit constellation

Hefei Hu, siyan lv, Jun He, Simin Feng
{"title":"A distributed on-demand routing algorithm for large-scale low Earth orbit constellation","authors":"Hefei Hu, siyan lv, Jun He, Simin Feng","doi":"10.1117/12.3031951","DOIUrl":null,"url":null,"abstract":"With the advancement of satellite communication technology and space launch technology, low earth orbit (LEO) satellites have become the best choice to overcome geographical limitations and achieve global communication. In order to achieve efficient performance in the large-scale LEO constellation network, a routing algorithm adapted to satellite network is necessary. A routing algorithm based on on-demand routing is proposed to address the issues of high network overhead and difficult routing in the large-scale LEO constellation. \"Maximum routing restriction area\" is defined based on the satellite network structure to reduce the routing overhead in the large-scale constellation network and improve network performance. The simulation results show that this algorithm has better network performance in the large-scale constellation network compared to the other on-demand routing algorithms.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Algorithms, Microchips and Network Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.3031951","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the advancement of satellite communication technology and space launch technology, low earth orbit (LEO) satellites have become the best choice to overcome geographical limitations and achieve global communication. In order to achieve efficient performance in the large-scale LEO constellation network, a routing algorithm adapted to satellite network is necessary. A routing algorithm based on on-demand routing is proposed to address the issues of high network overhead and difficult routing in the large-scale LEO constellation. "Maximum routing restriction area" is defined based on the satellite network structure to reduce the routing overhead in the large-scale constellation network and improve network performance. The simulation results show that this algorithm has better network performance in the large-scale constellation network compared to the other on-demand routing algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大规模低地球轨道星座分布式按需路由算法
随着卫星通信技术和航天发射技术的发展,低地轨道(LEO)卫星已成为克服地理限制、实现全球通信的最佳选择。为了在大规模低地轨道星座网络中实现高效性能,需要一种适应卫星网络的路由算法。针对大规模低地轨道星座网络开销大、路由困难的问题,提出了一种基于按需路由的路由算法。根据卫星网络结构定义了 "最大路由限制区",以降低大规模星座网络的路由开销,提高网络性能。仿真结果表明,与其他按需路由算法相比,该算法在大规模星座网络中具有更好的网络性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Advanced deep-learning-based chip design enabling algorithmic and hardware architecture convergence Fusing lightweight Retinaface network for fatigue driving detection A local flooding-based survivable routing algorithm for mega-constellations networks with inclined orbits A privacy preserving carbon quota trading and auditing method DOA estimation based on mode and maximum eigenvector algorithm with reverberation environment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1