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

Dong-Yul LEE; Geun-Hyuk YANG; Chae-Woo LEE

doi:10.1587/transcom.E95.B.2654

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

Dong-Yul LEE, Geun-Hyuk YANG, Chae-Woo LEE

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E95-B No.8 pp.2654-2657

Publication Date: 2012/08/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E95.B.2654

Type of Manuscript: LETTER

Category: Network

Cite this

Copy

Dong-Yul LEE, Geun-Hyuk YANG, Chae-Woo LEE, "A Binary Tree Scheduling and Admission Control Algorithm for IEEE 802.11e WLANs" in IEICE TRANSACTIONS on Communications, vol. E95-B, no. 8, pp. 2654-2657, August 2012, doi: 10.1587/transcom.E95.B.2654.
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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.2654/_p

Copy

@ARTICLE{e95-b_8_2654,
author={Dong-Yul LEE, Geun-Hyuk YANG, Chae-Woo LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={A Binary Tree Scheduling and Admission Control Algorithm for IEEE 802.11e WLANs},
year={2012},
volume={E95-B},
number={8},
pages={2654-2657},
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.},
keywords={},
doi={10.1587/transcom.E95.B.2654},
ISSN={1745-1345},
month={August},}

Copy

TY - JOUR
TI - A Binary Tree Scheduling and Admission Control Algorithm for IEEE 802.11e WLANs
T2 - IEICE TRANSACTIONS on Communications
SP - 2654
EP - 2657
AU - Dong-Yul LEE
AU - Geun-Hyuk YANG
AU - Chae-Woo LEE
PY - 2012
DO - 10.1587/transcom.E95.B.2654
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2012
AB - 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.
ER -