Research on Routing Algorithm Based on Low Orbit Satellite Link Handover

With the burgeoning development of China's space industry and the rapid advancements in satellite technology, satellite networks have acquired significant prominence in contemporary wireless communication. Low-orbit satellites, renowned for their attributes such as low latency, energy efficiency, and low bit error rate, have garnered substantial attention. However, the dynamic nature of satellites results in frequent handovers of inter-satellite connections. As satellite networks expand in scale, the frequency of link handovers emerges as a critical challenge. This paper introduces an optimal backup path algorithm, termed Minimum Cost Optimal Backup Path Algorithm (OBPMC), to tackle this issue. By capitalizing on the periodicity inherent in satellite networks, a cost prediction model is established for inter-satellite links (ISL), and the OBPMC algorithm is deployed. Simulation experiments demonstrate that the algorithm provides superior link handover protection without significantly affecting the end-to-end average delay, outperforming the Bellman-Ford and LCRA algorithms.Moreover, the algorithm is a time complexity approximation
$o$
(n) algorithm, which has a great advantage for satellite networks of increasing size.