Providing Delay Guarantees to Time-Sensitive Traffic by Scheduling using OFDMA with Deadline Estimation While Avoiding Best-Effort Traffic Starvation
Keywords:
deadline; 802.11ax; OFDMA; scheduling; WLANs; time-sensitive networking; best-effort traffic; resource allocation; starvationAbstract
OFDMA is introduced to WLANs in the ax amendment of the IEEE 802.11 standard. It makes the WLAN a closed-loop system, where AP assigns OFDMA resource units to the STAs for uplink transmissions. The scheduling algorithms generally optimize throughput by minimizing upload time. For time-sensitive traffic, the time-critical packets that miss their deadlines become useless, even if overall upload time is minimized. To provide schedules that prioritize the STAs for transmission whose traffic has earlier deadlines, the AP needs to know the packet deadlines in the queue of each STA. Since STAs do not provide any information on the expiration time of the packets they send to the AP, we give an algorithm to estimate on the AP side the deadlines of HOL packets waiting at STAs and make a scheduling decision that minimizes the number of packets dropped due to expired deadlines. In doing so, the best-effort traffic is also scheduled to prevent its starvation. Compared to the number of packet drops with the traditional approach of throughput optimization, our approach shows up to a six-fold reduction in packet drops due to missed deadlines at the STAs. Our approach also avoids starvation of the best-effort traffic.
Downloads
References
[std (2019)] 2019. IEEE Draft Standard for Information Technology – Telecommunications and Information Exchange Between Systems Local and Metropolitan Area Networks – Specific Requirements Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications Amendment Enhancements for High-Efficiency WLAN. IEEE P802.11ax/D6.0, November 2019 (2019), 1–780.
[Aboul-Magd (2008)] O. S. Aboul-Magd. 2008. IEEE Standard 802.11 Overview.
[Arshad (2015)] K. Arshad. 2015. LTE system level performance in the presence of CQI feedback uplink delay and mobility. In 2015 International Conference on Communications, Signal Processing, and their Applications (ICCSPA’15). 1–5.
[Avallone (2020)] Stefano Avallone. ns-3-11ax gitlab repository. https://gitlab.com/stavallo/ ns-3-11ax, n.d. Accessed: 2020-11-23.
[Bankov et al. (2018)] D. Bankov, A. Didenko, E. Khorov, and A. Lyakhov. 2018. OFDMA Uplink Scheduling in IEEE 802.11ax Networks. In 2018 IEEE International Conference on Communications (ICC). 1–6.
[Chen et al. (2017)] Y. Chen, X. Wang, and L. Cai. 2017. Head-of-Line Access Delay-Based Scheduling Algorithm for Flow-Level Dynamics. IEEE Transactions on Vehicular Technology 66, 6 (2017), 5387–5397.
[Ferng et al. (2019)] H. Ferng, C. Lee, J. Huang, and Y. Liang. 2019. UrgencyBased Fair Scheduling for LTE to Improve Packet Loss and Fairness: Design and Evaluation. IEEE Transactions on Vehicular Technology 68, 3 (2019), 2825–2836.
[Harchol-Balter (2013)] Mor Harchol-Balter. 2013. Performance Modeling and Design of Computer Systems: Queueing Theory in Action (1st ed.). Cambridge University Press, USA.
[Inamullah et al. (2020)] Inamullah, Muhammad & Raman, Bhaskaran & Akhtar, Nadeem. (2020). Will My Packet Reach On Time? Deadline-Based Uplink OFDMA Scheduling in 802.11ax WLANs. 181-189. 10.1145/3416010.3423232.
[Kanagasabai and Nayak (2015)] Aswin Kanagasabai and Amiya Nayak. 2015. Opportunistic dual metric scheduling algorithm for LTE uplink. In 2015 IEEE International Conference on Communication Workshop (ICCW). IEEE, 1446–1451.
[Kleinberg and Tardos (2005)] Jon Kleinberg and Eva Tardos. 2005. Algorithm Design. Addison-Wesley Longman Publishing Co., Inc., USA.
[Kushner and Whiting (2002)] Harold J Kushner and Philip A Whiting. 2002. Asymptotic properties of proportional-fair sharing algorithms. Technical Report. BROWN UNIV PROVIDENCE RI DIV OF APPLIED MATHEMATICS.
[Little (1961)] John D. C. Little. 1961. A Proof for the Queuing Formula: L = λW. Oper. Res. 9, 3 (June 1961), 383–387. https://doi.org/10.1287/opre.9.3.383
[ns-3 (2020)] NS-3 Consortium. ns-3 documentation. https://www.nsnam.org/, n.d. Accessed: 2020-11-23.
[R. Porat and et al. (2020)] S. Merlin R. Porat, M Fischer and et al. 2020. 11ax evaluation methodology. (2020), 1–48. https://mentor.ieee.org/802.11/dcn/14/11-14-0571-12-00ax-evaluationmethodology.docx
[Ruiz de Temino et al. (2008)] L. A. M. Ruiz de Temino, G. Berardinelli, S. Frattasi, and P. Mogensen. 2008. Channel-aware scheduling algorithms for SCFDMA in LTE uplink. In 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications. 1–6.
[Su and Hwang (2016)] R. Su and I. Hwang. 2016. Efficient resource allocation scheme with grey relational analysis for the uplink scheduling of 3GPP LTE networks. In 2016 IEEE International Conference on Industrial Technology (ICIT). 599–603.
[Vergès (2020)] François Vergès. Mcs table (updated with 802.11ax data rates). https://www.semfionetworks.com /blog/mcs-table-updated-with-80211ax-data-rates, 2020. Accessed: 2020-11-23.
[Wlanpedia (2020)] Wlanpedia. He data rate. https://www.wlanpedia.org/tech/11ax/ 11ax-datarate/, 2020. Accessed: 2020-11-23.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Muhammad Inamullah
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.
