Questioning flooding as a routing benchmark in Opportunistic Networks

Islam, Muhammad Arshad; Waldvogel, Marcel

Questioning flooding as a routing benchmark in Opportunistic Networks

Dateien

islam_waldvogel.pdfGröße: 3.91 MBDownloads: 365

Datum

2011

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

2011 Baltic Congress on Future Internet and Communications. IEEE, 2011, pp. 128-133. ISBN 978-1-4244-8511-6. Available under: doi: 10.1109/BCFIC-RIGA.2011.5733215

Zusammenfassung

Routing in Opportunistic Networks, as a relatively young discipline, still lacks coherent, simple and valid benchmarks. It is customary to use epidemic routing as performance benchmark for Opportunistic Networks. We identify and describe the current simulation practices that do not expose the shortcomings of flooding as an upper bound. In this paper to provide a step towards a routing benchmark, which is flexible, provides results close to an upper bound, is simple to implement, and thus might be a candidate for a common benchmark. This new method called EPO, does not suffer from bottlenecks that limit the performance of epidemic flooding, even when bandwidth is scarce. Our analysis shows that networks are not suffering from that much severe congestion as suggested by flooding and thus giving a better insight to the underlying network.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Routing, Flooding, Opportunistic Networks

Konferenz

2011 Baltic Congress on Future Internet Communications (BCFIC Riga), 16. Feb. 2011 - 18. Feb. 2011, Riga, Latvia

Zitieren

ISO 690

ISLAM, Muhammad Arshad, Marcel WALDVOGEL, 2011. Questioning flooding as a routing benchmark in Opportunistic Networks. 2011 Baltic Congress on Future Internet Communications (BCFIC Riga). Riga, Latvia, 16. Feb. 2011 - 18. Feb. 2011. In: 2011 Baltic Congress on Future Internet and Communications. IEEE, 2011, pp. 128-133. ISBN 978-1-4244-8511-6. Available under: doi: 10.1109/BCFIC-RIGA.2011.5733215

BibTex

@inproceedings{Islam2011-02Quest-12590,
  year={2011},
  doi={10.1109/BCFIC-RIGA.2011.5733215},
  title={Questioning flooding as a routing benchmark in Opportunistic Networks},
  isbn={978-1-4244-8511-6},
  publisher={IEEE},
  booktitle={2011 Baltic Congress on Future Internet and Communications},
  pages={128--133},
  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/12590">
    <dc:language>eng</dc:language>
    <dcterms:title>Questioning flooding as a routing benchmark in Opportunistic Networks</dcterms:title>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:issued>2011-02</dcterms:issued>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-05-17T09:34:13Z</dc:date>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:bibliographicCitation>First publ. in:  Internet Communications (BCFIC Riga), Baltic Congress on Future, 2011, pp. 128-133</dcterms:bibliographicCitation>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/12590/1/islam_waldvogel.pdf"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/12590"/>
    <dcterms:abstract xml:lang="eng">Routing in Opportunistic Networks, as a relatively young discipline, still lacks coherent, simple and valid benchmarks. It is customary to use epidemic routing as performance benchmark for Opportunistic Networks. We identify and describe the current simulation practices that do not expose the shortcomings of flooding as an upper bound. In this paper to provide a step towards a routing benchmark, which is flexible, provides results close to an upper bound, is simple to implement, and thus might be a candidate for a common benchmark. This new method called EPO, does not suffer from bottlenecks that limit the performance of epidemic flooding, even when bandwidth is scarce. Our analysis shows that networks are not suffering from that much severe congestion as suggested by flooding and thus giving a better insight to the underlying network.</dcterms:abstract>
    <dc:contributor>Islam, Muhammad Arshad</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Waldvogel, Marcel</dc:creator>
    <dc:contributor>Waldvogel, Marcel</dc:contributor>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-05-17T09:34:13Z</dcterms:available>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/12590/1/islam_waldvogel.pdf"/>
    <dc:creator>Islam, Muhammad Arshad</dc:creator>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja