Study of a shortest path algorithm for mobile satellite network

Tao Zhang; Zhongkan Liu; Jun Zhang

Study of a shortest path algorithm for mobile satellite network

Tao Zhang^*
, Zhongkan Liu
, Jun Zhang

^*此作品的通讯作者

Beihang University

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

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
已对外发布	是

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{0d08af9784454bfb9ff6a8bd6416adb0,

title = "Study of a shortest path algorithm for mobile satellite network",

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.",

keywords = "Satellite network, Shortest path algorithm, Time-varying topological network",

author = "Tao Zhang and Zhongkan Liu and Jun Zhang",

year = "2006",

month = apr,

day = "20",

language = "English",

volume = "32",

pages = "29--31",

journal = "Jisuanji Gongcheng/Computer Engineering",

issn = "1000-3428",

publisher = "Shanghai Jisuanji Xuehui/Shanghai Computer Society",

number = "8",

}

TY - JOUR

T1 - Study of a shortest path algorithm for mobile satellite network

AU - Zhang, Tao

AU - Liu, Zhongkan

AU - Zhang, Jun

PY - 2006/4/20

Y1 - 2006/4/20

N2 - 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.

AB - 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.

KW - Satellite network

KW - Shortest path algorithm

KW - Time-varying topological network

UR - https://www.scopus.com/pages/publications/33646881302

M3 - Article

AN - SCOPUS:33646881302

SN - 1000-3428

VL - 32

SP - 29

EP - 31

JO - Jisuanji Gongcheng/Computer Engineering

JF - Jisuanji Gongcheng/Computer Engineering

IS - 8

ER -

Study of a shortest path algorithm for mobile satellite network

摘要

其它文件与链接

指纹

引用此