Scalable routing in low-Earth orbit satellite constellations: Architecture and algorithms

Zhang, Shengyu; Yeung, Kwan L.

doi:10.1016/j.comcom.2022.02.015

Cited by 8 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In LEO satellite networks, since the topology is time-varying, temporal graph-based models are adopted to generate several discrete snapshots, then the SDP is solved in each snapshot. Every node independently runs the graph-based algorithm to determine the SDP to every destination [14].…”

Section: Related Workmentioning

confidence: 99%

“…The Dijkstra algorithm is a generic and valid approach to obtain the optimal path in LEO satellite networks. Zhang et al [14] run OSPF protocol which exploits Dijkstra to calculate the minimum hop-count between node pairs in integrated satellite and terrestrial Networks. In the hybrid multi-layered network [13], each MEO satellite uses Dijkstra algorithm to obtain the optimal routing table for each LEO satellite cluster.…”

Section: Related Workmentioning

confidence: 99%

“…Also, the computational complexity increases greatly with the network scale, which may cause extra costs in mega-constellation networks [12], [13], e.g., Starlink, Kuiper, etc. This will result in large storage space requirements, long execution time of graph-based iterations and slow table lookup [14]. Therefore, an explicit and analytic algorithm to solve the SDP could provide more insights with fewer computations, and can be potentially integrated into a distributed routing protocol.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Shortest Path in LEO Satellite Constellation Networks: An Explicit Analytic Approach

Chen,

Yang,

Zhao

et al. 2024

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

The Shortest Distance Path (SDP) problem is a critical routing issue in communication networks, particularly in satellite networks. Typically, SDP is solved by graph-based iterative algorithms, while an explicit or analytic approach is challenging. However, considering the orbit dynamics and topology regularity, this paper proposes, for the first time, an explicit analytic phase-based algorithm STEPCLIMB to directly solve the SDP in low-Earth orbit (LEO) satellite networks. Based on the relationship between satellite phase and inter-satellite link distance, the SDP is modeled with the satellite phase, and SDP problem is converted into a total phase offset problem through theoretical derivations. Then STEPCLIMB is derived in two cases, respectively. Monte-Carlo simulations verify STEPCLIMB's accuracy, which has zero error in the mono-valley case and has less than 0.1% error in the bi-valley case. The algorithm performs better in larger-scale constellations and can save over 99.4% computational cost compared to Dijkstra algorithm. Further, the SDP pattern and features in Starlink constellation are analyzed. The model proves that most inter-plane hops in the SDP occur successively, and the simulations further indicate that these hops prefer satellites in the higher latitude regions.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Shortest Path in LEO Satellite Constellation Networks: An Explicit Analytic Approach

Chen,

Yang,

Zhao

et al. 2024

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…SVNs have brought about great challenges for organizing and managing the wireless communication systems [4], [18]. For a Low Earth Orbit (LEO) satellite, it can travel at typical speeds as high as 7.56 km/s.…”

Section: Introductionmentioning

confidence: 99%

Rate-Splitting Multiple Access-Based Satellite–Vehicular Communication System: A Noncooperative Game Theoretical Approach

Zhang

Yuan

et al. 2023

IEEE Open J. Commun. Soc.

Self Cite

View full text Add to dashboard Cite

Rate-Splitting Multiple Access (RSMA) has recently found favor in high-mobility scenarios due to the benefits of relaxing the accuracy of Channel State Information at the Transmitter (CSIT) while maintaining high spectral efficiency. These benefits are particularly important in Satellite-Vehicular Networks (SVNs), where the mobility of the vehicles significantly affects the estimation accuracy of the CSIT. To tackle this challenge, we propose an RSMA-based satellite-vehicular communication system for reliable data transmission. Specifically, we investigate the outage probability of the RSMA-based satellite-vehicular communication system under the Shadowed-Rician model. Considering the satellitevehicular communication outage problem, an optimization problem is formulated to maximize the Weighted Sum Rate (WSR) of the communication system. However, due to communication overhead and privacy concerns, not all vehicles are willing to participate in interference management. In this study, we exploit an incentive mechanism to efficiently solve this problem. Specifically, we formulated a non-cooperative game to motivate users to report the CSIT and participate in the power allocation. In addition, we have proved the existence and uniqueness of Nash Equilibrium (NE) in the game formulated. Our simulation results show that the proposed non-cooperative game theoretical approach achieves the effectiveness of the RSMA-based satellite-vehicular system. The game theoretical framework is shown to motivate users to participate in interference management, so as to maximize their transmission rates.

show abstract

“…But the heap operation and complex data structures increase computational costs. Zhang et al [8] proposed using Dijkstra to calculate the minimum hop routing in satellite and ground integrated networks in the architecture of large-scale network routing algorithms. For multi-layer networks, Ma et.al.…”

Section: Introductionmentioning

confidence: 99%

Perfect Hash-Based Routing Lookup for LEO Constellation Backbone Network

Zhang

Tang

et al. 2023

IEEE Trans. Aerosp. Electron. Syst.

View full text Add to dashboard Cite

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.

show abstract

Scalable routing in low-Earth orbit satellite constellations: Architecture and algorithms

Cited by 8 publications

References 18 publications

Shortest Path in LEO Satellite Constellation Networks: An Explicit Analytic Approach

Shortest Path in LEO Satellite Constellation Networks: An Explicit Analytic Approach

Rate-Splitting Multiple Access-Based Satellite–Vehicular Communication System: A Noncooperative Game Theoretical Approach

Perfect Hash-Based Routing Lookup for LEO Constellation Backbone Network

Contact Info

Product

Resources

About