Delay-Tolerant Networking Architecture

Fall, Kevin; Scott, Keith; Burleigh, Scott; Torgerson, Leigh; Hooke, Adrian J.; Weiss, Howard S.; Durst, Robert C.; Cerf, Vint

doi:10.17487/rfc4838

Cited by 896 publications

(657 citation statements)

References 12 publications

Supporting

Mentioning

642

Contrasting

Unclassified

Order By: Relevance

“…In order to remove the time dimension from the edges in G, 1 Information about the ordering of the physical contacts within the same time slot is lost. we generate a probabilistic state-space graph…”

Section: Probabilistic State-space Graphmentioning

confidence: 99%

“…As in Figure 5(c), (1) states of the same node are strongly-connected by directional links, and (2) states of different nodes are connected by bidirectional links. However, if we group the states of the same time slots into components (not necessarily stronglyconnected components), we find that these components form a partial order if, given a time slot t b , each link starting at a time slot before t b and ending at time slot in or after t b is removed.…”

Section: An Efficient Approach For Emdsmentioning

confidence: 99%

“…The Delay Tolerant Network Research Group (DTNRG) [1] has designed a complete architecture to support various protocols in DTNs. A DTN can be described abstractly using a timespace graph, in which each edge contains a set of contacts.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Routing in a cyclic mobispace

Liu

2008

Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future connectivity, opportunistic routing is preferred in DTNs, in which messages are forwarded to nodes with higher delivery probabilities. We observe that real objects have repetitive motions, but no prior research work has investigated the cyclic delivery probability of messages between nodes. In this paper, we propose to use the expected minimum delay (EMD) as a new delivery probability metric in DTNs with repetitive but non-deterministic mobility. Specifically, we model the network as a probabilistic time-space graph with historical contact information or prior knowledge about the network. We then translate it into a probabilistic state-space graph in which the time dimension is removed. Finally, we apply the Markov decision process to derive the EMDs of the messages at particular times. Our proposed EMD-based routing protocol, called routing in cyclic MobiSpace (RCM), outperforms several existing opportunistic routing protocols when simulated using both real and synthetic traces.

show abstract

Section: Probabilistic State-space Graphmentioning

confidence: 99%

Section: An Efficient Approach For Emdsmentioning

confidence: 99%

See 1 more Smart Citation

Routing in a cyclic mobispace

Liu

2008

Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

show abstract

“…However, this type of networks has to deal with challenging issues [5] (e.g., the high mobility of vehicles, the constant network topology changing, or even the network scale). To overcome the above-mentioned issues, several approaches are emerging, such as Vehicular Ad Hoc Networks (VANETs) [6,7], Delay-Tolerant Networks (DTNs) [8], and more recently, Vehicular Delay-Tolerant Networks (VDTNs) [9] that are considered in this study.…”

Section: Introductionmentioning

confidence: 99%

Performance assessment of fragmentation mechanisms for vehicular delay-tolerant networks

Dias

Rodrigues

Isento

et al. 2011

J Wireless Com Network

View full text Add to dashboard Cite

Vehicular Delay-Tolerant Networks (VDTNs) are a new approach for vehicular communications where vehicles cooperate with each other, acting as the communication infrastructure, to provide low-cost asynchronous opportunistic communications. These communication technologies assume variable delays and bandwidth constraints characterized by a non-transmission control protocol/internet protocol architecture but interacting with it at the edge of the network. VDTNs are based on the principle of asynchronous communications, bundle-oriented communication from the DTN architecture, employing a store-carry-and-forward routing paradigm. In this sense, VDTNs should use the tight network resources optimizing each opportunistic contact among nodes. Given the limited contact times among nodes, fragmentation appears as a possible solution to improve the overall network performance, increasing the bundle delivery probability. This article proposes the use of several fragmentation approaches (proactive, source, reactive, and toilet paper) for VDTNs. They are discussed and evaluated through a laboratory testbed. Reactive and toilet paper approaches present the best results. It was also shown that only the source fragmentation approach presents worst results when compared with non-fragmentation approaches.

show abstract

“…Delay-Tolerant Networks (DTNs) are a class of networks that are characterized by intermittent connections, long variable delays, and heterogeneous operating environments over which an overlay or bundle layer works [5,6,7]. DTNs find potential applications in many areas such as satellite networks, vehicular networks, and disaster response systems.…”

Section: Introductionmentioning

confidence: 99%

A Realistic Framework for Delay-Tolerant Network Routing in Open Terrains with Continuous Churn

Mahendran

Anirudh

Murthy

2011

Distributed Computing and Networking

View full text Add to dashboard Cite

Abstract. The conventional analysis of Delay-Tolerant Network (DTN) routing assumes that the terrain over which nodes move is closed implying that when the nodes hit a boundary, they either wrap around or get reflected. In this work, we study the effect of relaxing this closed terrain assumption on the routing performance, where a continuous stream of nodes enter the terrain and get absorbed upon hitting the boundary.We introduce a realistic framework that models the open terrain as a queue and compares performance with the closed terrain for a variety of routing protocols. With three different mobility scenarios and four different routing protocols, our simulation shows that the routing delays in an open terrain are statistically equivalent to those in closed terrains for all routing protocols. However, in terms of cost some protocols differ widely in two cases while some continue to demonstrate the statistical equivalence. We believe that this could be a new way to classify routing protocols based on the difference in their behavior under churn.

show abstract

Delay-Tolerant Networking Architecture

Cited by 896 publications

References 12 publications

Routing in a cyclic mobispace

Routing in a cyclic mobispace

Performance assessment of fragmentation mechanisms for vehicular delay-tolerant networks

A Realistic Framework for Delay-Tolerant Network Routing in Open Terrains with Continuous Churn

Contact Info

Product

Resources

About