Throughput, delay, and frame loss probability analysis of IEEE 802.11 DCF with M/M/1/K queues

Analytical models of the Distributed Coordination Function (DCF) have numerous applications in the performance analysis of IEEE 802.11 networks. The model proposed in this paper distinguishes itself from existing approaches in that it allows throughput, delay, and frame loss ratio analysis under both saturation and non-saturation network conditions. It combines the Markov chain and the queuing theory to comprehensively and efficiently analyze the DCF channel access procedure assuming finite (M/M/1/K) queues. Additionally, it incorporates advantages of models previously proposed in the literature: correct backoff countdown, proper handling of frames and distinction of the wireless channel blocking probability from the frame blocking probability during the backoff countdown. Furthermore, it is kept reasonably simple to attract network designers. Simulation results validate the correctness of the new model for a variable number of nodes and under different network loads. Additionally, we demonstrate that the new model outperforms three previous models known from the literature.