Improvement of Contact Graph Routing Algorithm in LEO Satellite DTN Network

Zhu, Hao; Zhang, Tao; Wang, Qi; Gu, Yu

doi:10.1007/978-3-030-67514-1_39

Cited by 3 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They discussed the advantages and disadvantages of DTN applications in satellite networks and concluded that DTN has higher robustness than Performance Enhancing Proxies (PEPs). Literature [29] proposes the based on throughput constrained minimum delay backup path of contact graph routing (CGR) algorithm (TCMDB_CGR) for LEO constellations characteristics by optimizing the traditional CGR algorithm, which reduces the packet loss rate and average end-to-end latency when the link bandwidth is specific. Literature [30] investigates the congestion problem in DTN for satellite networks and proposes a fragmented congestion control algorithm (FCC) that reduces the packet loss rate.…”

Section: Introductionmentioning

confidence: 99%

An Improved DTN Scheme for Large-Scale LEO Satellite Networks

Liu

Jiang

et al. 2023

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

A large-scale low Earth orbit (LEO) satellite network has the characteristics of a complex link environment, a large number of satellites, and the limited resources of a single satellite. Applying traditional routing algorithms has disadvantages such as high overhead, high end-to-end latency, and low message delivery rate. This paper proposes an improved delay tolerant (DTN) scheme for large-scale LEO satellite networks (LIDTN) to improve transmission efficiency and reduce the resource overhead and end-to-end latency of large-scale satellite networks. This scheme improves the network performance in three aspects: next hop selection, congestion control mechanism, and acknowledgment mechanism. For the next hop selection, we propose an equivalent distance and priori knowledge-based forwarding strategy (EPFS), which has the advantages of low overhead, loop avoidance, and fast convergence. For congestion control, we put forward an emergency function-based bundle drop algorithm (EBDA). For acknowledging, we propose the virtual acknowledgment algorithm (VAA) by combining the characteristics of many path hops and high link disruption rates in large-scale constellations. Finally, we simulate and verify the LIDTN scheme on the OneWeb constellation. The results show that the LIDTN scheme is suitable for large-scale constellations, the EPFS algorithm can reduce the network overhead during data transmission, EBDA can reduce the bundle drop rate, and VAA can reduce the end-to-end latency. LIDTN provides a new solution for large-scale constellation communication.

show abstract

Section: Introductionmentioning

confidence: 99%

An Improved DTN Scheme for Large-Scale LEO Satellite Networks

Liu

Jiang

et al. 2023

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…Therefore, contact graph routing (CGR) [7] was applied to the satellite network. For different problems, the authors in [8,9] designed an improved CGR routing strategy respectively. Recently, machine learning methods [10] have been studied in the routing problem of satellite networks.…”

mentioning

confidence: 99%