A versatile infinite-state Markov reward model to study bottlenecks in 2-hop ad hoc networks

Anne Katharina Ingrid Remke, Boudewijn R.H.M. Haverkort, L. Cloth

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

3 Citations (Scopus)

Abstract

In a 2-hop IEEE 801.11-based wireless LAN, the distributed coordination function (DCF) tends to equally share the available capacity among the contending stations. Recently alternative capacity sharing strategies have been made possible. We propose a versatile infinite-state Markov reward model to study the bottleneck node in a 2-hop IEEE 801.11-based ad hoc network for different adaptive capacity sharing strategies. We use infinite-state stochastic Petri nets (iSPNs) to specify our model, from which the underlying QBD-type Markov-reward models are automatically derived. The impact of the different capacity sharing strategies is analyzed by CSRL model checking of the underlying infinite-state QBD, for which we provide new techniques. Our modeling approach helps in deciding under which circumstances which adaptive capacity sharing strategy is most appropriate.
Original languageEnglish
Title of host publicationThird International Conference on the Quantitative Evaluation of Systems - (QEST'06)
Place of PublicationLos Alamitos
PublisherIEEE Computer Society
Number of pages10
ISBN (Print)0769526659
DOIs
Publication statusPublished - 11 Sep 2006
Externally publishedYes
EventInternational Conference on the Quantitative Evaluation of Systems - Riverside, United States
Duration: 11 Sep 200614 Sep 2006
Conference number: 3
http://www.qest.org/qest2006/

Conference

ConferenceInternational Conference on the Quantitative Evaluation of Systems
Abbreviated titleQUEST'06
CountryUnited States
CityRiverside
Period11/09/0614/09/06
Internet address

Keywords

  • METIS-238164
  • EWI-6895
  • IR-66347

Fingerprint Dive into the research topics of 'A versatile infinite-state Markov reward model to study bottlenecks in 2-hop ad hoc networks'. Together they form a unique fingerprint.

  • Cite this

    Remke, A. K. I., Haverkort, B. R. H. M., & Cloth, L. (2006). A versatile infinite-state Markov reward model to study bottlenecks in 2-hop ad hoc networks. In Third International Conference on the Quantitative Evaluation of Systems - (QEST'06) IEEE Computer Society. https://doi.org/10.1109/QEST.2006.3