Contingent Routing Using Orbital Geometry in Proliferated Low-Earth-Orbit Satellite Networks

• Published in: MILCOM 2022 - 2022 IEEE Military Communications Conference (MILCOM) pp. 404 - 411
• Main Authors: Shake, Thomas, Sun, Jun, Royster, Thomas, Narula-Tam, Aradhana
• Format: Conference Proceeding
• Language: English
• Published: IEEE 28-11-2022
• Subjects: Adaptive systems; Distributed databases; Geometry; Low earth orbit satellites; Routing; Satellite constellations; Satellites
• ISSN: 2155-7586
• DOI: 10.1109/MILCOM55135.2022.10017898

Optimum adaptive routing in proliferated low-earth-orbit (pLEO) satellite networks requires intensive computation. The very small size, light weight, and low power of individual satellites in such networks makes a centralized, terrestrial, SDN-like approach to routing computation an attractive solution. However, it is highly desirable to have a distributed backup routing capability onboard each satellite that can maintain service if the central computational node(s) fail or lose their pathway(s) to upload routing data frequently to each satellite. This paper presents a routing algorithm based on orbital geometry that has a very low computation and storage requirements and is suitable as a backup routing capability in the event of failure of a centralized routing calculation node or nodes. Path failure rate, path latency, and link resource usage are simulated for a 360-satellite Walker Delta constellation with 4 inter-satellite-link (ISL) terminals per satellite, and with up to 10% of the satellites having failed. For the fully intact satellite constellation, path failure rate is zero (identical to a shortest path routing algorithm), while mean latency and average link resource usage are shown to be approximately 12% and 13% higher, respectively, than with shortest path routing. With 10 random satellite failures in the constellation, the geometric algorithm has a path failure rate of less than 0.5%, while the mean latency and link resource usage are approximately 12% and 16% higher, respectively, than with shortest path routing. 1 1 DISTRIBUTION STATEMENT A. Approved for public release. Distribution is unlimited. This material is based upon work supported by the Defense Advanced Research Projects Agency under Air Force Contract No. FA8702-15-D-000l. The views, opinions and/or findings expressed are those of the authors and should not be interpreted as representing the official views or policies of the Department of Defense or the U.S. Government.