面向高动态大规模卫星网络的层次稳定路由算法

The deployment of large-scale low earth orbit (LEO) satellite constellations offers high-speed and stable Internet services globally, playing a critical role in meeting the low-latency and high-reliability requirements of future 6G networks. However, the high-speed movement of LEO satellites leads to frequent changes in their relative positions and inter-satellite links (ISLs), resulting in continuous network topology adjustments, frequent route updates, unstable data transmission, and other challenges. These issues make it difficult to achieve the stability and reliability required for Internet communication. To address these challenges, this paper proposes a stable routing algorithm for LEO satellite networks. By introducing a stable path problem model that considers both routing stability and communication performance, the algorithm calculates the most stable satellite path with minimal changes across time slots, thereby reducing routing update frequency. Furthermore, a hierarchical stable routing architecture tailored for highly dynamic, large-scale satellite networks is designed to tackle the challenges of high routing complexity and significantly increased update costs in large-scale networks. This architecture divides the satellite network into hierarchical domains, reducing the computational complexity of stable routing and enhancing inter-satellite transmission efficiency. It employs an inter-domain stable routing strategy to ensure global stability and an intra-domain selective routing strategy to accommodate regional traffic characteristics. To cope with rapidly changing network topologies, the architecture further combines incremental local recalculation and topology predictive update mechanisms to enhance the timeliness and accuracy of path computation, ensuring that routing responses under hierarchical architecture can meet the real-time requirements of high dynamic environments. Simulation results demonstrate that, compared with related algorithms, the proposed hierarchical stable routing algorithm reduces satellite routing update frequency by 69%, average transmission delay by 14%, and overall network overhead by 44%.