Routing for predictable Multi-Layered Satellite Networks
- 217 Downloads
Multi-Layered Satellite Network (MLSN), especially LEO/MEO satellite network, consisting of low and medium earth orbit satellites, is capable of providing higher coverage and better service than single-layered one. Its performance in deployment, however, is mainly encumbered by obsolete routing protocols and algorithms. This paper takes the predictability of satellite movements into consideration, based on which a novel routing protocol Predictable Satellite Network Routing Protocol (PSNRP)—is proposed. In this protocol, every topology change due to satellite movement is either described as a predictable or an unpredictable change. On the basis of PSNRP, we import a heuristic routing algorithm for satisfying Quality-of-Service (QoS) requirements from network users, which is convinced as a Non-deterministic Polynomial Complete problem. The QoS requirements in this paper mainly refer to end-to-end delay, bandwidth and package loss rate. In addition to obtaining better routing performance, PSNRP successfully allocates calculation tasks evenly among all nodes, separates user data from protocol control data and achieves stronger robustness against satellite failures and link congestions. The superiority of our routing scheme is proved by simulation results.
KeywordsMulti-Layered Satellite Nework LEO/MEO routing predictable heuristic Quality-of-Service robustness
Unable to display preview. Download preview PDF.
- 1.Elbert B R. The satellite communication application handbook. Norwood: Artech House, 2004Google Scholar
- 6.Hashimoto Y, Sarikaya B. Design of IP-based Routing in a LEO Satellite Network. In: Proceedings of Third International Workshop on Satellite-Based Information Services, Dallas, 1998. 81–88Google Scholar
- 7.Ekici E, Akyildiz I F, Bender M D. Datagram routing algorithmfor LEO satellite networks. In: Proceedings of IEEE Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), IEEE, 2000. 2: 500–508Google Scholar
- 9.Reeves C R. Modern heuristic techniques for combitiorial problems. Oxford: Blackwell Scientific Publications, 1993Google Scholar
- 10.Long F. Research on Satellite Network Robust QoS-aware Routing. Dissertation for Ph.D. Degree, Beijing: Tsinghua University, 2010Google Scholar
- 11.Fischer D, Basin D, Engel T. Topology Dynamics and Routing for Predictable Mobile Networks. In: Proceedings of IEEE International Conference on Network Protocols, IEEE, 2008. 207–217Google Scholar
- 15.Lu Y, Zhao Y J, Sun F C, et al. Dynamic fault-tolerant routing based on FSA for LEO satellite networks. IEEE Trans Comput, 2013, 62: 1495–1958Google Scholar
- 16.North J, Hoskin M. The Fontana history of astronomy and cosmology. Journal for the History of Astronomy, 1995, 26: 83Google Scholar
- 18.Moy J. OSPF protocol analysis. RFC 1245, 1991Google Scholar
- 19.Atmel Cooperation. TSC695F SPARC 32-bit Space Processor: User Manual, 2003Google Scholar
- 21.Karaboga D, Gorkemli B, Ozturk C, et al. A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev, 2012: 1–37Google Scholar