2012 IEEE Vehicular Technology Conference (VTC Fall) 2012
DOI: 10.1109/vtcfall.2012.6399087
|View full text |Cite
|
Sign up to set email alerts
|

A DTN Routing Scheme for Quasi-Deterministic Networks with Application to LEO Satellites Topology

Abstract: 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 without the knowledge of the topology and with a delivery ratio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…The best-case arrival time C.arr time (cost) for transmission of a bundle during contact C is then computed (lines [12][13][14][15][16]. C.arr time is initialized to the start time of C or the arrival time of the current contact C curr , whichever is later.…”
Section: A Contact Graph Dijkstra Searchmentioning
confidence: 99%
See 1 more Smart Citation
“…The best-case arrival time C.arr time (cost) for transmission of a bundle during contact C is then computed (lines [12][13][14][15][16]. C.arr time is initialized to the start time of C or the arrival time of the current contact C curr , whichever is later.…”
Section: A Contact Graph Dijkstra Searchmentioning
confidence: 99%
“…The consideration of the time dimension is an aspect that challenges any underlying routing algorithm. Fortunately, in space networks it is possible to know the future connectivity of the assets [13], which may be expressed in a contact plan defining the expected resources that the space network will have for transporting data. These conditions inspired the creation of new graph models, time-evolving abstractions, and algorithm adaptations of the Contact Graph Routing (CGR) framework.…”
Section: Introductionmentioning
confidence: 99%
“…This paper can be considered as an extension of the study presented in in which some key ideas are established. However, we present here deeper analysis and some new ideas about both the topology used and the algorithm developed.…”
Section: Introductionmentioning
confidence: 99%
“…Other works evaluate either ISN [2]- [4] , or reliability analysis in spacecraft [5]- [8], in some detail, but do not offer insights into the link between these phenomena. This work aims to overcome this omission and consider a realistic anomaly probability and the effectiveness of ISN to overcome the associated loss in value.…”
Section: Introductionmentioning
confidence: 99%