Research Article
Improvement of Contact Graph Routing Algorithm in LEO Satellite DTN Network
@INPROCEEDINGS{10.1007/978-3-030-67514-1_39, author={Huijuan Zhu and Tao Zhang and Qi Wang and Yanan Gu}, title={Improvement of Contact Graph Routing Algorithm in LEO Satellite DTN Network}, proceedings={IoT as a Service. 6th EAI International Conference, IoTaaS 2020, Xi’an, China, November 19--20, 2020, Proceedings}, proceedings_a={IOTAAS}, year={2021}, month={1}, keywords={LEO satellite network DTN Contact Graph Routing}, doi={10.1007/978-3-030-67514-1_39} }- Huijuan Zhu
Tao Zhang
Qi Wang
Yanan Gu
Year: 2021
Improvement of Contact Graph Routing Algorithm in LEO Satellite DTN Network
IOTAAS
Springer
DOI: 10.1007/978-3-030-67514-1_39
Abstract
As a space network technology, DTN (Delay/Disruption Tolerant Networks) has a wide range of applications in space system networking, and the application of DTN in LEO (Low Earth Orbit) satellite network is also a hot topic. Aiming at the problem of DTN routing technology in LEO satellite network, this paper proposes a routing algorithm for LEO satellite DTN network, which is based on throughput constrained minimum delay backup path of CGR (Contact Graph Routing) algorithm. By comparing the existing routing algorithms, this paper summarizes the problems existing in the application of existing routing algorithms in LEO satellite DTN network, proposes to calculate the shortest delay path of the whole network under the condition of throughput constraints, and select the best transmission path and backup path for data transmission. It solves the problems that the increase of queuing delay caused by the rapid change of network topology, the limited transmission capacity caused by single path transmission, and the active avoidance of node congestion. The simulation results show that compared with the traditional CGR algorithm and ECGR algorithm, the algorithm proposed in this paper is better in average delay and loss packet rate, and more suitable for LEO satellite DTN network.
