M.R.M. Rizk, M.I. Dessouky, S.A. El-Dolil, and M. Abd-Elnaby
Backoff algorithm, backoff interval, BEB scheme, random access
The main challenge in designing a good random access schemes is how to maximize the channel throughput while improves the fairness of random access channels. In this paper, we propose a new backoff algorithm to improve the fairness of random access channels while achieves high channel throughput. A novel feature of the proposed backoff algorithm is that every node modifies its backoff interval according to the number of retransmission attempts. So that, each active node increases (decreases) its backoff interval in case of collision (successful transmission) by a factor which exponentially decreases as the number of retransmission (previous retransmission) attempts increases. Also, the backoff interval is controlled according to the channel offered traffic using fuzzy controller to maximize the channel throughput. A computer simulation is developed using MATLAB to evaluate the performance of the proposed backoff algorithm and compare it with the Binary exponential backoff (BEB) scheme which is widely used due to its high channel throughput while its fairness is relatively poor. It is shown that the proposed backoff algorithm out-performs the BEB scheme in terms of improving the fairness of random access channels while achieving high channel throughput and even slightly higher than that of BEB scheme.
Important Links:
Go Back
