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


Share/Save/Bookmark

Remke, Anne and Haverkort, Boudewijn R. and Cloth, Lucia (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, 11-14 September 2006, Riverside, CA, USA.

[img]
Preview
PDF
186Kb
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.
Item Type:Conference or Workshop Item
Copyright:© 2006 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66347
Official URL:http://dx.doi.org/10.1109/QEST.2006.3
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 238164