Paper
4 January 2006 A novel unicast routing algorithm for LEO satellite networks
Xuegui Song, Kai Liu, Jun Zhang, Lianzhen Cheng
Author Affiliations +
Proceedings Volume 5985, International Conference on Space Information Technology; 59851P (2006) https://doi.org/10.1117/12.657341
Event: International Conference on Space information Technology, 2005, Wuhan, China
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, n1; 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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xuegui Song, Kai Liu, Jun Zhang, and Lianzhen Cheng "A novel unicast routing algorithm for LEO satellite networks", Proc. SPIE 5985, International Conference on Space Information Technology, 59851P (4 January 2006); https://doi.org/10.1117/12.657341
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Satellites

Algorithm development

Networks

Satellite communications

Aerospace engineering

Internet

Computer simulations

RELATED CONTENT


Back to Top