Admission Control and Scheduling of Isochronous and Asynchronous Traffic in IEEE 802.11ad MAC

The next generation WiFi such as IEEE 802.11ad and 802.11ay can provide stringent Quality of Service (QoS) due to its support of contention free channel access called Service Period. IEEE 802.11ad supports two types of user traffic: isochronous and asynchronous. These user traffic need guaranteed Service Period duration before their periods. Hence, admission control plays an important role in an IEEE 802.11ad system. In an earlier work we studied admission control only for isochronous requests. In this paper, we present admission control and scheduling algorithms which can handle both types of requests. We devise a proportional fair and linear run time complexity algorithm that treats asynchronous requests as periodic requests, because of which it overallocates resources to the asynchronous requests. The conditions of possible performance loss due to this overallocation are analyzed. We provide detailed simulation results which show that presence of asynchronous request degrades performance of isochronous requests in terms of number of admitted requests and channel utilization. But, the smaller number of admitted isochronous requests perform better in terms of channel allocation time and delay.