Datagram Routing Algorithm for LEO Satellite Networks
نویسندگان
چکیده
Abstmct Satellite networks provide global coverage and support a wide range of services. Low Earth Orbit (LEO) satellites provide short round trip delays and are becoming increasingly important. One of the challenges in LEO satellite networks is the development of specialized and efflcient routing algorithms. In this work, a datagram routing algorithm for LEO satellite networks is introduced. The algorithm generates minimum propagation delay paths. The performance of the algorithm is evaluated through simulations and finally robustness issues are discussed.
منابع مشابه
A Dynamic On-demand Multipath Routing Algorithm for Low Earth Orbit Satellite Networks
Compared with Geostationary Orbit (GEO) satellite systems and Medium Earth Orbit (MEO) satellite systems, Low Earth Orbit (LEO) satellite systems provide lower propagation delay as well as higher throughput. Because of these reasons, LEO satellite systems can play a pivotal role in providing services to areas where there is no substantial terrestrial infrastructure. In this paper, a novel kind ...
متن کاملPerformance Comparison of Optimal Routing and Dynamic Routing on Low-earth Orbit Satellite Networks
We compare the performances of two diierent routing schemes for LEO satellite networks through simulation. The rst one is a dynamic routing scheme based on the shortest-path algorithm. Its routing table is updated according to cost estimation based on link status information that is broadcasted periodically. The second one is an optimal routing scheme proposed by the authors of this paper, wher...
متن کاملTopological Design and Routing for Leo Satellite Networks
We investigate a topological design and routing problem for Low-Earth Orbit (LEO) satellite communication networks where each satellite can have a limited number of direct inter-satellite links (ISL's) to a subset of satellites within its line-of-sight. First, we model LEO satellite network as a FSA (Finite State Automaton) using satellite constellation information. Second, we solve a combined ...
متن کاملPriority-based Adaptive Shortest Path Routing for IP over LEO Satellite Networks
Designing an efficient routing algorithm for LEO satellite constellations is crucial for optimizing IP over Satellite (IPoS) network resources. Since there could be many shortest paths between two satellites, an efficient routing algorithm should provide better utilization of these paths. For this purpose, we propose a Priority-based Adaptive Routing (PAR) technique, which distributedly sets th...
متن کاملA predictive QoS routing scheme for broadband low Earth orbit satellite networks
Low Earth Orbit Satellite Networks can augment terrestrial wireless networks to provide global broadband services to users regardless of the users’ locations. Delivering QoS guarantees to the users of LEO satellite networks is complicated since footprints of LEO satellites move as the satellites traverse their orbits, and thus, causing frequent user handovers between the satellites. Traffic on ...
متن کامل