A shortest path algorithm for mobile satellite communication network

Mobile satellite network is a special time-varying network. Some classical network theories used in the current terrestrial networks, such as the shortest path algorithm, cannot be applied to it availably. In this paper, based on the proposed model of mobile satellite network, the classical shortest path algorithm of fixed topological network, such as the Dijkstra algorithm, is proved to be restrictive when it is applied in mobile satellite network. Here, a novel shortest path algorithm for mobile satellite network is given and optimized. Correlative simulation indicates that this algorithm can be effectively applied to the mobile satellite communication network.