DTN routing for quasi‐deterministic networks with application to LEO constellations. (22nd October 2015)

• Record Type: Journal Article
• Authors: Diana, R.; Lochin, E.; Franck, L.; Baudoin, C.; Dubois, E.; Gelard, P.
• Is Part Of: International journal of satellite communications and networking. Volume 35:Number 2(2017:Mar./Apr.)
• Page Start: 91
• Page End: 108
• Publication Date: 2015-10-22
• Subjects: DTN -- DTN routing -- satellite constellations -- quasi‐deterministic networks; Artificial satellites in telecommunication -- Periodicals; Digital communications -- Periodicals; 621.3825
• DOI: 10.1002/sat.1159
• Languages: English
• ISSNs: 1542-0973

Abstract

Summary: We propose a novel DTN routing algorithm, called DQN, specifically designed for quasi‐deterministic networks with an application to satellite constellations. We demonstrate that our proposal efficiently forwards the information over a satellite network derived from the Orbcomm topology while keeping a low replication overhead. We compare our algorithm against other well‐known DTN routing schemes and show that we obtain the lowest replication ratio with a delivery ratio of the same order of magnitude than a reference theoretical optimal routing. We also analyze the impact of terrestrial gateways density and analyze DQN performances in heterogeneous cases. Copyright © 2015 John Wiley & Sons, Ltd. Abstract : This article proposes a DTN routing algorithm, called DQN, specifically designed for quasi‐deterministic networks such as satellite constellations. DQN efficiently forwards the information over a satellite network while keeping a low replication overhead. DQN is compared against other well‐known DTN routing schemes and provides the lowest replication ratio with a delivery ratio of the same order of magnitude than a reference theoretical optimal routing.