Abstract
In the IEEE 802.11 based wireless networks, an adjustment of the Contention Window (CW) is indispensable in order to provide a differentiated quality of service. Distributed Coordination Function (DCF) is a contention-based MAC method which allows to mutually share the common wireless channel. DCF backoff algorithm regulates the size of CW range upon successful transmissions and collisions. Due to wireless medium characteristics and node mobility, estimating pertinent CW range is a very crucial task. This paper proposes Sliding DCF Backoff Algorithm (SDBA) that predicts current medium status using Backoff Success Ratio (BSR). According to this, SDBA slides both CW lower and upper boundaries. To investigate the behavior and capability of the proposed SDBA, extensive NS2 simulations are carried out with varying mobility speed under random topology. It is perceived from the simulation results that the proposed algorithm attains better throughput and significantly reduces collisions, routing control overhead and energy consumption, thereby extending network lifetime.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
