A Generalized Markov Chain Model for IEEE 802.11 Distributed Coordination Function

Abstract

To improve the accuracy and enhance the applicability of existing models, this paper proposes a generalized Markov chain model for IEEE 802.11 Distributed Coordination Function (DCF) under the widely adopted assumption of ideal transmission channel. The IEEE 802.11 DCF is modeled by a two dimensional Markov chain, which takes into account unsaturated traffic, backoff freezing, retry limits, the difference between maximum retransmission count and maximum backoff exponent, and limited buffer size based on the M/G/1/K queuing model. We show that existing models can be treated as special cases of the proposed generalized model. Furthermore, simulation results validate the accuracy of the proposed model.

Analytical Study of the Distance Change on IEEE 802.11ah Standard using Markov Chain Model

“…The C was expressed the packet length consequently, AP schedules the Resource Allocation frame was transmitted at the beginning of the RAW with the channel access rules [18], [28].…”

“…Throughput can be calculated using the following equation [21]: S = P s P tr lpayload (1− P tr )σ + P tr P s T s + P tr (1− P s ) T c (7) Where, σ is the slot duration, Ts is the time needed for the transmission to be successful, Tc is collisions time, Ptr is the probability that at least one transmission has occurred during the slot time, and Ps is defined as the probability of successful transmission. The values of Ptr, Ps, Ts, and Tc were calculated using the following equation [21], [28]:…”