Analyzing History Quality for Routing Purposes in Opportunistic Network Using Max-Flow

Islam, Muhammad Arshad; Waldvogel, Marcel

Analyzing History Quality for Routing Purposes in Opportunistic Network Using Max-Flow

Files

There are no files associated with this item.

Date

2012

Publication type

Journal article

Publication status

Published

Published in

Wireless Engineering and Technology ; 3 (2012), 3. - pp. 132-141. - ISSN 2152-2294. - eISSN 2152-2308

Abstract

Most of the existing opportunistic network routing protocols are based on some type of utility function that is directly or indirectly dependent on the past behavior of devices. The past behavior or history of a device is usually referred to as contacts that the device had in the past. Whatever may be the metric of history, most of these routing protocols work on the realistic premise that node mobility is not truly random. In contrast, there are several oracles based methods where such oracles assist these methods to gain access to information that is unrealistic in the real world. Although, such oracles are unrealistic, they can help to understand the nature and behavior of underlying networks. In this paper, we have analyzed the gap between these two extremes. We have performed max-flow computations on three different opportunistic networks and then compared the results by performing max-flow computations on history generated by the respective networks. We have found that the correctness of the history based prediction of history is dependent on the dense nature of the underlying network. Moreover, the history based prediction can deliver correct paths but cannot guarantee their absolute reliability.

Subject (DDC)

004 Computer Science

Cite This

ISO 690

ISLAM, Muhammad Arshad, Marcel WALDVOGEL, 2012. Analyzing History Quality for Routing Purposes in Opportunistic Network Using Max-Flow. In: Wireless Engineering and Technology. 3(3), pp. 132-141. ISSN 2152-2294. eISSN 2152-2308. Available under: doi: 10.4236/wet.2012.33020

BibTex

@article{Islam2012Analy-44637,
  year={2012},
  doi={10.4236/wet.2012.33020},
  title={Analyzing History Quality for Routing Purposes in Opportunistic Network Using Max-Flow},
  number={3},
  volume={3},
  issn={2152-2294},
  journal={Wireless Engineering and Technology},
  pages={132--141},
  author={Islam, Muhammad Arshad and Waldvogel, Marcel},
  note={Article Number: 21466}
}

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/44637">
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44637"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Islam, Muhammad Arshad</dc:creator>
    <dc:creator>Waldvogel, Marcel</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-21T11:25:48Z</dc:date>
    <dcterms:issued>2012</dcterms:issued>
    <dc:contributor>Waldvogel, Marcel</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-21T11:25:48Z</dcterms:available>
    <dcterms:title>Analyzing History Quality for Routing Purposes in Opportunistic Network Using Max-Flow</dcterms:title>
    <dc:contributor>Islam, Muhammad Arshad</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:abstract xml:lang="eng">Most of the existing opportunistic network routing protocols are based on some type of utility function that is directly or indirectly dependent on the past behavior of devices. The past behavior or history of a device is usually referred to as contacts that the device had in the past. Whatever may be the metric of history, most of these routing protocols work on the realistic premise that node mobility is not truly random. In contrast, there are several oracles based methods where such oracles assist these methods to gain access to information that is unrealistic in the real world. Although, such oracles are unrealistic, they can help to understand the nature and behavior of underlying networks. In this paper, we have analyzed the gap between these two extremes. We have performed max-flow computations on three different opportunistic networks and then compared the results by performing max-flow computations on history generated by the respective networks. We have found that the correctness of the history based prediction of history is dependent on the dense nature of the underlying network. Moreover, the history based prediction can deliver correct paths but cannot guarantee their absolute reliability.</dcterms:abstract>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

Yes