Paper
4 January 2006 A shortest path algorithm for satellite time-varying topological network
Tao Zhang, Zhongkan Liu, Jun Zhuang
Author Affiliations +
Proceedings Volume 5985, International Conference on Space Information Technology; 598513 (2006) https://doi.org/10.1117/12.656805
Event: International Conference on Space information Technology, 2005, Wuhan, China
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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tao Zhang, Zhongkan Liu, and Jun Zhuang "A shortest path algorithm for satellite time-varying topological network", Proc. SPIE 5985, International Conference on Space Information Technology, 598513 (4 January 2006); https://doi.org/10.1117/12.656805
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Satellites

Satellite communications

Algorithms

Computer simulations

Aerospace engineering

Iridium

Algorithm development

Back to Top