Abstract
Mega-constellations consisting of hundreds to thousands of low-earth-orbit (LEO) satellites are an attractive solution for providing global ubiquitous network access. Due to good coverage properties for populated areas, inclined orbits are gaining popularity among commercial constellations. A scalable routing algorithm with survivability plays a key role in such systems. In this paper, we propose a distributed survivable routing algorithm for mega-constellations with inclined orbits. First, the special topology characteristic of inclined constellations is identified and formalized. Based on the topology characterization, a basic X-Y routing algorithm is presented to determine multiple primary and secondary paths towards each destination utilizing the regularity of the network topology with minimal computation overhead. Then, a failure recovery mechanism which consists of a restricted flooding mechanism and a pre-detour mechanism is proposed to reduce end-to-end delay and signaling overhead in case of link failures. Besides, a partial-record loop avoidance mechanism is proposed to deal with routing loops with minimal overhead. Finally, a vector-based next hop selection mechanism is proposed to facilitate the selection of next hop while incorporating various criteria. The performance of the proposed routing algorithm is evaluated through simulation on the Starlink constellation. Simulation results show that our proposal achieves scalability by reducing signaling overhead and provides better quality of service in terms of end-to-end delay under link failures.
Highlights
With the reduction of cost for manufacturing and launching satellites, low-earth-orbit (LEO) satellite constellations are regaining popularity from industry and the era of so called Internet of satellites is coming
With fttl = 5, the end-to-end delay is reduced by 15.5% compared with local distributed algorithm under 20% link failure
In this paper, a distributed survivable routing algorithm is proposed for mega-constellations with inclined orbits
Summary
With the reduction of cost for manufacturing and launching satellites, low-earth-orbit (LEO) satellite constellations are regaining popularity from industry and the era of so called Internet of satellites is coming. Many routing algorithms have been proposed for LEO satellite networks, they may face scalability problem when applied to mega-constellations. A distributed routing algorithm which utilizes the predictability and regularity of the network topology is preferred for a mega-constellation. Previous work on routing algorithms in LEO networks is mainly focused on polar constellations whereas inclined constellations receive less attention. We propose a distributed survivable routing algorithm for mega-constellations with inclined orbits. (1) The spiral shape formed by inter-plane ISLs in inclined constellations is identified and formalized Based on this topology characteristic, a basic X-Y routing algorithm is proposed for inclined constellations. Simulation results demonstrate the ability of the proposed routing algorithm to reduce signaling overhead and reduce end-to-end delay in case of link failures.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
