An efficient real-time traffic scheduling algorithm in wireless networks
Zenghua Zhao, Lianfang Zhang, Liping Hao, Yantai Shu · 2004
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.