Performance analysis of EIED backoff algorithm of the IEEE 802.11 MAC under fading channel errors
Tinnarut Panthum, Suvepon Sittichivapark, Jesada Sartthong · 2016
Binary Exponential Backoff (BEB) is the most popular backoff algorithm that is used to compare the numerical results of saturated throughput with other alternative backoff algorithms. In spite of the fact that backoff algorithm under fading channel errors lead to practical application that has higher accurate and better performance, its numerical result of saturated throughput is lower than BEB. In this research, we propose a new discrete time Markov chain model of Exponential Increased Exponential Decreased (EIED) backoff algorithm under fading channel errors, and its numerical result of saturated throughput is better than BEB under fading channel errors. The transmission probabilities are derived in the fixed backoff stage and fixed contention window technique. Our numerical results show that the saturated throughput of EIED under fading channel errors is better and more stable than BEB under fading channel errors when the number of contending station is increased.