Share Email Print
cover

Proceedings Paper

A shortest path algorithm for satellite time-varying topological network
Author(s): Tao Zhang; Zhongkan Liu; Jun Zhuang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Mobile satellite network is a special time-varying network. It is different from the classical fixed network and other time-dependent networks which have been studied. Therefore some classical network theories, such as the shortest path algorithm, can not be applied to it availably. However, no study about its shortest path problem has been done. In this paper, based on the proposed model of satellite time-varying topological network, the classical shortest path algorithm of fixed network, such as the Dijkstra algorithm, is proved to be restrictive when it is applied in satellite network. Here, a novel shortest path algorithm for satellite time-varying topological network is given and optimized. Correlative simulation indicates that this algorithm can be effectively applied to the satellite time-varying topological network.

Paper Details

Date Published: 5 January 2006
PDF: 5 pages
Proc. SPIE 5985, International Conference on Space Information Technology, 598513 (5 January 2006); doi: 10.1117/12.656805
Show Author Affiliations
Tao Zhang, Beijing Univ. of Aeronautics and Astronautics (China)
Zhongkan Liu, Beijing Univ. of Aeronautics and Astronautics (China)
Jun Zhuang, Beijing Univ. of Aeronautics and Astronautics (China)


Published in SPIE Proceedings Vol. 5985:
International Conference on Space Information Technology

© SPIE. Terms of Use
Back to Top