Routing Algorithms for VLEO Constellations
Nicolo' Benso
Routing Algorithms for VLEO Constellations.
Rel. Roberto Garello, Juan Andres Fraire, Alessandro Compagnoni. Politecnico di Torino, Corso di laurea magistrale in Communications Engineering, 2025
|
Preview |
PDF (Tesi_di_laurea)
- Tesi
Licenza: Creative Commons Attribution Non-commercial No Derivatives. Download (4MB) | Preview |
Abstract
Very Low Earth Orbit (VLEO) satellite constellations are gaining attention for enabling low-latency, high-throughput non-terrestrial networks and high-resolution Earth observation. Operating at 300–500 km, they offer reduced propagation delays and stronger signals but also face challenges such as increased atmospheric drag, limited satellite lifespans, high Doppler shifts, and fast-changing topologies that complicate routing. Efficient routing is critical in these dynamic environments. DisCoRoute, a recently proposed heuristic, has shown strong performance under such conditions. This work builds on it, with two primary objectives. The first was to assess its performance under time-varying conditions. Starting from an existing MATLAB implementation, the code was adapted to reflect the dynamic positions of satellites over time.
The analysis showed that latency between a fixed source and destination varies over time due to orbital geometry or route changes
Tipo di pubblicazione
URI
![]() |
Modifica (riservato agli operatori) |
