@article{Qureshi2010Graph-18741,
  year={2010},
  doi={10.1007/s11277-009-9908-8},
  title={Graph-Theoretic Complexity Reduction for Markovian Wireless Channel Models},
  number={4},
  volume={58},
  issn={0929-6212},
  journal={Wireless Personal Communications},
  pages={831--849},
  author={Qureshi, Hassaan Khaliq and Ahmad, Junaid Jameel and Khayam, Syed Ali and Rakocevic, Veselin and Rajarajan, Muttukrishnan}
}

<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/18741">
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Ahmad, Junaid Jameel</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/18741"/>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Khayam, Syed Ali</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Rajarajan, Muttukrishnan</dc:creator>
    <dcterms:bibliographicCitation>First publ. in: Wireless Personal Communications ; 58 (2011), 4. - S. 831-849</dcterms:bibliographicCitation>
    <dc:language>eng</dc:language>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Rajarajan, Muttukrishnan</dc:contributor>
    <dcterms:issued>2010</dcterms:issued>
    <dc:contributor>Ahmad, Junaid Jameel</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/18741/1/ahmad_graph_theoretic_etal.pdf"/>
    <dc:creator>Qureshi, Hassaan Khaliq</dc:creator>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/18741/1/ahmad_graph_theoretic_etal.pdf"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-06-30T22:25:07Z</dcterms:available>
    <dc:contributor>Rakocevic, Veselin</dc:contributor>
    <dc:contributor>Khayam, Syed Ali</dc:contributor>
    <dc:creator>Rakocevic, Veselin</dc:creator>
    <dcterms:abstract xml:lang="eng">Accurate simulation and analysis of wireless networks are inherently dependent on accurate models which are able to provide real-time channel characterization. High-order Markov chains are typically used to model errors and losses over wireless channels.However, complexity (i.e., the number of states) of a high-order Markov model increases exponentially with the memory-length of the underlying channel. In this paper, we present a novel graphtheoretic methodology that uses Hamiltonian circuits to reduce the complexity of a high-order Markovmodel to a desired state budget.We also demonstrate the implication of unused states in complexity reduction of higher order Markov model. Our trace-driven performance evaluations for real wireless local area network (WLAN) and wireless sensor network (WSN)channels demonstrate that the proposed Hamiltonian Model, while providing orders of magnitude reduction in complexity, renders an accuracy that is comparable to the Markov model and better than the existing reduced state models.</dcterms:abstract>
    <dcterms:title>Graph-Theoretic Complexity Reduction for Markovian Wireless Channel Models</dcterms:title>
    <dc:contributor>Qureshi, Hassaan Khaliq</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-03-09T08:10:04Z</dc:date>
  </rdf:Description>
</rdf:RDF>