Delay analysis of different backoff algorithms in IEEE 802.11

We use a newly developed analytical model to compute the average delay of the existing binary exponential backoff (BEB) algorithm in IEEE 802.11 wireless LAN and two different proposals, exponential increase exponential decrease (EIED) and exponential increase linear decrease (EILD) backoff algorithms. A one-dimensional Markov chain model is constructed for each algorithm and used to compare delay under saturation conditions. Our approach simplifies previous analyses of the BEB algorithm which used a 2-dimensional Markov chain model, while the other backoff algorithm delays have not been analyzed before. Additionally, improvements have been made to the previous analysis of BEB to achieve more accurate results. Analytical results are compared to those obtained from simulation.