DTN-FLOW: Inter-Landmark Data Flow for High-Throughput Routing in DTNs

DTN (Delay Tolerant Network) is a new type of mobile Ad Hoc network. Due to its characteristics such as long communication delay, high dynamic topology, it is difficult to maintain the stability of end to end paths. Therefore, design of effective and reliable routing algorithms has become the key issue in DTN. To avoid random and blindfold forwarding in Spray and Wait routing, a DTN routing algorithm named R-ASW (Relay-probability-based Adaptive Spay and Wait) has been proposed, R-ASW uses the performance of receiver nodes to determine whether forward message to the encounter node and calculate the number of message copies to be forwarded. This algorithm thought over synthetically the factors of node's energy, delivery predictability and speed. NS2 network simulation software is used to analyze the validity and reliability of the proposed DTN routing algorithm. The simulation results show that the proposed algorithm has better performances and it is suitable for DTN.

Majority of the existing Delay Tolerant Network (DTN) routing protocols, attempt to minimize one of the popular DTN routing indices, i.e. message delay, forwarding count and storage. However, for many DTN applications such as distributing commercial content, targeting the best performance for one index and compromising the others is insufficient. A more practical solution would be to strike a balance between multiple of these indices. Gain Dissemination Protocol (GDP) is one of the protocols which targets this aim by introducing a gain concept which tries reach a maximum gain of delivery by keeping the balance between the value achieved via delivering the packet to the destination and the forwarding cost involved with that. In this paper, we focus on characterizing the GDP protocol in the scope of mobility. We also propose an upper bound for gain in multicast routing problem, i.e. the Union of Unicast Benchmark (UUB) and compare the performance of a few DTN routing protocols with the former. This eventually reveals the performance scope of a potential gain-aware DTN dissemination protocol.

A survey of routing and data dissemination in Delay Tolerant Networks

Anycast routing is very useful for many applications such as resource discovery in delay tolerant networks (DTNs). In this paper, based on a new DTN model, we first analyze the any-cast semantics for DTNs. Then we present a novel metric named EMDDA (expected multi-destination delay for anycast) and a corresponding routing algorithm for anycast routing in DTNs. Extensive simulation results show that the proposed EMDDA routing scheme can effectively improve the efficiency of anycast routing in DTNs. It outperforms another algorithm, minimum expected delay (MED) algorithm, by 11.3% on average in term of routing delays and by 19.2% in term of average max queue length.

In recent years, several investigations have been made on "challenged network" [also known as, delay tolerant network (DTN)] architectures highlighting their advantages and disadvantages. In spite of its inherent shortcomings of unreliability and delay, smart-phone based opportunistic network is gaining immense popularity in the research community due to its applicability in different adverse and extreme communication scenarios where traditional communication infrastructure is either unavailable or incapacitated for a long time. Considerable research has been conducted till date to design efficient network architecture for emergency data dissemination in intermittently connected/challenged networks. Different architectures (ranging from flat to multi-tier) are proposed for implementing opportunistic DTN keeping in view of specific application requirements. However, very few of these proposed architectures have been examined from the perspective of a post disaster communication. Moreover, most DTN architectures are designed by aiming towards increasing delivery probability and reducing latency and as a whole, maximizing network throughput; with very little emphasis on its energy efficiency. The impact of different mobility patterns on existing DTN routing algorithms with respect to data dissemination and energy consumption has also not been studied so far. Our objective, in this paper, is to investigate the impact of different mobility patterns on existing DTN routing protocols and existing DTN architectures and subsequently, come up with a suitable energy efficient DTN framework combining suitable architecture and routing protocol that may be used to offer different disaster management services during post-disaster relief operation. We have done an extensive simulation on ONE simulator with different categories of well-known existing DTN architectures, mobility models, DTN routing protocols to study the network performance in terms of delivery probability, energy efficiency and overhead ratio. Based on the simulation results, we have tried to figure out a suitable combination of energy efficient architecture, mobility model and routing protocol that fits well in the post disaster communication scenario.

There is a growing need for secure and robust networks that function in austere environments or with nodes that have limited resources. The prime example is Delay Tolerant Networks that have military, first response, infrastructure failure and vehicle applications. This class of networks requires the modification of traditional routing and security protocols, such as TCP/IP or the use of certificate revocation servers, to effectively transmit a message from source to destination in a secure manner. There are multiple trust and routing schemes proposed for use in Delay Tolerant Networks. Here, we show how trust, usually defined in the context of network science, can be utilized for routing in Delay Tolerant Networks in which the fundamental challenge is balancing energy, delivery rate, delivery delay and security. Trust is a cornerstone of our approach to address this challenge. We propose a Trust Based Secure Routing Protocol, in which forwarding decisions are based on nodes trust, expected destination meeting time and the number of already created copies of the message.

Delay Tolerant Network (DTN) is a sparse and intermittently connected mobile wireless network where reliable communication and end-to-end connectivity cannot be assured. In DTN, a node delivers messages to the destination using store and forward scheme. Messages are copied and transferred to multiple relay-nodes in order to increase the opportunity for that message to reach the intended destination. Contact is the time duration for which two or more mobile nodes encounter each other within their radio transmission ranges, and are able to transfer messages. Due to arbitrary node movement, contact time will be varied, and is unlikely to be predictable. In this paper, we propose a fuzzy decision mechanism we called “fuzzy-spray”, to improve the routing and packet transfer efficiency in DTN environment. Fuzzy-spray can reduce overall latency in DTN by intelligently selecting appropriate messages to send to the relay-node during its next contact time. It uses fuzzy logic to prioritize messages that are stored in the buffer, based only on local parameters from each message, namely forward transmission count and message size. There is no need to know a priori information about network such as node mobility model, or node-distribution across the deployed area. The simulation results show that fuzzy-spray has the best performance in terms of overall speed of delivery, and lowest average message delay compared with other existing algorithms.

The framework of Delay Tolerant Networks (DTNs) has recently received an extensive attention and widely implemented, ranging from Wireless Sensor Networks (WSNs) to Interplanetary Networks. It has been applied in military communication, scientific research and exploration. Due to the characteristic of long delay, intermittent disruption, limitation of buffer space and energy, the traditional routing algorithms in the Internet do not perform well in DTNs. Since most of the existing DTN routing algorithms are based on the replication mechanism to achieve the high delivery ratio. In this paper, we propose an asymmetric spray algorithm based on the limited number of replication with the consideration of utility metric. In addition, we also design an adaptive replication function to optimize the dropped messages due to the insufficient encounter duration. Simulation results show the effectiveness of our asymmetric spray approach. In combination with the other designed functions, our proposed algorithm achieve a better performance than the state of the art algorithms.

Message delivery in Delay Tolerant Networks (DTNs) is challenging due to the fact that the network is intermittently connected. Mobility can be exploited to improve DTN performance. In this paper, we propose a DTN routing scheme Adaptive Spraying. Adaptive Spraying exploits mobility pattern and encounter history to predict the number of nodes with no copy a node will encounter within the expected delay. The number of nodes encountered can be viewed as the number of copies disseminated. Each node with copies dynamically chooses the number of copies by itself, instead of a fixed number determined at the source node. We present an analysis of the scheme and validate the analytical results with simulations. Simulation results show that Adaptive Spraying performs well over a variety of environmental conditions such as transmission range and traffic load.

Routing in Delay Tolerant Networks (DTN) requires nodes to work in a cooperative way. Due to the selfishness nature, the nodes are not willing to use their energy to help others. But two nodes with some relations (friends) are more willing to help each other. In addition, two nodes (not friends) having mutual friends can get help from each other through these mutual friends. This paper proposes a theoretic framework to evaluate the impact of mutual friends on Epidemic Routing (ER). Because the limited energy of nodes will influence their delivery decisions, we establish a model to evaluate the load distribution of ER. Simulations based on real motion traces are made and results show the accuracy of these two models. Further more, for the load distribution, numerical simulations are also considered and results show that most nodes in ER algorithm forward fewer times and only fewer nodes forward more than 5 times.

SummaryIn Delay Tolerant Networks (DTNs), mobile nodes exploit encounter chances to transmit data via the established opportunistic link between encounter nodes. The transmission capacity between two encounter nodes is constrained by the duration of opportunistic links. How to transmit data efficiently is one of the fundamental and most important issues in DTNs. Recently, Random Linear Network Coding (RLNC) is proposed as a promising approach to improve data transmission efficiency in DTNs. To facilitate the development of deployment of RLNC based routing protocols, it is imperative to quantify the performance gain brought by RLNC in a rigorous and systematic way. In this paper, we develop an analytical model to evaluate the data transmission performance of RLNC based epidemic routing in DTNs. In the model, we consider that multiple unicast communication sessions compete for limited \capacity. Numerical results validate the effectiveness of our analytical model and demonstrate the significant performance improvement for data transmission in DTNs brought by RLNC. Our work of this paper provides a general tool for performance evaluation and useful guidelines for designing RLNC based routing protocols in DTNs. Copyright © 2015 John Wiley & Sons, Ltd.

Nodes in Delay Tolerant Networks (DTN) rely on routing utilities (e.g., probabilities of meeting nodes) to decide the packet forwarder. As the utilities reflect user privacy, nodes may be reluctant to disclose such information directly. Therefore, we propose a distributed strategy to protect the aforementioned private information in utility-based DTN routing algorithms while still guarantying the correctness of packet forwarding, namely meeting Relationship Anonymity (ReHider). We also present an enhanced version that can better prevent certain malicious behaviors (probing attack and brute-force attack). Initial analysis show the effectiveness of the proposed strategy.

In this paper, we investigate the ability of using Delay Tolerant Networking (DTN) in Public Safety networks, where bandwidth and storage are constrained. We formalize the problem as a Wardrop equilibrium over a time-discretized graph. Driven by our findings, we propose RECOR, a centralized REsource-Constrained ORacle-based DTN routing mechanism, which spreads the demand across multiple store-carry forward paths to satisfy the node storage and link transport constraints observed in intervention situations. By applying the proposed mechanism to real Bluetooth-based DTN traces, we show that the transmission bottleneck can be compensated, but only up to a certain extent, by increasing storage capacity and delay. We also analyze the benefit of strategies that provide more resources to highly connected nodes (e.g. ambulances and firetrucks) which can then feed incentives and policies for DTN network engineering. Finally, the idea presented here is general and suggests the necessity of trace-driven simulation and specific modeling tools for appropriate design of future DTN resource management policies.

Generic prediction assisted single-copy routing in underwater delay tolerant sensor networks

Routing in delay tolerant network (DTN) closely depends on the cooperation of nodes. At present, there are many works exploring the impact of the selfish behavior. However, most of these works assume that there is only one source-destination pair, and the source just generates one message. For this reason, this paper studies the impact of selfish behavior when many messages are transmitted at the same time. In particular, there are multiple source-destination pairs, and each source generates the messages according to the Poisson process. Due to the selfish behavior, the nodes may be more willing to forward their own messages. In addition, the nodes may have closer relation with certain nodes (friends). Due to selfishness, the nodes may be more willing to help their friends other than the strangers. In such complex scenario, this paper proposes the theoretical models to evaluate the performance of the two-hop routing algorithm with single-copy and redundancy, respectively. Simulations show the accuracy of the models. Numerical results show that the selfish behavior may significantly increase the average delivery delay. In addition, the selfishness may also decrease the maximal flow.