For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Binary Tree Scheduling and Admission Control Algorithm for IEEE 802.11e WLANs
Dong-Yul LEE Geun-Hyuk YANG Chae-Woo LEE
IEICE TRANSACTIONS on Communications
Publication Date: 2012/08/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: LETTER
IEEE 802.11e, HCCA, reference scheduler, MSI,
Full Text: PDF>>
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.