A simple mathematical model for performance evaluation of finite buffer size nodes in non- saturated IEEE 802.11 DCF in Ad Hoc networks

Abstract

Analytical models help in predicting the change in results once the input parameters of the networks are changed. A lot of modeling work has already been carried out to evaluate the performance of IEEE 802.11 DCF for both saturated networks and non-saturated networks. Most of work considering the arbitrary buffer size nodes in non-saturated conditions uses complex mathematically approach. In the current paper, we present a flexible and practical transform-free approach for evaluating the performance of IEEE 802.11 MAC protocol. The simplicity and fastness of our algorithm is due to the simple closed form expressions to determine idle probability of buffer and blocking probability of buffer with size K assuming each node as a discrete M/G/1/K queue. The proposed model gives accurate results which are validated through ns2 simulations.