摘要
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.
| 源语言 | 英语 |
|---|---|
| 页（从-至） | 29-31 |
| 页数 | 3 |
| 期刊 | Jisuanji Gongcheng/Computer Engineering |
| 卷 | 32 |
| 期 | 8 |
| 出版状态 | 已出版 - 20 4月 2006 |
| 已对外发布 | 是 |
指纹
探究 'Study of a shortest path algorithm for mobile satellite network' 的科研主题。它们共同构成独一无二的指纹。引用此
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.