DocumentCode :
2595412
Title :
Routing Space Internet Based on Dijkstra´s Algorithm
Author :
Li, Xiang-Ying ; Li, Guo-Shun ; Zhang, Sheng-Tian
Author_Institution :
Center for Space Sci. & Appl. Res., Chinese Acad. of Sci., Beijing, China
Volume :
2
fYear :
2010
fDate :
24-25 April 2010
Firstpage :
118
Lastpage :
121
Abstract :
Earth observation data will be moved through satellite constellations to ground stations by space internet. Routing observation traffic in this environment is constrained by factors such as satellite orbits, satellite capabilities, observation schedules, ground station schedules, and rapidly evolving natural events. Among many global routing algorithms, Dijkstra Algorithm is mostly preferred as it is faster as compared to any other algorithm and its implementation is easier. For this reason, this paper implements a routing algorithm of Dijkstra for space networks under constraints mentioned above.
Keywords :
Internet; artificial satellites; satellite ground stations; search problems; telecommunication network routing; telecommunication network topology; telecommunication traffic; Dijkstra routing algorithm; Earth observation data; ground station schedules; satellite constellations; satellite orbits; space Internet routing; space networks; traffic routing; Artificial satellites; Communication channels; Communication system traffic control; IP networks; Internet; Orbits; Routing; Satellite broadcasting; Satellite ground stations; Space stations; internet; networking topology; routing algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networks Security Wireless Communications and Trusted Computing (NSWCTC), 2010 Second International Conference on
Conference_Location :
Wuhan, Hubei
Print_ISBN :
978-0-7695-4011-5
Electronic_ISBN :
978-1-4244-6598-9
Type :
conf
DOI :
10.1109/NSWCTC.2010.163
Filename :
5480671
Link To Document :
بازگشت