Binary Exponential Increment Half Decrement backoff algorithm for IEEE802.11 wireless LANs

Abstract

Backoff algorithm is a technique to reduce packet collisions and to improve throughput efficiency in wireless local area network (WLAN). In this research, we propose a new backoff algorithm which is named Binary Exponential Increment Half Decrement (BEIHD) backoff algorithm. Furthermore, we introduce a new discrete Markov chain model for modeling the performance analysis of wireless local area network. A new model is called the Fixed Backoff stages and Fixed Contention windows (FBFC) technique. In FBFC scheme, the accuracy of the transmission probability parameter is derived from step by step procedure using the global balance equation concept in steady state condition. The saturated throughput efficiency of all backoff algorithms is compared under the same Physical layer (PHY) parameters and Medium Access Control (MAC) scheme in IEEE802.11a/b/g standards. Our numerical results show that the throughput performance of BEIHD backoff algorithm is better than the Binary Exponential Backoff (BEB) algorithm. Moreover, the distinction of BEIHD backoff algorithm is near the realistic system, and it can be implemented without to modify hardware in physical layer.