A Disruption Tolerant Distributed Routing Algorithm in LEO Satellite Networks

Abstract

The low earth orbit (LEO) constellation network has become a promising approach to provide global communication services, due to its advantages in wide global coverage, low transmission delay, and convenient networking. However, the instability of the intersatellite laser terminal and the high relative speed between adjacent satellites cause frequent network topology changing problems for data routing. In this paper, a disruption tolerant distributed routing algorithm (DTDR) is proposed, where the satellites calculate the alternate path for transmission when the network topology changes, which improves the performance of packet loss. Specifically, each satellite maintains the intersatellite link (ISL) information within a specified number of hops. When an ISL state changes within the specified number of hops, the corresponding satellite calculates and switches to the detour path. Furthermore, the traffic is balanced through the detour process. Various simulations were constructed and show that the proposed algorithm outperforms the existing algorithm in terms of packet loss ratio and transmission delay.

A distributed on-demand routing algorithm for large-scale low Earth orbit constellation

“…This algorithm enables each packet to independently determine its routing path, mitigating the impact of satellite motion on optimal path selection. In [7], Jin proposed a disruption tolerant distributed routing algorithm that improves the performance of packet loss by using satellites to calculate the alternate paths. Each satellite records the intersatellite link information within a specified number of hops, and switches to the detour path when the number of hops changes.…”

A Local Pre-Rerouting Algorithm to Combat Sun Outage for Inter-Satellite Links in Low Earth Orbit Satellite Networks

“…These algorithms are suitable to solve the problem of real-time link load jitter or link failure, avoid sudden traffic causing link overload and packet loss and have a fast response speed, but they can only achieve local load balancing. Routing loops and cascading congestion are easily formed in network environments with high loads [7]. In contrast, LPRA does not use a hop-by-hop approach for load balancing.…”

“…where latA represents the latitude of satellite A and latB represents the latitude of satellite B. If satellites A and B are located in the southern or northern hemisphere at the same time, |latA − latB|= φ ; if satellites A and B are located in different hemispheres, |latA|+|latB|= φ [7].…”

“…The virtual topology strategy [6] is suitable for complex network structures and changing network topologies. The network topology is stored in slices in each satellite, which avoids a large amount of routing information interaction and routing calculations, but it also requires satellites to have certain storage capabilities [7]. The virtual node strategy [8] takes advantage of the periodicity of topology changes and avoids the need for storage, but it is only applicable to polar-orbit LEO constellations and requires high regularity in the satellite network topology.…”

Thermal Deformation Stability Optimization Design and Experiment of the Satellite Bus to Control the Laser Communication Load’s Acquisition Time

“…The effective communication duration can be increased by shortening each chain's building time, increasing the overall working efficiency of the communication satellite [10,20]. Topology optimization can increase the effectiveness of link establishment over the entire constellation after the communication satellite has finished networking [21]. Reduced connection establishment times are crucial since this constellation's topology optimization method necessitates frequent link switching.…”