
A distributed low-complexity satellite-terrestrial cooperative routing approach is proposed, where each node forwards packets to the next-hop node under the constraints of minimum end-to-end hop-count and queuing delay.


coremsg

efficient-minimum-hop-count-routing-in-mega-leo-satellite-constellations-with-satellite-terrestrial-cooperation


Efficient Minimum Hop-Count Routing in Mega LEO Satellite Constellations with Satellite-Terrestrial Cooperation


title_rewrite


A fast routing method is proposed for mega-constellation backbone networks, leveraging the regularity and sparsity characteristics of the network topology to significantly reduce routing computation time, especially on computation-limited devices.


efficient-routing-algorithm-for-mega-constellation-backbone-networks


Efficient Routing Algorithm for Mega-Constellation Backbone Networks
