Close category search window
 

Routing space Internet based on Dijkstra's algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiang-ying Li ; Center for Space Sci. & Appl. Res., Chinese Acad. of Sci. Beijing 100190, Beijing, China ; Guo-shun Li ; Sheng-tian Zhang

Space based Internets will be used to move earth observation data through satellite constellations to ground based receiving stations. Routing observation traffic in this environment is constrained by individual satellite orbits, individual 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 based Internets under constraints mentioned above.

Published in:
Internet, 2009. AH-ICI 2009. First Asian Himalayas International Conference on

Date of Conference: 3-5 Nov. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.