Abstract
Mobile satellite network is a special time-varying network. The shortest path problem of it is different from those of other networks. 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.
| Original language | English |
|---|---|
| Pages (from-to) | 29-31 |
| Number of pages | 3 |
| Journal | Jisuanji Gongcheng/Computer Engineering |
| Volume | 32 |
| Issue number | 8 |
| Publication status | Published - 20 Apr 2006 |
| Externally published | Yes |
Keywords
- Satellite network
- Shortest path algorithm
- Time-varying topological network
Fingerprint
Dive into the research topics of 'Study of a shortest path algorithm for mobile satellite network'. Together they form a unique fingerprint.Cite this
Zhang, T., Liu, Z., & Zhang, J. (2006). Study of a shortest path algorithm for mobile satellite network. Jisuanji Gongcheng/Computer Engineering, 32(8), 29-31.