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

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