A Robust Routing Algorithm Against Link Failures for LEO Satellite Networks

To solve the sudden inter-satellite link failures of low earth orbit satellite networks (LEO-SNs), a robust routing algorithm against link failures is proposed in this paper. Firstly, we introduce a 2-D Markov model for LEO-SNs to study the problem about how to minimize the probability of encountering link failures in minimum-hop path set. Theoretical results indicate that forwarding in the more-hop direction has a lower probability to encounter link failures. Based on the results, we propose a More-Hop Direction Priority routing algorithm with routing Recovery strategy by Extending Path Area (MHDPREPA). The algorithm consists of three components which are routing preparation, routing calculation and routing recovery. In the routing process, each node aims to avoid encountering link failures when selecting the next hop node. If the node encounters link failures, a routing recovery strategy is adopted to bypass the failed links. Simulation results show that our proposed algorithm can effectively improve delivery ratio and average throughput compared with baseline algorithms.

Authors

Institutions

Publication Details

Published
2024-10-07
DOI
https://doi.org/10.1109/vtc2024-fall63153.2024.10757942
Citations
1
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
1.30

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Robust Routing Algorithm Against Link Failures for LEO Satellite Networks

Hanjiang Nie, Yi Wu, Fei Shen, Feng Yan et al.
1 citations
Satellite Communication Systems
1.30
article

A Robust Routing Algorithm Against Link Failures for LEO Satellite Networks

Hanjiang Nie, Yi Wu, Fei Shen, Feng Yan, Lianfeng Shen, Weiwei Xia, Yueyue Zhang
article en
1 citations

Abstract

To solve the sudden inter-satellite link failures of low earth orbit satellite networks (LEO-SNs), a robust routing algorithm against link failures is proposed in this paper. Firstly, we introduce a 2-D Markov model for LEO-SNs to study the problem about how to minimize the probability of encountering link failures in minimum-hop path set. Theoretical results indicate that forwarding in the more-hop direction has a lower probability to encounter link failures. Based on the results, we propose a More-Hop Direction Priority routing algorithm with routing Recovery strategy by Extending Path Area (MHDPREPA). The algorithm consists of three components which are routing preparation, routing calculation and routing recovery. In the routing process, each node aims to avoid encountering link failures when selecting the next hop node. If the node encounters link failures, a routing recovery strategy is adopted to bypass the failed links. Simulation results show that our proposed algorithm can effectively improve delivery ratio and average throughput compared with baseline algorithms.

Fujian Normal University (CN), Shanghai Industrial Technology Institute (CN), Shanghai Institute of Microsystem and Information Technology (CN), Southeast University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 11%
Satellite Communication Systems
1.30
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Robust Routing Algorithm Against Link Failures for LEO Satellite Networks — Hanjiang Nie, Yi Wu, et al. · (2024) | TGRS Research Map | TGRS