Ninghan Sun
Ninghan Sun has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Luyuan Wang
University of Science and Technology of China, Hefei 230026, China
1 shared publication - Ran Zhang
Beijing University of Posts and Telecommunications
1 shared publication - Shenshen Luan
School of Electronic and Information Engineering, Beihang University, Beijing, China
1 shared publication - Yepeng Liu1 shared publication
Latest Publications
- Open Access
A Fast Percolation-Dijkstra Routing Method for Mega-Constellation Backbone Network
The real-time routing for satellite communication of the mega-constellations is being challenged due to the large-scale of network nodes, especially on devices with limited computation such as onboard embedded systems. In this paper, a fast routing method is proposed for mega-constellation backbone networks. 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 as well as the heap-optimized Dijkstra algorithm with less memory space and dynamic access. The experimental results show that the method proposed in this paper can significantly reduce routing computation time, especially on the onboard, edge-computing or other computation-limited devices.
Open AccessA Fast Percolation-Dijkstra Routing Method for Mega-Constellation Backbone Network
The real-time routing for satellite communication of the mega-constellations is being challenged due to the large-scale of network nodes, especially on devices with limited computation such as onboard embedded systems. In this paper, a fast routing method is proposed for mega-constellation backbone networks. 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 as well as the heap-optimized Dijkstra algorithm with less memory space and dynamic access. The experimental results show that the method proposed in this paper can significantly reduce routing computation time, especially on the onboard, edge-computing or other computation-limited devices.