Open AccessA DTN Routing Scheme for LEO Satellites Topology
Author(s) -
Yaowen Qi,
Yang Li,
ShuangJian Chen
Publication year - 2019
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/569/3/032011
Subject(s) - computer science , computer network , queuing delay , static routing , queue , equal cost multi path routing , transmission delay , network packet , overhead (engineering) , scheduling (production processes) , distributed computing , routing (electronic design automation) , queueing theory , real time computing , routing protocol , mathematical optimization , operating system , mathematics
In delay/disruption-tolerant satellite networks, the existing routing algorithms have problems of long transmission delay, high packet loss rate, excessive network overhead and other issues. In the view of these shortcomings, an improved contact graph routing algorithm, ICGR, is proposed in this paper. Firstly, the impact of queuing delay is considered by defining a queue factor and proposing a queue scheduling mechanism in routing calculation; secondly, the effects of contact’s remaining capacity are taken into account to avoid the selected path being unable to forward the messages; thirdly, routing update mechanism is optimized by designing a message path update factor to strike a balance between real-time updates of transmission and resource consumption; finally, a LEO satellite network simulation platform is built with OPNET to verify the performance of this algorithm. Simulation results show that the ICGR, compared with the ED and CGR algorithm, has advantage in packet delivery rate, average transmission delay and network overhead.