Reality-Check for DTN Routing Algorithms

Cite This

Files in this item

Checksum: MD5:5942d389f086965f95d0871b506beda8

ISLAM, Muhammad Arshad, Marcel WALDVOGEL, 2008. Reality-Check for DTN Routing Algorithms. 2008 28th International Conference on Distributed Computing Systems Workshops (ICDCS Workshops). Beijing, China, Jun 17, 2008 - Jun 20, 2008. In: 2008 The 28th International Conference on Distributed Computing Systems Workshops. IEEE, pp. 204-209. ISBN 978-0-7695-3173-1. Available under: doi: 10.1109/ICDCS.Workshops.2008.57

@inproceedings{Islam2008-06Reali-6270, title={Reality-Check for DTN Routing Algorithms}, year={2008}, doi={10.1109/ICDCS.Workshops.2008.57}, isbn={978-0-7695-3173-1}, publisher={IEEE}, booktitle={2008 The 28th International Conference on Distributed Computing Systems Workshops}, pages={204--209}, author={Islam, Muhammad Arshad and Waldvogel, Marcel} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:isPartOf rdf:resource=""/> <dc:contributor>Islam, Muhammad Arshad</dc:contributor> <dspace:hasBitstream rdf:resource=""/> <dcterms:hasPart rdf:resource=""/> <dcterms:issued>2008-06</dcterms:issued> <dc:rights>terms-of-use</dc:rights> <dc:creator>Waldvogel, Marcel</dc:creator> <dc:language>eng</dc:language> <dcterms:rights rdf:resource=""/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Waldvogel, Marcel</dc:contributor> <bibo:uri rdf:resource=""/> <dc:creator>Islam, Muhammad Arshad</dc:creator> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:bibliographicCitation>ICDCSW '08: Proceedings of the 28th International Conference on Distributed Computing Systems Workshops, 2008. pp. 204-209</dcterms:bibliographicCitation> <dc:format>application/pdf</dc:format> <dcterms:title>Reality-Check for DTN Routing Algorithms</dcterms:title> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:abstract xml:lang="eng">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.</dcterms:abstract> <dcterms:available rdf:datatype="">2011-03-24T16:10:38Z</dcterms:available> <dc:date rdf:datatype="">2011-03-24T16:10:38Z</dc:date> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

islam_RealityCheckDTNRoutingAlgorithms.pdf 141

This item appears in the following Collection(s)

terms-of-use Except where otherwise noted, this item's license is described as terms-of-use

Search KOPS


My Account