Delivery guarantees in predictable disruption tolerant networks

Authors:
Jean-Marc François;Guy Leduc
Affiliations:
Research Unit in Networking, DEECS, Institut Montefiore, University of Liège, Liège, Belgium;Research Unit in Networking, DEECS, Institut Montefiore, University of Liège, Liège, Belgium
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 9
Cited 1

Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Probabilistic routing in intermittently connected networks

ACM SIGMOBILE Mobile Computing and Communications Review
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks

WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Erasure-coding based routing for opportunistic networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Practical routing in delay-tolerant networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTN routing in a mobility pattern space

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges

IEEE Communications Surveys & Tutorials
Delay-tolerant networking: an approach to interplanetary Internet

IEEE Communications Magazine

Routing based on delivery distributions in predictable disruption tolerant networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article studies disruption tolerant networks (DTNs) where each node knows the probabilistic distribution of contacts with other nodes. It proposes a framework that allows one to formalize the behaviour of such a network. It generalizes extreme cases that have been studied before where either (a) nodes only know their contact frequency with each other or (b) they have a perfect knowledge of who meets who and when. This paper then gives an example of how this framework can be used; it shows how one can find a packet forwarding algorithm optimized to meet the delay/bandwidth consumption trade-off: packets are duplicated so as to (statistically) guarantee a given delay or delivery probability, but not too much so as to reduce the bandwidth, energy, and memory consumption.