Abstract
A novel distributed packet routing algorithm for Low Earth Orbit (LEO) satellite networks based on spiderweb topology is presented. The algorithm gives the shortest path with very low computational complexity and without on-board routing tables, which is suitable and practical for on-board processing. Simulation results show its practicability and feasibility.
This is a preview of subscription content, log in via an institution to check access.
References
Eylem Ekici, Ian F. Akyildiz, et al., A distributed routing algorithm for datagram traffic in LEO satellite networks, IEEE/ACM Trans. on Networking, 9(2001)2, 137–147.
L. Wood, A. Clerget, et al., IP routing issues in satellite constellation networks, Int. J. Satellite Commun., 19(2001)1, 69–92.
N. Maxemchuk, Routing in the Manhattan street network, IEEE Trans. on Communications, 35(1987)5, 503–512.
J. G. Walker, Satellite constellations, Journal of the British Interplanetary Society, 37(1984)12, 559–572.
Author information
Authors and Affiliations
Additional information
Communication author: Wang Kaidong, born in 1972, male, Ph.D. student. State Key Lab of Integrated Service Networks, Xidian University, Xi’an 710071, China.
About this article
Cite this article
Wang, K., Tian, B. & Yi, K. Packet routing algorithm for LEO satellite constellation network. J. of Electron.(China) 22, 77–84 (2005). https://doi.org/10.1007/BF02687955
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02687955