An efficient scheduling and admission control algorithm for IEEE 802.11e WLAN

  • Authors:
  • Geun-Hyuk Yang;Jin-Chul Choi;Se-Jin Oh;Chae-Woo Lee

  • Affiliations:
  • Ajou University, Suwon, Korea;Ajou University, Suwon, Korea;Ajou University, Suwon, Korea;Ajou University, Suwon, Korea

  • Venue:
  • Proceedings of the 2nd international conference on Ubiquitous information management and communication
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

IEEE 802.11e is being proposed to improve QoS (Quality of Service) by IEEE 802.11 working group. HCCA (HCF Controlled Channel Access), a centralized polling based mechanism of IEEE 802.11e, needs a scheduling algorithm that decides on how the available radio resources are allocated to the polled stations. In IEEE 802.11e a standard Reference Scheduler is presented. The Reference Scheduler polls all stations in a polling list by the same interval which causes ineffectively frequent polling. It increases the overhead and also decreases the TXOP (Transmission Opportunity) utilization. In this paper, we propose a scheduling and admission control algorithm that polls stations depending on the MSI (Maximum Service Interval) of stations in order to solve these shortcomings. In our proposed algorithm a station is polled by an interval close to its MSI, thus polling overhead decreases and TXOP utilization increases in comparison to those of the Reference Scheduler. Simulation results show that our algorithm outperforms the Reference Scheduler. Our algorithm maintains higher aggregated throughput and serves more stations than the Reference Scheduler.