Distributed On-Demand Routing for LEO Mega-Constellations: A Starlink Case Study - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Distributed On-Demand Routing for LEO Mega-Constellations: A Starlink Case Study

Résumé

The design and launch of large-scale satellite networks create an imminent demand for efficient and delayminimising routing methods. With the rising number of satellites in such constellations, pre-computing all shortest routes between all satellites and for all times becomes more and more infeasible due to space and time limitations. Even though distributed on-demand routing methods were developed for specific LEO satellite network configurations, they are not suited for increasingly popular megaconstellations based on Walker Delta formations. The contributions of this paper are twofold. First, we introduce a formal model that mathematically captures the time-evolving locations of satellites in a Walker Delta constellation and use it to establish a formula to compute the minimum number of ISL hops between two given satellites. In the second part, we present an on-demand hop-count-based routing algorithm that approximates the optimal path while achieving superior performance compared to classical shortest-path algorithms like Dijkstra.
Fichier principal
Vignette du fichier
paper-asms.pdf (722.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03827298 , version 1 (24-10-2022)

Identifiants

Citer

Gregory Stock, Juan Andrés A Fraire, Holger Hermanns. Distributed On-Demand Routing for LEO Mega-Constellations: A Starlink Case Study. ASMS/SPSC 2022 - 11th Advanced Satellite Multimedia Systems Conference and the 17th Signal Processing for Space Communications Workshop, Sep 2022, Graz, Austria. pp.1-8, ⟨10.1109/ASMS/SPSC55670.2022.9914716⟩. ⟨hal-03827298⟩
36 Consultations
229 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More