摘要： 移动卫星网络的拓扑时变性对其最短路径求解带来新的问题。文章利用提出的移动卫星网络模型，证明了基于传统网络的最短路径算法在移动卫星网络中使用存在局限性，提出了一种适用于移动卫星网络的最短路径求解方法和优化算法，并进行了仿真验证。

关键词: 卫星网络；时变拓扑网络；最短路径算法

Abstract: Mobile satellite network is a special time-varying network. The shortest path problem of it is different from other network. Based on the proposed mobile satellite network model, it is proved that the shortest path algorithm of classical fixed topological network is restrictive in mobile satellite network. The shortest path algorithm of mobile satellite network is proposed and optimized. A simulation about it is given

Key words: Satellite network; Time-varying topological network; Shortest path algorithm