Robust streaming in delay tolerant networks

Delay Tolerant Networks (DTN) do not provide any end to end connectivity guarantee. Thus, transporting data over such networks is a tough challenge as most of Internet applications assume a form of persistent end to end connection. While research in DTN has mainly addressed the problem of routing in various mobility contexts with the aim to improve bundle delay delivery and data delivery ratio, little attention has been paid to applications. This paper investigates the support of streaming-like applications over DTN. We identify how DTN characteristics impact on the overall performances of these applications and present Tetrys, a transport layer mechanism, which enables robust streaming over DTN. Tetrys is based on an on the fly coding mechanism able to ensure full reliability without retransmission and fast in-order bundle delivery in comparison to classical erasure coding schemes. We evaluate our Tetrys prototype on real DTN connectivity traces captured from the Rollerblading tour in Paris. Simulations show that on average, Tetrys clearly outperforms all other reliability schemes in terms of bundles delivery service

Orion Routing Protocol for Delay-Tolerant Networks

In this paper, we address the problem of efficient routing in delay tolerant network. We propose a new routing protocol dubbed as ORION. In ORION, only a single copy of a data packet is kept in the network and transmitted, contact by contact, towards the destination. The aim of the ORION routing protocol is twofold: on one hand, it enhances the delivery ratio in networks where an end-to-end path does not necessarily exist, and on the other hand, it minimizes the routing delay and the network overhead to achieve better performance. In ORION, nodes are aware of their neighborhood by the mean of actual and statistical estimation of new contacts. ORION makes use of autoregressive moving average (ARMA) stochastic processes for best contact prediction and geographical coordinates for optimal greedy data packet forwarding. Simulation results have demonstrated that ORION outperforms other existing DTN routing protocols such as PRoPHET in terms of end-to-end delay, packet delivery ratio, hop count and first packet arrival

Applying branching processes to delay-tolerant networks

Mobility models that have been used in the past to study delay tolerant networks (DTNs) have been either too complex to allow for deriving analytical expressions for performance measures, or have been too simplistic. In this paper we identify several classes of DTNs where the dynamics of the number of nodes that have a copy of some packet can be modeled as branching process with migration. Using recent results on such processes in a random environment, we obtain explicit formulae for the first two moments of the number of copies of a file that is propagated in the DTN, for quite general mobility models. Numerical examples illustrate our approach

Dynamic control of Coding in Delay Tolerant Networks

Delay tolerant Networks (DTNs) leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease message delivery delay, the information to be transmitted is replicated in the network. We study replication mechanisms that include Reed-Solomon type codes as well as network coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows us to compute the probability of successful delivery. We study the effect of coding on the performance of the network while optimizing parameters that govern routing

Pervasive intelligent routing in content centric delay tolerant networks

This paper introduces a Swarm-Intelligence based Routing protocol (SIR) that aims to efficiently route information in content centric Delay Tolerant Networks (CCDTN) also dubbed pocket switched networks. First, this paper formalizes the notion of optimal path in CCDTN and introduces an original and efficient algorithm to process these paths in dynamic graphs. The properties and some invariant features of these optimal paths are analyzed and derived from several real traces. Then, this paper shows how optimal path in CCDTN can be found and used from a fully distributed swarm-intelligence based approach of which the global intelligent behavior (i.e. shortest path discovery and use) emerges from simple peer to peer interactions applied during opportunistic contacts. This leads to the definition of the SIR routing protocol of which the consistency, efficiency and performances are demonstrated from intensive representative simulations

The Mason Test: A Defense Against Sybil Attacks in Wireless Networks Without Trusted Authorities

Wireless networks are vulnerable to Sybil attacks, in which a malicious node poses as many identities in order to gain disproportionate influence. Many defenses based on spatial variability of wireless channels exist, but depend either on detailed, multi-tap channel estimation - something not exposed on commodity 802.11 devices - or valid RSSI observations from multiple trusted sources, e.g., corporate access points - something not directly available in ad hoc and delay-tolerant networks with potentially malicious neighbors. We extend these techniques to be practical for wireless ad hoc networks of commodity 802.11 devices. Specifically, we propose two efficient methods for separating the valid RSSI observations of behaving nodes from those falsified by malicious participants. Further, we note that prior signalprint methods are easily defeated by mobile attackers and develop an appropriate challenge-response defense. Finally, we present the Mason test, the first implementation of these techniques for ad hoc and delay-tolerant networks of commodity 802.11 devices. We illustrate its performance in several real-world scenarios

Web browser for delay-tolerant networks

Due to growth of the Internet, the number of devices increasing and the structure of networks becoming more complex, the problem of time delays during information transmissions has arisen. In environments with long transmission delays modern protocols may become inefficient or even useless. Delay-tolerant Networking (DTN) is one approach that allows to solve the problem of long transmission delay times. In the thesis, an approach to web access in such networks is proposed. The problem of data transmission in the networks with long delays is considered. Special methods exist for data transmission in computer networks. But traditional data transmission protocols do not work well in networks with long delays, e.g. when transmitting over long distances, such as in space, or when connectivity may be disrupted, such as in mobile networks. It is necessary, therefore, to replace TCP and to change the existing web protocol (Hypertext Transfer Protocol - HTTP) in order to allow HTTP data transmissions in DTN environments. In the thesis, HTTP is analyzed and an adaptation of HTTP to DTN environments, as proposed in earlier research, is reviewed and extended further. A client part is created and the implementation is described. The client allows solving the problem of HTTP over DTN usage. An open-source browser is modified and the necessary extensions are developed. The extensions allow to use the DTN transport protocol (i.e. the Bundle Protocol) as another option of transport other than TCP. The software module for a web browser is built on the Mozilla platform. It was shown that it is possible to create a browser to work in DTNs

TEMPORAL ROUTING IN DELAY TOLERANT NETWORKS

In conventional network environments, routing implies a stable world in which the vision of a next hop is consistent with the vision a forwarding node, so that a packet can progress, for example, in a greedy fashion that reduces a remaining cost at each hop, to a destination. However, in the world of mobile delay tolerant networking (DTN), nodes can move in any direction, nodes may forward packets when they meet a peer, and may move in between such actions. Thus, the relative position of nodes can change between meeting such that it can become difficult to compute a physical path based on a position of all nodes. Techniques presented herein propose a foundational routing to the future model for mobile DTN nodes that may enable predictable rendezvous among such nodes. During operation, a router can, for example, compute a route along rendezvous points while optimizing for the total latency, energy, and chances of delivery based on the probability of the rendezvous to effectively occur