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 contributionAcademicpeer-review

3 Citations (Scopus)
46 Downloads (Pure)

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 languageUndefined
Title of host publicationThird International Conference on the Quantitative Evaluation of Systems
Place of PublicationLos Alamitos
PublisherIEEE Computer Society
Pages63-72
Number of pages10
ISBN (Print)0769526659
DOIs
Publication statusPublished - 11 Sep 2006
Event3rd International Conference on Quantitative Evaluation of SysTems, QEST 2006 - University of California, Riverside, United States
Duration: 11 Sep 200614 Sep 2006
Conference number: 3
http://www.qest.org/qest2006/

Publication series

Name
PublisherIEEE Computer Society Press
Number2

Conference

Conference3rd International Conference on Quantitative Evaluation of SysTems, QEST 2006
Abbreviated titleQEST
CountryUnited States
CityRiverside
Period11/09/0614/09/06
Internet address

Keywords

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

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 (pp. 63-72). [10.1109/QEST.2006.3] Los Alamitos: IEEE Computer Society. https://doi.org/10.1109/QEST.2006.3
Remke, Anne Katharina Ingrid ; Haverkort, Boudewijn R.H.M. ; Cloth, L. / A versatile infinite-state Markov reward model to study bottlenecks in 2-hop ad hoc networks. Third International Conference on the Quantitative Evaluation of Systems. Los Alamitos : IEEE Computer Society, 2006. pp. 63-72
@inproceedings{d974eb070f114f64ac8b8759011ff0a7,
title = "A versatile infinite-state Markov reward model to study bottlenecks in 2-hop ad hoc networks",
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.",
keywords = "METIS-238164, EWI-6895, IR-66347",
author = "Remke, {Anne Katharina Ingrid} and Haverkort, {Boudewijn R.H.M.} and L. Cloth",
note = "10.1109/QEST.2006.3",
year = "2006",
month = "9",
day = "11",
doi = "10.1109/QEST.2006.3",
language = "Undefined",
isbn = "0769526659",
publisher = "IEEE Computer Society",
number = "2",
pages = "63--72",
booktitle = "Third International Conference on the Quantitative Evaluation of Systems",
address = "United States",

}

Remke, AKI, Haverkort, BRHM & 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., 10.1109/QEST.2006.3, IEEE Computer Society, Los Alamitos, pp. 63-72, 3rd International Conference on Quantitative Evaluation of SysTems, QEST 2006, Riverside, United States, 11/09/06. https://doi.org/10.1109/QEST.2006.3

A versatile infinite-state Markov reward model to study bottlenecks in 2-hop ad hoc networks. / Remke, Anne Katharina Ingrid; Haverkort, Boudewijn R.H.M.; Cloth, L.

Third International Conference on the Quantitative Evaluation of Systems. Los Alamitos : IEEE Computer Society, 2006. p. 63-72 10.1109/QEST.2006.3.

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

TY - GEN

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

AU - Remke, Anne Katharina Ingrid

AU - Haverkort, Boudewijn R.H.M.

AU - Cloth, L.

N1 - 10.1109/QEST.2006.3

PY - 2006/9/11

Y1 - 2006/9/11

N2 - 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.

AB - 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.

KW - METIS-238164

KW - EWI-6895

KW - IR-66347

U2 - 10.1109/QEST.2006.3

DO - 10.1109/QEST.2006.3

M3 - Conference contribution

SN - 0769526659

SP - 63

EP - 72

BT - Third International Conference on the Quantitative Evaluation of Systems

PB - IEEE Computer Society

CY - Los Alamitos

ER -

Remke AKI, Haverkort BRHM, Cloth L. 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. Los Alamitos: IEEE Computer Society. 2006. p. 63-72. 10.1109/QEST.2006.3 https://doi.org/10.1109/QEST.2006.3