Title
A Binary Tree Scheduling And Admission Control Algorithm For Ieee 802.11e Wlans
Abstract
In the IEEE 802.11e standard, a reference scheduler is presented. The reference scheduler uses the same service interval (SI) to poll all stations in a polling list, and uses separate scheduling and admission algorithms. This increases the polling overhead and decreases TXOP utilization. Many papers have attempted to enhance the reference scheduler, but its admission control is similar to reference scheduler. In this paper, we propose a scheduling and admission algorithm that assigns each station an SI close to its maximum SI (MSI). As a result, the proposed algorithm shows higher performance than that of the reference scheduler.
Year
DOI
Venue
2012
10.1587/transcom.E95.B.2654
IEICE TRANSACTIONS ON COMMUNICATIONS
Keywords
DocType
Volume
IEEE 802.11e, HCCA, reference scheduler, MSI
Journal
E95B
Issue
ISSN
Citations 
8
0916-8516
0
PageRank 
References 
Authors
0.34
4
3
Name
Order
Citations
PageRank
Dong-Yul Lee1238.96
Geun-Hyuk Yang210.72
Chaewoo Lee333127.28