Layer-5 temporally-spliced path for efficient Disruption Tolerant Networking

Author(s):  
Daiki Mitake ◽  
Kunitake Kaneko ◽  
Fumio Teraoka
Author(s):  
Rajesh Krishnan ◽  
Prithwish Basu ◽  
Joanne M. Mikkelson ◽  
Christopher Small ◽  
Ram Ramanathan ◽  
...  

2021 ◽  
pp. 325-340
Author(s):  
Lucas William Paz Pinto ◽  
Bruno L. Dalmazo ◽  
André Riker ◽  
Jéferson Campos Nobre

2017 ◽  
Vol 2017 ◽  
pp. 1-18 ◽  
Author(s):  
J. A. Fraire ◽  
P. Madoery ◽  
S. Burleigh ◽  
M. Feldmann ◽  
J. Finochietto ◽  
...  

Existing Internet protocols assume persistent end-to-end connectivity, which cannot be guaranteed in disruptive and high-latency space environments. To operate over these challenging networks, a store-carry-and-forward communication architecture called Delay/Disruption Tolerant Networking (DTN) has been proposed. This work provides the first examination of the performance and robustness of Contact Graph Routing (CGR) algorithm, the state-of-the-art routing scheme for space-based DTNs. To this end, after a thorough description of CGR, two appealing satellite constellations are proposed and evaluated by means of simulations. Indeed, the DtnSim simulator is introduced as another relevant contribution of this work. Results enabled the authors to identify existing CGR weaknesses and enhancement opportunities.


2015 ◽  
Vol 87 ◽  
pp. 59-77 ◽  
Author(s):  
Carlos Borrego ◽  
Sergi Robles ◽  
Angela Fabregues ◽  
Adrián Sánchez-Carmona

Author(s):  
Carlos Velásquez-Villada ◽  
Yezid Donoso

Rural networking connectivity is a very dynamic and attractive research field. Nowadays big IT companies and many governments are working to help connect all these rural, disconnected people to Internet. This paper introduces a new routing algorithm that can bring non-real-time Internet connectivity to rural users. This solution is based on previously tested ideas, especially on Delay/Disruption Tolerant Networking technologies, since they can be used to transmit messages to and from difficult to access sites. It introduces the rural connectivity problem and its context. Then, it shows the proposed solution with its mathematical model used to describe the problem, its proposed heuristic, and its results. The advantage of our solution is that it is a low-cost technology that uses locally available infrastructure to reach even the most remote towns. The mathematical model describes the problem of transmitting messages from a rural, usually disconnected user, to an Internet connected node, through a non-reliable network using estimated delivery probabilities varying through time. The forwarding algorithm uses local knowledge gathered from interactions with other nodes, and it learns which nodes are more likely to connect in the future, and which nodes are more likely to deliver the messages to the destination. Our algorithm achieves an equal or better performance in delivery rate and delay than other well-known routing protocols for the rural scenarios tested. This paper adds more simulation results for the proposed rural scenarios, and it also extends the explanation of the mathematical model and the heuristic algorithm from the conference paper "Delay/Disruption Tolerant Networks Based Message Forwarding Algorithm for Rural Internet Connectivity Applications" [1] (doi: 10.1109/ICCCC. 2016.7496732).


Sign in / Sign up

Export Citation Format

Share Document