A Binary Tree Scheduling and Admission Control Algorithm for IEEE 802.11e WLANs

概要

論文の詳細を見る
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.
The Institute of Electronics, Information and Communication Engineersの論文
2012-08-01