摘要： 针对使用星际链路ISL的LEO卫星系统，许多学者提出基于面向连接结构的路由算法，但这些算法的性能很大程度上依赖于初始路径的建立，健壮性差。该文提出一种基于面向连接结构的增强路由算法，只要源卫星与目的卫星之间存在一条通路，源卫星便可以与目的卫星通信。若源卫星与目的卫星之间存在多条路径，通过该算法一定能在线找到其中的最佳路径。通过仿真实验评价了算法的性能，证明算法比已有的基于面向连接结构的路由算法具有更高的鲁棒性。

关键词: LEO卫星网络, 鲁棒性, 搜索算法, 动态路由

Abstract: In recent years, some routing algorithms for connection-oriented LEO satellite communication networks have been developed, but the performance of these routing algorithms depends heavily on the optimality of the initial path establishment, so robustness is not good. This paper proposes a routing algorithm for improving robustness in connection-oriented LEO satellite communication networks. A source satellite can communicate with any satellite, so long as a path exists between the source satellite and the destination satellite. If there exist many paths between the source satellite and a destination satellite, it can search the shortest path on-line, and the time for routing is not occupied by the operation of the algorithm. The performance of the algorithm is evaluated through simulation. Experimentaql results show that the robust routing algorithm is more robust than other routing algorithms for connection-oriented network structure.

Key words: LEO satellite networks, robustness, search algorithm, dynamic routing

中图分类号: 

• TP393