Abstract
In this paper, based on the classic WRR (weighted round robin) discipline, we propose an efficient real-time traffic scheduling algorithm for WLAN (wireless local area networks). Our algorithm operates at link layer level, and is coupled closely with DCF (distributed coordinate function). Through that, the HOL (head of line) blocking problem is alleviated. With compensation for mobile users experiencing burst channel error, we achieve long-term fairness approximately. Extensive simulations are performed using NS (network simulator). The results show that our algorithm is simple, and improves the channel utilization and data throughput effectively. The average packet delay is also decreased.
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.
