Leveraging Probabilistic Contacts in Contact Graph Routing
Felix Walter, Marius Feldmann · 2019
Contacts in disrupted small-satellite networks are subject to probabilistic influences that result in a variable likelihood of successful packet transmission. To achieve a high delivery rate when leveraging DTN routing, available approaches put significant load on the network by replicating data over multiple concurrent paths. In this paper, we propose a novel approach to routing under such conditions, based on the popular Contact Graph Routing algorithm. The approach utilizes information available about the probabilistic nature of future contacts. By that, the level of replication is controlled such that a high delivery rate can be achieved while keeping the overhead imposed on the nodes and contacts low.