Probabilistic Routing Protocol for Intermittently Connected Networks

This document is a product of the Delay Tolerant Networking Research Group and has been reviewed by that group. No objections to its publication as an RFC were raised. This document defines PRoPHET, a Probabilistic Routing Protocol using History of Encounters and Transitivity. PRoPHET is a variant of the epidemic routing protocol for intermittently connected networks that operates by pruning the epidemic distribution tree to minimize resource usage while still attempting to achieve the best-case routing capabilities of epidemic routing. It is intended for use in sparse mesh networks where there is no guarantee that a fully connected path between the source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. These networks are examples of networks where there is a disparity between the latency requirements of applications and the capabilities of the underlying network (networks often referred to as delay and disruption tolerant). The document presents an architectural overview followed by the protocol specification

Dtn and non-dtn routing protocols for inter-cubesat communications: A comprehensive survey

CubeSats, which are limited by size and mass, have limited functionality. These miniaturised satellites suffer from a low power budget, short radio range, low transmission speeds, and limited data storage capacity. Regardless of these limitations, CubeSats have been deployed to carry out many research missions, such as gravity mapping and the tracking of forest fires. One method of increasing their functionality and reducing their limitations is to form CubeSat networks, or swarms, where many CubeSats work together to carry out a mission. Nevertheless, the network might have intermittent connectivity and, accordingly, data communication becomes challenging in such a disjointed network where there is no contemporaneous path between source and destination due to satellites’ mobility pattern and given the limitations of range. In this survey, various inter-satellite routing protocols that are Delay Tolerant (DTN) and Non Delay Tolerant (Non-DTN) are considered. DTN routing protocols are considered for the scenarios where the network is disjointed with no contemporaneous path between a source and a destination. We qualitatively compare all of the above routing protocols to highlight the positive and negative points under different network constraints. We conclude that the performance of routing protocols used in aerospace communications is highly dependent on the evolving topology of the network over time. Additionally, the Non-DTN routing protocols will work efficiently if the network is dense enough to establish reliable links between CubeSats. Emphasis is also given to network capacity in terms of how buffer, energy, bandwidth, and contact duration influence the performance of DTN routing protocols, where, for example, flooding-based DTN protocols can provide superior performance in terms of maximizing delivery ratio and minimizing a delivery delay. However, such protocols are not suitable for CubeSat networks, as they harvest the limited resources of these tiny satellites and they are contrasted with forwarding-based DTN routing protocols, which are resource-friendly and produce minimum overheads on the cost of degraded delivery probability. From the literature, we found that quota-based DTN routing protocols can provide the necessary balance between delivery delay and overhead costs in many CubeSat missions

Hybrid routing in delay tolerant networks

This work addresses the integration of today\\u27s infrastructure-based networks with infrastructure-less networks. The resulting Hybrid Routing System allows for communication over both network types and can help to overcome cost, communication, and overload problems. Mobility aspect resulting from infrastructure-less networks are analyzed and analytical models developed. For development and deployment of the Hybrid Routing System an overlay-based framework is presented

Hybrid Routing in Delay Tolerant Networks

This work addresses the integration of today\u27s infrastructure-based networks with infrastructure-less networks. The resulting Hybrid Routing System allows for communication over both network types and can help to overcome cost, communication, and overload problems. Mobility aspect resulting from infrastructure-less networks are analyzed and analytical models developed. For development and deployment of the Hybrid Routing System an overlay-based framework is presented

Prediction-enhanced Routing in Disruption-tolerant Satellite Networks

This thesis introduces a framework for enhancing DTN (Delay-/Disruption-Tolerant Networking) routing in dynamic LEO satellite constellations based on the prediction of contacts. The solution is developed with a clear focus on the requirements imposed by the 'Ring Road' use case, mandating a concept for dynamic contact prediction and its integration into a state-of-the-art routing approach. The resulting system does not restrict possible applications to the 'Ring Road,' but allows for flexible adaptation to further use cases. A thorough evaluation shows that employing proactive routing in concert with a prediction mechanism offers significantly improved performance when compared to alternative opportunistic routing techniques

A Multi-Objective Routing Algorithm Based on Auction Game for Space Information Network

This paper aims to create a resource-saving method for the routing problem in space information network. To this end, a multi-objective routing algorithm was created based on game theory for space information network. Specifically, the auction game was introduced to solve the routing problem using the delay-tolerating network (DTN) protocol. Considering the topological periodicity of low earth orbit (LEO) satellite network, a typical space information network, the dynamic topological structure was divided into relatively static time slots. Then, the routing problem was solved through the auction game in these slots. The proposed algorithm can minimize the number of selfish nodes in the network and avoid network congestion resulted from excessive resource consumption of individual nodes. Finally, the proposed algorithm was compared with other well-known routing models like the epidemic routing model (Epidemic) and the first contact routing model (FC). The results show that the proposed algorithm outperformed the contrastive models in both average delay and network overhead ratio. The research findings shed important new light on the routing of space information network

Internet of Satellites (IoSat): analysis of network models and routing protocol requirements

The space segment has been evolved from monolithic to distributed satellite systems. One of these distributed systems is called the federated satellite system (FSS) which aims at establishing a win-win collaboration between satellites to improve their mission performance by using the unused on-board resources. The FSS concept requires sporadic and direct communications between satellites, using inter satellite links. However, this point-to-point communication is temporal and thus it can break existent federations. Therefore, the conception of a multi-hop scenario needs to be addressed. This is the goal of the Internet of satellites (IoSat) paradigm which, as opposed to a common backbone, proposes the creation of a network using a peer-to-peer architecture. In particular, the same satellites take part of the network by establishing intermediate collaborations to deploy a FSS. This paradigm supposes a major challenge in terms of network definition and routing protocol. Therefore, this paper not only details the IoSat paradigm, but it also analyses the different satellite network models. Furthermore, it evaluates the routing protocol candidates that could be used to implement the IoSat paradigm.Peer ReviewedPostprint (author's final draft

Methodologies for the analysis of value from delay-tolerant inter-satellite networking

In a world that is becoming increasingly connected, both in the sense of people and devices, it is of no surprise that users of the data enabled by satellites are exploring the potential brought about from a more connected Earth orbit environment. Lower data latency, higher revisit rates and higher volumes of information are the order of the day, and inter-connectivity is one of the ways in which this could be achieved. Within this dissertation, three main topics are investigated and built upon. First, the process of routing data through intermittently connected delay-tolerant networks is examined and a new routing protocol introduced, called Spae. The consideration of downstream resource limitations forms the heart of this novel approach which is shown to provide improvements in data routing that closely match that of a theoretically optimal scheme. Next, the value of inter-satellite networking is derived in such a way that removes the difficult task of costing the enabling inter-satellite link technology. Instead, value is defined as the price one should be willing to pay for the technology while retaining a mission value greater than its non-networking counterpart. This is achieved through the use of multi-attribute utility theory, trade-space analysis and system modelling, and demonstrated in two case studies. Finally, the effects of uncertainty in the form of sub-system failure are considered. Inter-satellite networking is shown to increase a system's resilience to failure through introduction of additional, partially failed states, made possible by data relay. The lifetime value of a system is then captured using a semi-analytical approach exploiting Markov chains, validated with a numerical Monte Carlo simulation approach. It is evident that while inter-satellite networking may offer more value in general, it does not necessarily result in a decrease in the loss of utility over the lifetime.In a world that is becoming increasingly connected, both in the sense of people and devices, it is of no surprise that users of the data enabled by satellites are exploring the potential brought about from a more connected Earth orbit environment. Lower data latency, higher revisit rates and higher volumes of information are the order of the day, and inter-connectivity is one of the ways in which this could be achieved. Within this dissertation, three main topics are investigated and built upon. First, the process of routing data through intermittently connected delay-tolerant networks is examined and a new routing protocol introduced, called Spae. The consideration of downstream resource limitations forms the heart of this novel approach which is shown to provide improvements in data routing that closely match that of a theoretically optimal scheme. Next, the value of inter-satellite networking is derived in such a way that removes the difficult task of costing the enabling inter-satellite link technology. Instead, value is defined as the price one should be willing to pay for the technology while retaining a mission value greater than its non-networking counterpart. This is achieved through the use of multi-attribute utility theory, trade-space analysis and system modelling, and demonstrated in two case studies. Finally, the effects of uncertainty in the form of sub-system failure are considered. Inter-satellite networking is shown to increase a system's resilience to failure through introduction of additional, partially failed states, made possible by data relay. The lifetime value of a system is then captured using a semi-analytical approach exploiting Markov chains, validated with a numerical Monte Carlo simulation approach. It is evident that while inter-satellite networking may offer more value in general, it does not necessarily result in a decrease in the loss of utility over the lifetime