ArticlePublisher preview available

Performance evaluation of OFDMA and aggregation downlink stateless service disciplines in Wi-Fi networks

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract and Figures

Aggregation and Orthogonal Frequency Division Multiple Access (OFDMA) are two fundamental features allowing access points and stations to benefit from the high physical transmission rates of the recent WiFi standards. They aim to pool frames with a unique overhead (mainly the physical header and the acknowledgment) to mitigate its impact on the throughput. Natural implementations of these features lead to nonFIFO (First In, First Out) service disciplines that may generate unfairness between frames. In this paper, we evaluate three stateless service disciplines that require a low level of resources (computation and memory). We prove that when OFDMA does not introduce additional delay, one of these greedy algorithms minimizes the overhead. Whereas this service discipline maximizes the system capacity, it generates strong unfairness between the stations. Instead, the two other algorithms may offer a good trade-off between capacity and fairness. These algorithms are evaluated through a theoretical framework and simulations that replay actual Wi-Fi traces.
This content is subject to copyright. Terms and conditions apply.
ORIGINAL PAPER
Performance evaluation of OFDMA and aggregation downlink
stateless service disciplines in Wi-Fi networks
Anh Tuan Giang
2
Anthony Busson
1
Accepted: 27 January 2024 / Published online: 27 February 2024
The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024
Abstract
Aggregation and Orthogonal Frequency Division Multiple Access (OFDMA) are two fundamental features allowing access
points and stations to benefit from the high physical transmission rates of the recent WiFi standards. They aim to pool
frames with a unique overhead (mainly the physical header and the acknowledgment) to mitigate its impact on the
throughput. Natural implementations of these features lead to nonFIFO (First In, First Out) service disciplines that may
generate unfairness between frames. In this paper, we evaluate three stateless service disciplines that require a low level of
resources (computation and memory). We prove that when OFDMA does not introduce additional delay, one of these
greedy algorithms minimizes the overhead. Whereas this service discipline maximizes the system capacity, it generates
strong unfairness between the stations. Instead, the two other algorithms may offer a good trade-off between capacity and
fairness. These algorithms are evaluated through a theoretical framework and simulations that replay actual Wi-Fi traces.
Keywords Wi-Fi Scheduling Service discipline OFDMA Aggregation Performance evaluation
1 Introduction
The new Wi-Fi standards, formally the family of IEEE
802.11 standards, continuously improve Wi-Fi networks
from the physical to the MAC layers. Over the years, the
physical transmission rate (at which data is transmitted) has
increased from 1 to 2 Mbit/s up to several Gbit/s for the
last standards. Such transmission rates made the procedure
to access the medium the bottleneck that limits the
throughput as it can be longer than the data transmission
itself. A new feature has then been brought in Wi-Fi 4,
frames aggregation, which pools several frames intended
for the same destination together with a unique access
procedure mitigating its effect on the throughput. More
recently, Orthogonal Frequency Multiple Access
(OFDMA) has been defined in the two recent standards
IEEE 802.11ax (Wi-Fi 6) and IEEE 802.11be. Its purpose
is also to pool several frames together, even if their des-
tinations differ. Basically, OFDMA allocates a subset of
the sub-carries that compose the channel to each frame.
The frames are then sent in parallel with a unique medium
access procedure. These two features definitely improve
the throughput that the Wi-Fi network can reach. However,
aggregation and OFDMA may change the transmission
order regarding the arrival of the frames in the buffer, i.e.,
use a non-FIFO discipline to pool a maximum of frames
together. This change may generate unfairness between the
frames and increase the delay spent in the buffer for certain
frames.
We can make the analogy with a queue in a supermarket
where, for each customer, the cashier begins with a small
chit-chat, scans the products, prints the bill, and waits for
the payment. The technology makes the scans of the
products very fast, and the associated time becomes neg-
ligible with regard to the overhead (chit-chat, bill, and
payment). The idea is then to pool several customers with
only one chit-chat, bill, and payment. However, all cus-
tomers cannot be pooled together. It depends on some
&Anthony Busson
anthony.busson@ens-lyon.fr
Anh Tuan Giang
giang-anh.tuan@usth.edu.vn
1
Laboratoire de l’informatique du Paralle
´lisme, UMR 5668
University Lyon 1 - ENS de Lyon - UCBL - CNRS - Inria,
Lyon, France
2
University of Science and Technology of Hanoi, Vietnam
Academy of Science and Technology, Hanoi, Vietnam
123
Wireless Networks (2024) 30:2571–2587
https://doi.org/10.1007/s11276-024-03689-2(0123456789().,-volV)(0123456789().,-volV)
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
The IEEE 802.11ax (Wi-Fi 6) and IEEE 802.11be (Wi-Fi 7) adopt the OFDMA technology to provide high-speed and uninterrupted communications in the dense network. Until the advent of IEEE 802.11ax standard, Wireless LAN (WLAN) predominantly uses the Random Access (RA) mechanism to access the network. IEEE 802.11ax and IEEE 802.11be (proposed) provide another access mechanism for WLAN (i.e., Wi-Fi), which is known as Scheduled Access (SA). This mechanism utilizes the OFDMA technology to provide high-speed and smooth communications in congested areas. By the way, the performance of the OFDMA-based wireless LAN largely depends on the scheduling protocol. Many researchers propose RA and SA protocols independently, which do not consider the simultaneous implementation of both mechanisms. This paper proposes a Proportional Resource Scheduling (PRS) scheme for the OFDMA-based wireless LAN that simultaneously implements RA and SA mechanisms for data transmission. We design two algorithms for the resource scheduling for the PRS protocol. Algorithm 1 provides the initial scheduling information, which is received by Algorithm 2 as the input. After performing revision, Algorithm 2 provides the final scheduling information to the access point. The PRS distributes the channel resources proportionally to the stations according to their available loads. Thus, it utilizes the resources efficiently and increases the throughput and fairness in accessing the channel. We construct analytical models both for the SA and RA mechanisms and conduct rigorous simulations to measure the efficiency of the PRS protocol. The analyses validate the robustness of the proposed protocol in throughput, goodput, fairness, and retransmissions. The main contribution of the proposed protocol is that it provides a framework for simultaneous implementation of RA and SA mechanisms for the future wireless LAN.
Article
Full-text available
The IEEE 802.11ax standard, which realizes multi-user transmission based on orthogonal frequency division multiple access (OFDMA), has been highlighted as a key technology to meet high future demand for Wi-Fi systems. Since this standard is still being developed, performance analysis through mathematical modeling is of paramount importance; however, existing studies have several limitations. Firstly, most of these consider only the saturation network throughput, whereas for 802.11ax in particular, the access delay of the nodes needs to be studied carefully, since they no longer acquire the medium independently but depend solely on the access point's (AP's) schedule. Secondly, since the network performance may be affected to a greater extent by legacy nodes than by 802.11ax nodes, it is desirable to consider various heterogeneous cases of networks with existing legacy nodes. In this paper, a new analytical framework for the 802.11ax MAC protocol is provided. Markov-chain-based models are developed to represent the behavior of the 802.11ax nodes, and both non-saturated traffic conditions and co-existence with the legacy nodes are considered. Through both analysis and MATLAB simulations, it is shown that the proposed model accurately evaluates the throughput and the delay performance under various network conditions.
Article
Full-text available
While celebrating the 21st year since the very first IEEE 802.11 “legacy” 2 Mbit/s wireless Local Area Network standard, the latest Wi-Fi newborn is today reaching the finish line, topping the remarkable speed of 10 Gbit/s. IEEE 802.11ax was launched in May 2014 with the goal of enhancing throughput-per-area in high-density scenarios. The first 802.11ax draft versions, namely D1.0 and D2.0, were released at the end of 2016 and 2017. Focusing on a more mature version D3.0, in this tutorial paper, we help the reader to smoothly enter into the several major 802.11ax breakthroughs, including a brand new OFDMA-based random access approach as well as novel spatial frequency reuse techniques. In addition, this tutorial will highlight selected significant improvements (including PHY enhancements, MU-MIMO extensions, power saving advances, and so on) which make this standard a very significant step forward with respect to its predecessor 802.11ac.
Conference Paper
Full-text available
In the modern world, a high-speed wireless Internet connection is a necessity rather than a luxury. To improve the efficiency of Wi-Fi networks in dense deployment, a novel amendment to the Wi-Fi standard, namely IEEE 802.11ax introduces Orthogonal frequency-division multiple access (OFDMA). In contrast to legacy Wi-Fi, where performance of a station to a considerable degree depends on rate control, aggregation and other decision-making algorithms implemented at the station, in 11ax networks it is the access point that schedules channel time and specifies transmission parameters for both uplink and downlink. Although OFDMA scheduling in 11ax has much in common with that in cellular networks, e.g. LTE, 11ax has some peculiarities, especially for uplink transmission. Focusing on such peculiarities, in this paper, we investigate the scheduling problem in 11ax, propose a set of schedulers for 11ax, compare their performance and determine the gain achievable by the usage of OFDMA.
Conference Paper
Full-text available
IEEE 802.11ax is the upcoming standard of the IEEE 802.11 wireless local area networks (WLAN) family. Until its most recent standard, i.e. 802.11ac, the primary focus of the 802.11 Working Group has been to increase the overall through-put of the physical (PHY) layer using innovative mechanisms such as multiuser multiple input multiple output (MU-MIMO), higher order modulation and coding schemes etc. However, these PHY layer gains often fail to translate to high throughput at the medium access control (MAC) layer, particularly in dense deployment scenarios. To address this limitation, IEEE 802.11ax introduces new features, most notably the use of Orthogonal Frequency Division Multiple Access (OFDMA), thereby enabling concurrent MU transmissions. In this paper, we first provide an overview of the uplink MU OFDMA in IEEE 802.11ax. Second, we provide an analytical model for characterizing the performance of the 802.11ax MAC layer. We investigate the trade-off between providing high network throughput and supporting new users using a metric-namely, BSR delivery rate. Finally, we validate our analyses using extensive NS-3 simulations, and present the resulting findings.
Article
With the introduction of Orthogonal Frequency Division Multiple Access (OFDMA) in 802.11ax, the role of the Access Point (AP) in Wi-Fi networks changes significantly, thanks to the opportunity of implementing more complex scheduling logic to handle Downlink (DL) traffic flows and simultaneously act as coordinator of Multi User (MU) Uplink (UL) transmissions. In this context, it becomes necessary to develop reliable network analysis and simulation tools that allow for an in-depth investigation of the trade-offs involved in the usage of OFDMA, especially considering that the standard leaves much of the actual scheduling algorithmic details to vendor-specific implementation. In this work we present a series of results highlighting how several network settings have an impact on throughput and Head-of-Line Delay, in a network that employs multiple 802.11ax features such as OFDMA and the MU Enhanced Distributed Channel Access (EDCA) Parameter Set, while also containing legacy devices. The results are obtained via both the newly re-designed ns-3 wifi module and an original analytical framework, based on the well-established Bianchi 802.11 model.
Article
In many environments, connected devices are exposed to and must choose between multiple Wi-Fi networks. However, the procedure for selecting an access point is still based on simple criteria that consider the device to be unique in the network. In particular, the network load is not taken into account even though it is a key parameter for the quality of service and experience. In this paper, we investigate how an unmodified vanilla device could estimate the load of a network in the user space with no interventions from the access points. In this regard, we propose a novel and practical method, FAM (Frame Aggregation based Method). It leverages the frame aggregation mechanism introduced in recent IEEE 802.11 amendments to estimate the network load through its channel busy time fraction. FAM combines an active probing technique to measure the actual packet aggregation and Markovian models that provide the expected rate as a function of the volume and nature of the traffic on the network. We validate the effectiveness of FAM against both ns-3 simulations and test-bed experiments under several scenarios. Results show that our method FAM is able to infer the network load with a granularity based on six different levels of network loads for the considered scenarios.
Article
Novel congestion control algorithms, like Google’s TCP BBR, have been designed using wired-bottleneck models. Therefore, they do not achieve efficient performance over Wi-Fi paths due to frame-aggregation mechanisms adopted by standard IEEE 802.11n/ac/ax technologies that break the standard model. In this work, we analyze the performance characteristics of a Wi-Fi bottleneck, investigating the throughput and the latency obtained with the frame aggregation logic. In particular, we formulate the expression for data throughput and RTT as a function of the aggregation size. Then, through experimental results, we validate the model on a real testbed with two different types of Wi-Fi bottlenecks.