Abstract
A contention-based access scheme, Distributed Coordination Function (DCF), is the basic access technology and it works as the basis for 802.11 MAC and its extensions. Using the Carrier-Sense Multiple Access with Collision Avoidance (CSMA/CA) mechanism and the Binary Exponential Backoff (BEB) mechanism, DCF can efficiently avoid multiple stations to transmit data at the same time and thus reduces the collision probability. In addition to BEB, Exponential Increase Exponential Decrease (EIED) is another well known backoff mechanism to avoid retransmission collision. In literature, many researches show that BEB algorithm may result in a poor throughput in a heavy load environment, while the EIED scheme does not perform as well as BEB under a light traffic condition. The emphasis of this paper is to address the shortcomings of the above two schemes and pose a solution to select a better random backoff timer in order to maximize the throughput under various traffic load. In this work, a novel backoff mechanism, Optimal Backoff (OB) mechanism, is proposed. OB can choose an optimal contention window according to current traffic conditions. Analytical and simulation results show that proposed Optimal Backoff mechanism always has highest throughput and lowest packet delay than those of the BEB and EIED mechanisms under both light and heavy traffic scenarios. With the deployment of the proposed OB, we believe that Wireless LAN is able to work perfectly as an extension of legacy mobile networks in t he context of upcoming Next Generation Networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.