LEO Mega-Constellations Routing Algorithm Based on Area Segmentation

Rui Li, Jiaxin Zhang, Shuang Zheng, Kaiwei Wang, Peng Wang, Xing Zhang
{"title":"LEO Mega-Constellations Routing Algorithm Based on Area Segmentation","authors":"Rui Li, Jiaxin Zhang, Shuang Zheng, Kaiwei Wang, Peng Wang, Xing Zhang","doi":"10.1109/WCNC55385.2023.10118676","DOIUrl":null,"url":null,"abstract":"Low earth orbit (LEO) mega-constellations in future 6G have attracted the attention from both academia and industry. However, due to the high dynamic characteristic of the LEO satellite network topology and the limited on-board resources, existing approaches relying on high on-board processing capabilities and monitoring the global network state, result in intolerable packet loss rate and excessive signalling overhead. In this paper, a routing algorithm based on area segmentation for LEO mega-constellations is proposed according to the topological characteristics of the network. Specifically, we divide the LEO mega-constellations into multiple areas with four quadrant parts. In addition, the transmission cluster is defined consisted of two adjacent parts based on transmission direction. With the relative geographical location and transmission clusters, we joint intra-area and inter-area routing to realize multi-path routing and forwarding by periodically updating the link state, instead of globally calculating. Simulation results demonstrate that the proposed algorithm can achieve higher throughput, decrease the packet loss rate by 22% and reduce the signalling overhead significantly.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC55385.2023.10118676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Low earth orbit (LEO) mega-constellations in future 6G have attracted the attention from both academia and industry. However, due to the high dynamic characteristic of the LEO satellite network topology and the limited on-board resources, existing approaches relying on high on-board processing capabilities and monitoring the global network state, result in intolerable packet loss rate and excessive signalling overhead. In this paper, a routing algorithm based on area segmentation for LEO mega-constellations is proposed according to the topological characteristics of the network. Specifically, we divide the LEO mega-constellations into multiple areas with four quadrant parts. In addition, the transmission cluster is defined consisted of two adjacent parts based on transmission direction. With the relative geographical location and transmission clusters, we joint intra-area and inter-area routing to realize multi-path routing and forwarding by periodically updating the link state, instead of globally calculating. Simulation results demonstrate that the proposed algorithm can achieve higher throughput, decrease the packet loss rate by 22% and reduce the signalling overhead significantly.
基于区域分割的LEO大星座路由算法
未来6G低地球轨道(LEO)巨型星座已经引起了学术界和工业界的关注。然而,由于LEO卫星网络拓扑结构的高动态特性和有限的星上资源,现有的方法依赖于高星上处理能力和监测全局网络状态,导致丢包率难以忍受,信令开销过大。本文针对低轨道巨型星座网络的拓扑特点,提出了一种基于区域分割的路由算法。具体来说,我们用四个象限的部分将LEO巨型星座划分为多个区域。此外,根据传输方向定义了由两个相邻部分组成的传输簇。利用相对的地理位置和传输集群,我们将区域内路由和区域间路由联合起来,通过周期性更新链路状态来实现多路径路由和转发,而不是全局计算。仿真结果表明,该算法可以实现更高的吞吐量,丢包率降低22%,显著降低信令开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信