IEICE Transactions on Communications
Online ISSN : 1745-1345
Print ISSN : 0916-8516
Regular Section
A Binary Tree Scheduling and Admission Control Algorithm for IEEE 802.11e WLANs
Dong-Yul LEEGeun-Hyuk YANGChae-Woo LEE
著者情報
ジャーナル 認証あり

2012 年 E95.B 巻 8 号 p. 2654-2657

詳細
抄録
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.
著者関連情報
© 2012 The Institute of Electronics, Information and Communication Engineers
前の記事 次の記事
feedback
Top