Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations

Fraire, Juan A.; Madoery, Pablo G.; Burleigh, Scott; Feldmann, Marius; Finochietto, Jorge M.; Charif, Amir; Zergainoh, Nacer-Eddine; Velazco, Raoul

doi:10.1155/2017/2830542

Cited by 33 publications

(18 citation statements)

References 54 publications

(109 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are papers in the state of the art whose purpose is to prove the reliability of CGR in LEO satellite networks, such as Caini and Firrincieli . The analysis reported in Fraire et al shows that the current version of CGR is not suitable to make an optimal utilization of communication resources, extremely valuable for CubeSats. Further efforts have to be performed on this topic.…”

Section: Future Challengesmentioning

confidence: 99%

Small satellites and CubeSats: Survey of structures, architectures, and protocols

Davoli

Kourogiorgas

Marchese

et al. 2018

Satell Commun Network

View full text Add to dashboard Cite

Summary The space environment is still challenging but is becoming more and more attractive for an increasing number of entities. In the second half of the 20th century, a huge amount of funds was required to build satellites and gain access to space. Nowadays, it is no longer so. The advancement of technologies allows producing very small hardware components able to survive the strict conditions of the outer space. Consequently, small satellites can be designed for a wide set of missions keeping low design times, production costs, and deployment costs. One widely used type of small satellite is the CubeSat, whose different aspects are surveyed in the following: mission goals, hardware subsystems and components, possible network topologies, channel models, and suitable communication protocols. We also show some future challenges related to the employment of CubeSat networks.

show abstract

Section: Future Challengesmentioning

confidence: 99%

Small satellites and CubeSats: Survey of structures, architectures, and protocols

Davoli

Kourogiorgas

Marchese

et al. 2018

Satell Commun Network

View full text Add to dashboard Cite

show abstract

“…This section discusses this non-evident matter with significant impact on the final network performance and calculation effort. The only related previous work is the CGR reference implementation [10] in ION 3.6 (henceforth refereed as current CGR ), which executes several Dijkstra's searches in order to populate a route list with all paths in a contact graph [18] . Indeed, such table is considered static throughout the duration of the contact plan.…”

Section: Route Table Computationmentioning

confidence: 99%

“…Indeed, if suppressing C 0 , 60 B,C , only one route between B and D through C will be discovered, although many might exist. An anchoring mechanism (implemented in current CGR and discussed in [18] ) allowed to partially overcome this limitation. However, anchoring (a) only solves the problem for the first contact in the path and (b) it can end prematurely when a better path is found through a different initial contact.…”

Section: Current Limitationsmentioning

confidence: 99%

“…A walker-delta formation and a sunsynchronous along-track composed by 16 cross-linked LEO satellites (max. link range of 10 0 0 Km at 500 Km height), 25 ground target points (e.g., user terminals), and 6 ground stations have previously been presented in [18] and reconsidered in this analysis 6 . In this case, 24 h of orbital propagation were encoded in contact plans with 3184 and 1512 contacts respectively.…”

Section: Simulation Analysismentioning

confidence: 99%

“…6 An intuitive visualization of the scenarios as well as the obtained contact plans can be found at https://sites.google.com/unc.edu.ar/dtsn-scenarios . Furthermore, the interested reader is referred to [18] for specifics on orbital parameters and ground locations.…”

Section: Simulation Analysismentioning

confidence: 99%

See 2 more Smart Citations

On route table computation strategies in Delay-Tolerant Satellite Networks

et al. 2018

Self Cite

View full text Add to dashboard Cite

a b s t r a c tDelay-Tolerant Networking (DTN) has been proposed for satellite networks with no expectation of continuous or instantaneous end-to-end connectivity, which are known as Delay-Tolerant Satellite Networks (DTSNs). Path computation over large and highly-dynamic yet predictable topologies of such networks requires complex algorithms such as Contact Graph Routing (CGR) to calculate route tables, which can become extremely large and limit forwarding performance if all possible routes are considered. In this work, we discuss these issues in the context of CGR and propose alternatives to the existing route computation scheme: first-ending, first-depleted, one-route , and per-neighbor strategies. Simulation results over realistic DTSN constellation scenarios show that network flow metrics and overall calculation effort can be significantly improved by adopting these novel route table computation strategies. .ar (J.A. Fraire).DTN can be precisely computed in advance based on orbital elements. Also, power-conserving spacecrafts may communicate on infrequent, fixed intervals established by configuration. In any case, forthcoming episodes of communications (a.k.a. contacts ) are typically scheduled weeks or months before they occur and can be imprinted in a contact plan . The resulting contact plan can be either distributed in advance to DTN nodes, or used by a centralized node (i.e., mission control) to execute route determination procedures.A DTN paradigm can indeed be used to forward data on near-Earth satellite networks with sporadic satellite-to-satellite and satellite-to-ground communication opportunities. If so, we define them as Delay-Tolerant Satellite Networks (DTSNs). DTSNs differ from other space DTNs in the size of the topology and the speed at which it changes. In particular, interplanetary networks are rather scarce in terms of spacecrafts as a few rovers on a remote planet plus some orbiters are typically assumed in the literature [7] . While this density of deep-space nodes is unlikely to change in the near future, DTSNs topologies are expected to be promptly based on dozens or even hundreds of satellites [1] . Furthermore, while in interplanetary DTNs the topological changes are dictated by planetary dynamics, communication opportunities in DTSNs typically occur much more frequently between satellites in Low-Earth Orbit (LEO). As a result, the scalability limits of current DTN protocols and algorithms are likely to be met sooner in DTSN than in deep-space applications. Thus, DTSNs become an immediate object of study for evaluating efficient routing strategies which will also, in the long term, be valuable in the interplanetary domain.

show abstract

Sampling Distributed Schedulers for Resilient Space Communication

D’Argenio

Fraire

Hartmanns

2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We consider routing in delay-tolerant networks like satellite constellations with known but intermittent contacts, random message loss, and resource-constrained nodes. Using a Markov decision process model, we seek a forwarding strategy that maximises the probability of delivering a message given a bound on the network-wide number of message copies. Standard probabilistic model checking would compute strategies that use global information, which are not implementable since nodes can only act on local data. In this paper, we propose notions of distributed schedulers and good-for-distributed-scheduling models to formally describe an implementable and practically desirable class of strategies. The schedulers consist of one sub-scheduler per node whose input is limited to local information; good models additionally render the ordering of independent steps irrelevant. We adapt the lightweight scheduler sampling technique in statistical model checking to work for distributed schedulers and evaluate the approach, implemented in the Modest Toolset, on a realistic satellite constellation and contact plan.

show abstract

Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations

Cited by 33 publications

References 54 publications

Small satellites and CubeSats: Survey of structures, architectures, and protocols

Small satellites and CubeSats: Survey of structures, architectures, and protocols

On route table computation strategies in Delay-Tolerant Satellite Networks

Sampling Distributed Schedulers for Resilient Space Communication

Contact Info

Product

Resources

About