Reality-Check for DTN Routing Algorithms

  • Authors:
  • Arshad Islam;Marcel Waldvogel

  • Affiliations:
  • -;-

  • Venue:
  • ICDCSW '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many applications of ad-hoc networks include intermittent connectivity. Anyone wishing to implement routing into her delay-tolerant network can select from a wide variation of options, but the choice is hard, as there is no strong comparative evidence to the relative performance of the algorithms. Every paper uses a different setting, mostly far from realistic. In our desire to improve the basis for decisions, we simulated a promising selection of DTN routing algorithms in three vastly different scenarios, all based on publicly available real-world traces. Using our open-source DTN simulator, we compare and analyse 11 routing techniques, then provide explanations for the behaviour and give advice for choosing a suitable mechanism. To our own surprise, the results challenge the conventional wisdom gained from synthetic simulations and poses the question whether the world is ready for DTNs.