2013
DOI: 10.1109/cc.2013.6650316
|View full text |Cite
|
Sign up to set email alerts
|

From the far side of the Moon: Delay/disruption-tolerant networking communications via lunar satellites

Abstract: Delay/Disruption-Tolerant Networking (DTN) originated from research on Interplanetary Internet and still today space applications are the most important application field and research stimulus. This paper investigates DTN communications between the Earth and the far side of the Moon, by means of a lunar orbiter acting as relay. After an introductory part, the paper presents a comprehensive analysis of the DTN performance that can be achieved on the identified communication scenario. The focus is on the evaluat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 14 publications
(33 reference statements)
0
1
0
Order By: Relevance
“…Contact Graph Routing [9] [119] [118] is a dynamic algorithm that computes routes through a time-varying topology of scheduled communication contacts in a DTN network. It can be successfully applied in different SSI environments, including deep-space communications [120], lunar communications [121], and LEO satellite communications [122], and in general it covers the majority of cases where link availability is known a priori, outperforming routing algorithms designed for terrestrial DTNs [123]. The applicability of CGR in space networks in general has been also proven with results from real experimental experiences [118], including the DINET experiment (employing the EPOXI space cruise) [46], the Japan Aerospace Exploration Agency (JAXA)-NASA joint experiments with JAXA's GEO relay satellite called Data Relay Test Satellite (DRTS) [124], the Space Data Routers European Project [24] [125], and the pilot operation of a DTN implementation on the ISS [48] [49].…”
Section: Contact Graph Routingmentioning
confidence: 99%
“…Contact Graph Routing [9] [119] [118] is a dynamic algorithm that computes routes through a time-varying topology of scheduled communication contacts in a DTN network. It can be successfully applied in different SSI environments, including deep-space communications [120], lunar communications [121], and LEO satellite communications [122], and in general it covers the majority of cases where link availability is known a priori, outperforming routing algorithms designed for terrestrial DTNs [123]. The applicability of CGR in space networks in general has been also proven with results from real experimental experiences [118], including the DINET experiment (employing the EPOXI space cruise) [46], the Japan Aerospace Exploration Agency (JAXA)-NASA joint experiments with JAXA's GEO relay satellite called Data Relay Test Satellite (DRTS) [124], the Space Data Routers European Project [24] [125], and the pilot operation of a DTN implementation on the ISS [48] [49].…”
Section: Contact Graph Routingmentioning
confidence: 99%