TY - GEN
T1 - A shortest path algorithm for mobile satellite communication network
AU - Tao, Zhang
AU - Jun, Zhang
AU - Kan, Liu Zhong
PY - 2005
Y1 - 2005
N2 - 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, can not 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*.
AB - 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, can not 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*.
UR - https://www.scopus.com/pages/publications/33847332533
M3 - Conference contribution
AN - SCOPUS:33847332533
SN - 0780391284
SN - 9780780391284
T3 - MAPE2005: IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications, Proceedings
SP - 1346
EP - 1350
BT - MAPE2005
T2 - MAPE2005: IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications
Y2 - 8 August 2005 through 12 August 2005
ER -