DocumentCode
2289127
Title
Reality-Check for DTN Routing Algorithms
Author
Islam, Arshad ; Waldvogel, Marcel
Author_Institution
Univ. of Konstanz, Konstanz
fYear
2008
fDate
17-20 June 2008
Firstpage
204
Lastpage
209
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.
Keywords
ad hoc networks; delays; telecommunication network routing; DTN routing algorithm; ad hoc networks; delay-tolerant network; intermittent connectivity; open-source DTN simulator; Ad hoc networks; Added delay; Analytical models; Bandwidth; Disruption tolerant networking; Distributed computing; Network topology; Open source software; Proposals; Routing protocols; Analysis; DTN; Modeling; Simulation; Wireless;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems Workshops, 2008. ICDCS '08. 28th International Conference on
Conference_Location
Beijing
ISSN
1545-0678
Print_ISBN
978-0-7695-3173-1
Electronic_ISBN
1545-0678
Type
conf
DOI
10.1109/ICDCS.Workshops.2008.57
Filename
4577783
Link To Document