Delivery Guarantees in Predictable Disruption Tolerant Networks

  • Jean-Marc François
  • Guy Leduc
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4479)

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.

References

  1. 1.
    Zhang, Z.: Routing in intermittently connected mobile ad hoc networks and delay tolerant networks. IEEE Surveys and Tutorials 8(1), 24–37 (2006)CrossRefGoogle Scholar
  2. 2.
    Burleigh, S., Hooke, A.: Delay-tolerant networking — an approach to interplanetary internet. IEEE Communications Magazine 41(6), 128–136 (2003)CrossRefGoogle Scholar
  3. 3.
    Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical Report TR CS-200006, Duke University (April 2000)Google Scholar
  4. 4.
    Juang, P., Oki, H.: Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. In: ASPLOS, San Jose, CA (Oct. 2002)Google Scholar
  5. 5.
    Spuropoulos, A., Psounis, K., Raghavendra, C.: Single-copy routing in intermittently connected mobile networks. In: Proceedings of IEEE SECON, October 2004, IEEE Computer Society Press, Los Alamitos (2004)Google Scholar
  6. 6.
    Spyropoulos, T., Psounis, K.: Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In: Proc. of SIGCOMM’05 (2005)Google Scholar
  7. 7.
    Wang, Y., et al.: Erasure-coding based routing for opportunistic networks. In: WDTN ’05: Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, Philadelphia, Pennsylvania, USA, pp. 229–236. ACM Press, New York (2005), doi:10.1145/1080139.1080140CrossRefGoogle Scholar
  8. 8.
    Lindgren, A., Doria, A.: Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev. 7(3), 19–20 (2003), doi:10.1145/961268.961272CrossRefGoogle Scholar
  9. 9.
    Jones, E., Li, L., Ward, P.: Practical routing in delay-tolerant networks. In: Proc. of WDTN’05, Philadelphia, Pennsylvania, USA, pp. 237–243. ACM Press, New York (2005), doi:10.1145/1080139.1080141Google Scholar
  10. 10.
    Leguay, J., Friedman, T., Conan, V.: DTN routing in a mobility pattern space. In: Proc. of WDTN’05, pp. 276–283. ACM Press, New York (2005), doi:10.1145/1080139.1080146Google Scholar
  11. 11.
    Shen, C., et al.: Interrogation-based relay routing for ad hoc satellite networks. In: IEEE Globecom, Taipei, Taiwan, November 17-21, 2002, IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
  12. 12.
    Musolesi, M., Hailes, S., Mascolo, C.: Adaptive routing for intermittently connected mobile ad hoc networks. In: Proc. of WoWMoM’05, pp. 183–189 (2005)Google Scholar
  13. 13.
    Merugu, S., Ammar, M., Zegura, E.: Routing in space and time in networks with predictable mobility. Technical Report GIT-CC-04-7, Georgia Tech. Inst. (2004)Google Scholar
  14. 14.
    François, J.M., Leduc, G.: Predictable disruption tolerant networks and delivery guarantees. Technical Report (arXiv:cs.NI/0612034 v1) (2006)Google Scholar
  15. 15.
    Tan, K., Zhang, Q., Zhu, W.: Shortest path routing in partially connected Ad Hoc networks. In: Proc. of IEEE GLOBECOM’03, vol. 2, December 2003, pp. 1038–1042. IEEE Computer Society Press, Los Alamitos (2003)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2007

Authors and Affiliations

  • Jean-Marc François
    • 1
  • Guy Leduc
    • 1
  1. 1.Research Unit in Networking (RUN), DEECS — Institut Montefiore, B28 — Sart-Tilman, University of Liège, 4000 LiègeBelgium

Personalised recommendations