Admission Control and Scheduling of Isochronous Traffic With Guard Time in IEEE 802.11ad MAC

Published

December 1, 2023

Author(s)

Anirudha Sahoo, Weichao Gao, Tanguy Ropitault, Nada T. Golmie

Abstract

An upsurge of low latency and bandwidth hungry applications such as virtual reality, augmented reality and availability of unlicensed spectrum in the mmWave band at 60 GHz have led to standardization of the next generation WiFi such as IEEE 802.11ad and 802.11ay. Due to the stringent Quality of Service (QoS) requirement of those applications, 802.11ad/ay have introduced contention free channel access called Service Period, which provides dedicated channel access exclusively reserved for communication between a pair of nodes. One type of user traffic supported by IEEE 802.11ad is isochronous traffic, which is essentially periodic traffic that requires certain channel time to be allocated before its period ends. So, isochronous traffic needs guaranteed channel time allocation with stringent deadlines. In this paper, we present three Admission Control Algorithms (ACAs) which admit isochronous requests to achieve the above goals while being fair. We also present an Earliest Deadline First (EDF) based scheduling algorithm for isochronous traffic. We evaluate the performance of the three ACAs in terms of different performance metrics. Our simulation results show that, out of the three ACAs, the proportional fair allocation based algorithm offers the best tradeoff across different performance metrics.

Citation

IEEE Transactions on Mobile Computing

Volume

22

Issue

12

Pub Type

Journals

Download Paper

https://doi.org/10.1109/TMC.2022.3207969

Local Download

Citation

Sahoo, A. , Gao, W. , Ropitault, T. and Golmie, N. (2023), Admission Control and Scheduling of Isochronous Traffic With Guard Time in IEEE 802.11ad MAC, IEEE Transactions on Mobile Computing, [online], https://doi.org/10.1109/TMC.2022.3207969, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=933105 (Accessed May 21, 2025)