TY - GEN
T1 - A Multi-Region Division Routing Algorithm Based on Fuzzy-Shortest-Path-First for LEO Satellite Networks
AU - Li, Shangyi
AU - Wang, Fu
AU - Yao, Haipeng
AU - Dong, Ze
AU - Dong, Tao
AU - Yin, Jie
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - As an important complement to the terrestrial network and an essential component of the future 6G, Low Earth Orbit (LEO) satellite network is expected to provide higher-quality communication services in combination with terrestrial network and attracts widespread research interest. Since the unbalanced distribution of terrestrial services may lead to inter-satellite link (ISL) congestion, balancing the network load has become one of the key issues for LEO satellite networks. In order to prevent ISL congestion in LEO networks, we propose a multi-region division routing algorithm based on fuzzy-shortest-path-first (FSPF-MDR) for LEO satellite networks. We divide the satellite network into multiple small regions and share link information within the regions to achieve congestion avoidance. Simulation results show that, using the proposed algorithm, the computing complexity is reduced significantly with a slightly cost of increasing average hop count. Furthermore, it is able to achieve congestion prevention while using fewer resources. With different scales of LEO networks, the computing complexity can be reduced by 45% to 70%.
AB - As an important complement to the terrestrial network and an essential component of the future 6G, Low Earth Orbit (LEO) satellite network is expected to provide higher-quality communication services in combination with terrestrial network and attracts widespread research interest. Since the unbalanced distribution of terrestrial services may lead to inter-satellite link (ISL) congestion, balancing the network load has become one of the key issues for LEO satellite networks. In order to prevent ISL congestion in LEO networks, we propose a multi-region division routing algorithm based on fuzzy-shortest-path-first (FSPF-MDR) for LEO satellite networks. We divide the satellite network into multiple small regions and share link information within the regions to achieve congestion avoidance. Simulation results show that, using the proposed algorithm, the computing complexity is reduced significantly with a slightly cost of increasing average hop count. Furthermore, it is able to achieve congestion prevention while using fewer resources. With different scales of LEO networks, the computing complexity can be reduced by 45% to 70%.
KW - LEO satellite networks
KW - load balancing
KW - region division
KW - routing algorithm
UR - http://www.scopus.com/inward/record.url?scp=85167711748&partnerID=8YFLogxK
U2 - 10.1109/IWCMC58020.2023.10182748
DO - 10.1109/IWCMC58020.2023.10182748
M3 - Conference contribution
AN - SCOPUS:85167711748
T3 - 2023 International Wireless Communications and Mobile Computing, IWCMC 2023
SP - 800
EP - 805
BT - 2023 International Wireless Communications and Mobile Computing, IWCMC 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 19th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2023
Y2 - 19 June 2023 through 23 June 2023
ER -