A Fast Percolation-Dijkstra SPF Method for Mega-Constellation Satellite Network Routing

Real-time routing for satellite communication of mega-constellations is a challenging task due to the large scale of network nodes, especially on devices with limited computation, such as onboard embedded systems. Hence, this paper proposes a fast-SPF method for mega-constellation backbone network r...

Full description

Saved in:
Bibliographic Details
Published inIEEE wireless communications letters p. 1
Main Authors Luan, Shenshen, Wang, Luyuan, Liu, Yepeng, Sun, Ninghan, Zhang, Ran
Format Journal Article
LanguageEnglish
Published IEEE 22.07.2024
Subjects
4-degree percolation
Approximation algorithms
Dijkstra algorithm
Low earth orbit satellites
mega-constellation routing
Orbits
Real-time systems
Routing
routing algorithm
satellite network
Satellites
Sparse matrices
Online AccessGet full text

Cover

More Information
Summary:Real-time routing for satellite communication of mega-constellations is a challenging task due to the large scale of network nodes, especially on devices with limited computation, such as onboard embedded systems. Hence, this paper proposes a fast-SPF method for mega-constellation backbone network routing. Firstly, inspired by the regularity and sparse characteristics of mega-constellations, the 4-degree percolation theory is proposed to describe the node search process. Then, dynamic minimum search and mapping methods are used to narrow down the traversal range. The proposed method performs equally well as the heap-optimized Dijkstra algorithm but with less memory space and dynamic access. The experimental results show that the proposed method can significantly reduce routing computation time, especially onboard, edge-computing, or other computation-limited devices.
ISSN:2162-2337
2162-2345
DOI:10.1109/LWC.2024.3432569