By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Remke, A. ; Twente Univ., Enschede ; Haverkort, B.R. ; Cloth, L.

In a 2-hop IEEE 801.11-based wireless LAN, the distributed coordination junction (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

Published in:

Quantitative Evaluation of Systems, 2006. QEST 2006. Third International Conference on

Date of Conference:

11-14 Sept. 2006