Reality-Check for DTN Routing Algorithms

Islam, Muhammad Arshad; Waldvogel, Marcel

Reality-Check for DTN Routing Algorithms

Dateien

islam_RealityCheckDTNRoutingAlgorithms.pdfGröße: 392.74 KBDownloads: 420

Datum

2008

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

2008 The 28th International Conference on Distributed Computing Systems Workshops. IEEE, 2008, pp. 204-209. ISBN 978-0-7695-3173-1. Available under: doi: 10.1109/ICDCS.Workshops.2008.57

Zusammenfassung

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.

Fachgebiet (DDC)

004 Informatik

Konferenz

2008 28th International Conference on Distributed Computing Systems Workshops (ICDCS Workshops), 17. Juni 2008 - 20. Juni 2008, Beijing, China

Zitieren

ISO 690

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, 17. Juni 2008 - 20. Juni 2008. In: 2008 The 28th International Conference on Distributed Computing Systems Workshops. IEEE, 2008, pp. 204-209. ISBN 978-0-7695-3173-1. Available under: doi: 10.1109/ICDCS.Workshops.2008.57

BibTex

@inproceedings{Islam2008-06Reali-6270,
  year={2008},
  doi={10.1109/ICDCS.Workshops.2008.57},
  title={Reality-Check for DTN Routing Algorithms},
  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:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6270">
    <dcterms:bibliographicCitation>ICDCSW '08: Proceedings of the 28th International Conference on Distributed Computing Systems Workshops, 2008. pp. 204-209</dcterms:bibliographicCitation>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <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:issued>2008-06</dcterms:issued>
    <dc:creator>Waldvogel, Marcel</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6270"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-sa/2.0/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:38Z</dcterms:available>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:38Z</dc:date>
    <dc:creator>Islam, Muhammad Arshad</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6270/1/islam_RealityCheckDTNRoutingAlgorithms.pdf"/>
    <dcterms:title>Reality-Check for DTN Routing Algorithms</dcterms:title>
    <dc:format>application/pdf</dc:format>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6270/1/islam_RealityCheckDTNRoutingAlgorithms.pdf"/>
    <dc:language>eng</dc:language>
    <dc:rights>Attribution-ShareAlike 2.0 Generic</dc:rights>
    <dc:contributor>Islam, Muhammad Arshad</dc:contributor>
    <dc:contributor>Waldvogel, Marcel</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja