Questioning flooding as a routing benchmark in Opportunistic Networks

Cite This

Files in this item

Checksum: MD5:ea51ad4a3761fe90920b2f6b8e9a9968

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

@inproceedings{Islam2011-02Quest-12590, title={Questioning flooding as a routing benchmark in Opportunistic Networks}, year={2011}, doi={10.1109/BCFIC-RIGA.2011.5733215}, isbn={978-1-4244-8511-6}, publisher={IEEE}, booktitle={2011 Baltic Congress on Future Internet and Communications}, pages={128--133}, author={Islam, Muhammad 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=""> <dspace:hasBitstream rdf:resource=""/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:bibliographicCitation>First publ. in: Internet Communications (BCFIC Riga), Baltic Congress on Future, 2011, pp. 128-133</dcterms:bibliographicCitation> <dc:date rdf:datatype="">2011-05-17T09:34:13Z</dc:date> <dc:rights>terms-of-use</dc:rights> <dc:contributor>Islam, Muhammad</dc:contributor> <bibo:uri rdf:resource=""/> <dc:creator>Islam, Muhammad</dc:creator> <dcterms:rights rdf:resource=""/> <dcterms:hasPart rdf:resource=""/> <dc:contributor>Waldvogel, Marcel</dc:contributor> <dcterms:isPartOf rdf:resource=""/> <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> <dcterms:available rdf:datatype="">2011-05-17T09:34:13Z</dcterms:available> <dc:creator>Waldvogel, Marcel</dc:creator> <dc:language>eng</dc:language> <dcterms:issued>2011-02</dcterms:issued> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:title>Questioning flooding as a routing benchmark in Opportunistic Networks</dcterms:title> </rdf:Description> </rdf:RDF>

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

islam_waldvogel.pdf 331

This item appears in the following Collection(s)

Search KOPS


My Account