Publikation: Prediction quality of contact history in opportunistic networks
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
Routing in opportunistic networks heavily relies on past behavior of the mobile devices it is formed of to predict their future and thus making routing decisions. While almost every protocol relies on this history, its prediction quality has never been studied in a realistic setting. Using extensive simulations on real traces, we are able to describe for the first time how well predictions can be. Unlike oracle-based prediction comparisons, we do not try to predict a contact, but compare the expected user result, namely message delivery probabilities. The analysis also provides guidance on the importance of multi-path routing and the path diversity required, as well as on the impact on forward error correction on the delivery probability. Our results show that the repetitive nature of path is directly proportional to the mobility extent of the devices and, consequently, history obtained from dense opportunistic networks is reliable.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
ISLAM, Muhammad Arshad, Marcel WALDVOGEL, 2011. Prediction quality of contact history in opportunistic networks. 2011 IFIP Wireless Days (WD). Niagara Falls, ON, Canada, 10. Okt. 2011 - 12. Okt. 2011. In: 2011 IFIP Wireless Days (WD). IEEE, 2011, pp. 1-3. ISBN 978-1-4577-2027-7. Available under: doi: 10.1109/WD.2011.6098154BibTex
@inproceedings{Islam2011-10Predi-18077, year={2011}, doi={10.1109/WD.2011.6098154}, title={Prediction quality of contact history in opportunistic networks}, isbn={978-1-4577-2027-7}, publisher={IEEE}, booktitle={2011 IFIP Wireless Days (WD)}, pages={1--3}, 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/18077"> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/18077/2/Islam.pdf"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/18077"/> <dcterms:bibliographicCitation>First publ. in: 2011 IFIP Wireless Days Conference (WD) : Niagara Falls, ON, Canada / Wireless Days Conference <4, 2011, Niagara Falls, Ontario>. - Piscataway, N.J. : IEEE, 2011. - pp. 1-3. - ISBN 978-1-4577-2026-0</dcterms:bibliographicCitation> <dc:language>eng</dc:language> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:creator>Islam, Muhammad Arshad</dc:creator> <dc:creator>Waldvogel, Marcel</dc:creator> <dc:contributor>Waldvogel, Marcel</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-02-09T11:00:04Z</dcterms:available> <dcterms:abstract xml:lang="eng">Routing in opportunistic networks heavily relies on past behavior of the mobile devices it is formed of to predict their future and thus making routing decisions. While almost every protocol relies on this history, its prediction quality has never been studied in a realistic setting. Using extensive simulations on real traces, we are able to describe for the first time how well predictions can be. Unlike oracle-based prediction comparisons, we do not try to predict a contact, but compare the expected user result, namely message delivery probabilities. The analysis also provides guidance on the importance of multi-path routing and the path diversity required, as well as on the impact on forward error correction on the delivery probability. Our results show that the repetitive nature of path is directly proportional to the mobility extent of the devices and, consequently, history obtained from dense opportunistic networks is reliable.</dcterms:abstract> <dcterms:title>Prediction quality of contact history in opportunistic networks</dcterms:title> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:rights>terms-of-use</dc:rights> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-02-09T11:00:04Z</dc:date> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:issued>2011-10</dcterms:issued> <dc:contributor>Islam, Muhammad Arshad</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/18077/2/Islam.pdf"/> </rdf:Description> </rdf:RDF>