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. © IFIP International Federation for Information Processing 2007.
CITATION STYLE
François, J. M., & Leduc, G. (2007). Delivery guarantees in predictable disruption tolerant networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4479 LNCS, pp. 167–178). Springer Verlag. https://doi.org/10.1007/978-3-540-72606-7_15
Mendeley helps you to discover research relevant for your work.