A novel unicast routing algorithm for LEO satellite networks

Xuegui Song; Kai Liu; Jun Zhang; Lianzhen Cheng

doi:10.1117/12.657341

A novel unicast routing algorithm for LEO satellite networks

Xuegui Song^*, Kai Liu, Jun Zhang, Lianzhen Cheng

^*Corresponding author for this work

Beihang University

Research output: Contribution to journal › Conference article › peer-review

Abstract

One of research challenges in low earth orbit (LEO) satellite networks is to develop specialized and efficient routing algorithms. In this paper, a dynamic source routing algorithm (DSRA) for LEO satellite networks is presented to achieve short end-to-end delay and low computation overhead under the condition that a logical location concept is adopted to hide satellite mobility. In this algorithm, the path between source and destination with minimum propagation delay is designated by source satellite in packet header by an efficient metric < D₀, n₀; D₁, n ₁; D₂, n₂ >. Then the packet is forwarded to its destination by intermediate nodes according to the metric. The performance of the algorithm is evaluated through simulation and its computation complexity is analyzed to validate algorithm efficiency.

Original language	English
Article number	59851P
Journal	Proceedings of SPIE - The International Society for Optical Engineering
Volume	5985 PART I
DOIs	https://doi.org/10.1117/12.657341
Publication status	Published - 2005
Externally published	Yes
Event	International Conference on Space Information Technology - Wuhan, China Duration: 19 Nov 2005 → 20 Nov 2005

Keywords

Dynamic source routing algorithm (DSRA)
Low earth orbit (LEO)
Satellite networks
Unicast routing

Access to Document

10.1117/12.657341

Cite this

@article{3f1381d6a2de46ff8234ceac7a7a77e1,

title = "A novel unicast routing algorithm for LEO satellite networks",

abstract = "One of research challenges in low earth orbit (LEO) satellite networks is to develop specialized and efficient routing algorithms. In this paper, a dynamic source routing algorithm (DSRA) for LEO satellite networks is presented to achieve short end-to-end delay and low computation overhead under the condition that a logical location concept is adopted to hide satellite mobility. In this algorithm, the path between source and destination with minimum propagation delay is designated by source satellite in packet header by an efficient metric < D0, n0; D1, n 1; D2, n2 >. Then the packet is forwarded to its destination by intermediate nodes according to the metric. The performance of the algorithm is evaluated through simulation and its computation complexity is analyzed to validate algorithm efficiency.",

keywords = "Dynamic source routing algorithm (DSRA), Low earth orbit (LEO), Satellite networks, Unicast routing",

author = "Xuegui Song and Kai Liu and Jun Zhang and Lianzhen Cheng",

year = "2005",

doi = "10.1117/12.657341",

language = "English",

volume = "5985 PART I",

journal = "Proceedings of SPIE - The International Society for Optical Engineering",

issn = "0277-786X",

publisher = "SPIE",

note = "International Conference on Space Information Technology ; Conference date: 19-11-2005 Through 20-11-2005",

}

TY - JOUR

T1 - A novel unicast routing algorithm for LEO satellite networks

AU - Song, Xuegui

AU - Liu, Kai

AU - Zhang, Jun

AU - Cheng, Lianzhen

PY - 2005

Y1 - 2005

N2 - One of research challenges in low earth orbit (LEO) satellite networks is to develop specialized and efficient routing algorithms. In this paper, a dynamic source routing algorithm (DSRA) for LEO satellite networks is presented to achieve short end-to-end delay and low computation overhead under the condition that a logical location concept is adopted to hide satellite mobility. In this algorithm, the path between source and destination with minimum propagation delay is designated by source satellite in packet header by an efficient metric < D0, n0; D1, n 1; D2, n2 >. Then the packet is forwarded to its destination by intermediate nodes according to the metric. The performance of the algorithm is evaluated through simulation and its computation complexity is analyzed to validate algorithm efficiency.

AB - One of research challenges in low earth orbit (LEO) satellite networks is to develop specialized and efficient routing algorithms. In this paper, a dynamic source routing algorithm (DSRA) for LEO satellite networks is presented to achieve short end-to-end delay and low computation overhead under the condition that a logical location concept is adopted to hide satellite mobility. In this algorithm, the path between source and destination with minimum propagation delay is designated by source satellite in packet header by an efficient metric < D0, n0; D1, n 1; D2, n2 >. Then the packet is forwarded to its destination by intermediate nodes according to the metric. The performance of the algorithm is evaluated through simulation and its computation complexity is analyzed to validate algorithm efficiency.

KW - Dynamic source routing algorithm (DSRA)

KW - Low earth orbit (LEO)

KW - Satellite networks

KW - Unicast routing

UR - http://www.scopus.com/inward/record.url?scp=33644526943&partnerID=8YFLogxK

U2 - 10.1117/12.657341

DO - 10.1117/12.657341

M3 - Conference article

AN - SCOPUS:33644526943

SN - 0277-786X

VL - 5985 PART I

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

M1 - 59851P

T2 - International Conference on Space Information Technology

Y2 - 19 November 2005 through 20 November 2005

ER -

A novel unicast routing algorithm for LEO satellite networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this