International Journal of Computer Networks & Communications (IJCNC)

AIRCC PUBLISHING CORPORATION

IJCNC 04

HYBRID UPLINK ACCESS IN IEEE 802.11ax UNDER NON-SATURATED TRAFFIC: ANALYTICAL MODELING AND PERFORMANCE EVALUATION

Asma A. Eliwa , Mohamed Yasin I. Afifi , Ibrahim F. Tarrad and Mohammed A. Salem

Faculty of Engineering, City University of Cairo (CUC), New Heliopolis City, Egypt

ABSTRACT

The emergence of wireless systems with numerous terminals, such as Internet of Things (IoT) deployments, Smart Home Systems, and enterprise Wi-Fi networks, requires efficient channel access mechanisms. However, existing methods in IEEE 802.11ax standard (Wi-Fi 6) face performance issues under practical non-saturated traffic conditions as a result of a trade-off between scheduled and contention-based transmissions. In this paper, we study a hybrid channel access scheme which combines scheduled and random-access transmissions into a single Trigger Frame (TF). Some Resource Units (RUs) are used for scheduled access determined by Buffer Status Reports (BSRs), while the remaining RUs are allocated for random access to accommodate new terminal connections. Realistic traffic modeling is considered using Pareto traffic arrival for non-saturated conditions. The analytical model is validated via simulation to evaluate throughput, access latency, ability to provide random access, and energy efficiency. The analysis is performed for the cases of both static and dynamic scheduling mechanisms. Results demonstrate that our proposed hybrid mechanism outperforms the random-only scheme, achieving up to 3× higher throughput than random-only access in areas of dense stations; reduces access delay by over 40% compared to static scheduling; and increases energy efficiency when using dynamic scheduling

KEYWORDS

IEEE 802.11ax (Wi-Fi 6), OFDMA, MU-MIMO, Non-Saturated Traffic, Pareto Traffic, Channel Sounding

1. INTRODUCTION

Wireless Local Area Networks (WLANs) based on IEEE 802.11 protocols have emerged as the main solution for providing high-speed Internet access. Their low deployment cost, ease of installation, and flexibility to support a wide range of applications have been key factors that have led to the widespread adoption of Wi-Fi and a rapid increase in the number of Wi-Fienabled devices [1], [2], [3]. Recent reports indicate that Wi-Fi accounts for more than half of global Internet traffic. The demand for these devices continues to grow rapidly, driven by the need to support emerging applications and higher data rate requirements. Additionally, the growing number of low-latency applications, including video streaming, online gaming, and Internet of Things (IoT) services, further expose performance limitations in Wi-Fi networks, particularly regarding throughput, latency, and reliability when used in crowded environments [4], [5], [6]. The IEEE 802.11ax amendment (Wi-Fi 6) was developed to support High Efficiency (HE) WLANs in dense deployment scenarios. This amendment increases network performance by achieving up to four times higher per-station throughput compared to legacy WLANs. Two primary elements of the new Medium Access Control (MAC) standard that provide the necessary level of throughput are Orthogonal Frequency Division Multiple Access (OFDMA) and Uplink Multi-User Multiple-Input Multiple-Output (UL MU-MIMO). OFDMA divides the operating channels into multiple Resource Units (RUs) ,allowing for simultaneous connections from multiple devices using OFDMA technology whether in the downlink, uplink, or both. UL MUMIMO is for use in the upload direction providing multiple station connections to the AP simultaneously over the same frequency resource using spatial multiplexing. Additional improvements to reduce the impact of interference and improve the overall efficiency of WLANs have also been made through other enhancements such as BSS Coloring and Target Wake Time (TWT). This paper will concentrate on evaluating the performance of the new MU-OFDMA and MU-MIMO multi-user transmission mechanisms in both uplink and downlink [4] – [8].

Despite these improvements, most existing studies on IEEE 802.11ax assume saturated traffic conditions, where all stations always have data ready to transmit. However, in practical scenarios, many applications such as IoT sensing, smart home systems, and event-driven services generate bursty and intermittent traffic, which corresponds to non-saturated conditions. To model this behavior, Pareto Type II (Lomax) arrivals are considered, as they capture the heavy-tailed and self-similar characteristics of modern IoT and multimedia applications [9], [10]. The behavior of systems under such conditions differs significantly from saturated system behavior due to contention, queuing, and throughput, and which necessitates a more realistic performance evaluation [11], [12], [13]

This paper presents an analytical model supported by simulation to evaluate IEEE 802.11ax performance with regard to non-saturated traffic. In addition, we propose and evaluate a hybrid uplink channel access mechanism that integrates both scheduled and random access. In particular, we study a hybrid uplink channel access mechanism that combines scheduled and random transmissions within a unified Trigger Frame (TF). In this scheme, a portion of the Resource Units (RUs) is allocated for scheduled access based on buffer status reports, while the remaining RUs are used for random access to accommodate new or sporadic users. To the best of our knowledge, no prior work has jointly analyzed hybrid access under non-saturated traffic while accounting for MU-MIMO channel sounding overhead. The results show that the proposed approach achieves a better balance between efficiency, fairness, and signaling overhead compared to conventional schemes, especially in dense and dynamic traffic scenarios.

1.1. Literature Review

Studies on IEEE 802.11ax technology have considered MU solutions extensively. For example, in the OFDMA access mode, there have been extensive applications of Markov chain models to analyze RA [14,15], resulting in efficiency improvements in the form of frame size control [16]. Thereafter, SA schemes have been implemented [17,18] and tested via simulation tools such as NS-3 [19]. In order to counter the shortcomings of RA and SA alone, HA methods that integrate RA and SA have been suggested, usually with a combination of random access and scheduling phases [20,21]. However, most research works make the assumption of saturated traffic conditions [22].

Most recent studies on hybrid access have analyzed non-saturated (NS) conditions and how bursty traffic interacts with dynamic transition methods to enhance throughput performance [23] – [25]. International Journal of Computer Networks & Communications (IJCNC) Vol 18, No 5, September 2026 53 MU-MIMO was initially introduced in IEEE 802.11ac only for the downlink channels [26,27] with research concerning TXOP sharing [28] and user selection [29]. MU-MIMO was extended to include both uplink and downlink in IEEE 802.11ax [26]. There are two ways of implementing uplink MU-MIMO: synchronous and asynchronous. The synchronous mode allows synchronized high-rate transmission with high timing synchronization requirements. In asynchronous mode, there is more flexibility but the system requires advanced channel sensing. Studies on scheduling in the synchronous mode [30] and simultaneous use of MU-OFDMA/MU-MIMO [31], channel sensing in asynchronous mode [32] using Markov chain model [33] and renewal process model [34] were conducted. Asynchronous UL MU-MIMO is rarely used in IEEE 802.11ax.

1.2. Motivation and Contributions

To conclude, while prior research has provided valuable insights into MU-OFDMA and MUMIMO in the context of IEEE 802.11ax, there are still several limiting factors present. Most analytical models assume saturated traffic and rely complex analytical formulations. In addition, the majority of research has focused primarily on the metrics of throughput, whereas other important metrics such as delay, power consumption and energy efficiency remain largely unexplored. Furthermore, very limited analysis has been carried out on the use of hybrid access for non-saturation traffic with realistic channels sounding overheads in the context of MUMIMO.

In order to facilitate a proper comparison between the existing works and our proposed research, the important aspects and limitations of the literature that are most pertinent to the study are presented in Table 1. As can be observed from the table below, the majority of existing studies are limited to saturated traffic and throughput only. The study which is most relevant among all the studies examined is [25] which lays down the basics of hybrid access with respect to nonsaturated Poisson traffic. It does not cover Pareto traffic, channel sounding, and important performance parameters including delay, energy consumption, and energy efficiency.

Building upon the framework in [25], this paper makes the following key contributions. First, a comprehensive performance evaluation is conducted on non-saturated traffic conditions using a Pareto method of evaluation to capture the trade-offs among key performance indicators including throughput, access delay, Random Access Capability (RAC), energy consumption, and energy efficiency for the various types of scenarios that represent the system’s operation in unsaturated network conditions. A comprehensive review of the performance evaluation results performed on non-saturated traffic conditions provides a more realistic portrayal of actual network behavior, thus giving greater insight into the various mechanisms that operate within the system under normal operating conditions.

Secondly, a dynamic Resource Unit (RU) allocation scheme is proposed that the Resource Units (RUs) are allocated based on Buffer Status Reports (BSRs) rather than conventional static allocation the Resource Units (RUs) to users before receiving Buffer Status Reports (BSRs). Through the use of real-time traffic demands, the dynamic Resource Unit (RU) allocation method will enable a more effective manner of using or allocating resources based on from both the minimization of underutilization and the minimization of congestion and thus maximize the system response time and overall system performance. The results demonstrate that use of the dynamic Resource Unit (RU) allocation scheme will produce a more efficient means of resource management in comparison to the use of the traditional means of static allocation of Resource Units (RUs).

Finally, a unified MU-MIMO framework is developed that includes overhead resources needed to accurately quantify the cost of Channel State Information (CSI) acquisition in accordance with IEEE 802.11ax. The unified MU-MIMO model also takes into consideration the overhead introduced during the process of channel sounding which is required for an appropriately reliable estimate of CSI and is required for uplink MU-MIMO operation in an MU-MIMO environment. By including both transmission components as well as overhead components together as part of the same unified MU-MIMO system configuration within a single framework, a more realistic and comprehensive evaluation framework is provided to evaluate the costs required to acquire CSI for various MU-MIMO system configurations

1.3. Organization

The remainder of this paper is structured as follows: the system model and analytical framework are defined in Section 2; the transmission and hybrid-access mechanisms are addressed in Section 3; performance measure definitions are discussed in Section 4; and result and discussion sections are provided in Section 5. Finally, the paper’s conclusion is introduced in section 6.

2. SYSTEM MODEL & ANALYTICAL MODELING

2.1. Network Assumptions

Consider a Basic Service Set (BSS) IEEE 802.11ax (Wi-Fi 6) network consisting of one Access Point (AP) and multiple connected Stations (STAs). To focus exclusively on MAC-layer behavior, an ideal physical (PHY) layer is assumed, providing error-free transmission and perfect channel estimation. Across all devices, a subset is scheduled using the Scheduled Access (SA) mechanism, while the remaining STAs rely on Random Access (RA) through uplink triggerbased contention, where

The AP dynamically allocates uplink Resource Units (RUs) over the available channel bandwidth , which is partitioned into equal-sized subchannels. Each RU employs the same Modulation and Coding Scheme (MCS) index to ensure fairness among contending STAs.Let the total number of RUs be divided into scheduled RUs and random-access RUs such that Unlike

Unlike saturated traffic models, the proposed system considers non-saturated traffic conditions, where each STA may or may not have packets available for transmission during agiven Trigger Frame (TF) cycle. Packet arrivals at the STAs are modeled as a stochastic process such that the packet inter-arrival times are distributed according to a Pareto distribution to account for the characteristics of bursty and self-similar traffic.

Each STA is equipped with a finite buffer capable of holding a maximum of packets. A bulk-service aggregation mechanism is assumed, allowing up to packets to be transmitted in a single successful attempt. The AP operates with antennas, and each STA with antennas, enabling MU-MIMO grouping when applicable.

The minimum contention window is denoted as , and exponential backoff is applied for failed RA transmissions up to a retry limit

2.2. Non-Saturated Traffic Condition

Contrary to normal saturated models, where there are packets in all time units in the buffer for STAs to transmit, in a practical WLAN environment, there are random arrivals of packets, making STAs switch between being idle, being in backoff state, and transmitting the packets in accordance with the buffer content. Once the service period expires, the STA enters an idle state in case the buffer is empty or goes into backoff again in case the buffer still has packets.

Let denote the probability that a STA has at least one packet remaining after service, and denote the probability that a packet arrives during the backoff countdown. If the buffer is empty after service, the STA waits for an average ofTF-cycles before a new packet is produced

Hence, the system is renewed after an expected interval of time slots. Both and are derived as functions of the selected traffic model, according to their statistical characteristics.

2.3. Pareto Traffic Model



2.4. Actual Packet Transmission and Aggregation


2.5. Transmission Probability Derivation



Substituting this expression into the transmission probability equation yields a non-linearmapping .According to Brouwer’s Fixed-Point Theorem [42], such a system admits a unique fixed-point solution for , provided that is a non-decreasing sequence.The steady-state transmission probability is then obtained by substituting the fixed-point value of into the above relation.

3. MU-TRANSMISSION & HA MECHANISM

3.1. Overview of OFDMA

OFDMA has been introduced in IEEE 802.11ax, which revolutionizes the mechanism of channel access in IEEE 802.11ax. In previous versions of the standard, where the channel was divided into only one station, OFDMA breaks the channel into many Resource Units (RUs). RU has a certain number of subcarriers or tones. One important physical layer improvement in IEEE 802.11ax is the decrease in subcarrier spacing by a factor of four along with an increase in the duration of OFDM symbols by four times, leading to more subcarriers in the same bandwidth.

The standard sizes of Resource Units in IEEE 802.11ax are 26, 52, 106, 242, 484, 996, and 2×996 tones. The number of RUs available depends on the bandwidth of the channel as well as the selected RU size (see Table 2). It is also important to note that multiple RUs can be with different sizes utilized in one OFDMA transmission.

3.2. Uplink OFDMA Frame Structure and Access Mechanisms

Figure 1 demonstrates the UL Multi-User hybrid access model employed by the IEEE 802.11ax protocol family, illustrating the sequential exchange of control and data frames between the AP and the connected STAs. The figure illustrates the two-dimensional approach, wherein the x-axis shows the ordering of frame exchange, and the y-axis shows the RU allocation in the frequency domain


In the initial process, the Access Point transmits the Trigger Frame Request (TFR) control frame and share information on RU allocation with STAs. After sending the TFR, any STA with pending data ready to be transmitted in the UL initiates the Distributed Coordination Function (DCF) process by lowering its backoff (BO) counters. Those STAs whose BO counter values drop to zero will begin sending Buffer Status Reports (BSRs)

The contention resolution procedure employs the following algorithm: In case of collisions during data transmission, the BO index (i) is incremented by STAs until it reaches the value of , which signifies the maximum number of retransmission attempts allowed. The contention window size is determined using a binary exponential backoff algorithm, where


3.3. MU-MIMO Integration and Channel Sounding

The implementation of MU-MIMO is one of the great developments of IEEE 802.11ax that uses spatial diversity along with frequency and time domain utilized by OFDMA. As compared to the single-user MIMO that provides service for one station for each transmission opportunity, MUMIMO supports simultaneous communication with several stations through spatial streams. For our study, we use a combination approach in which MU-OFDMA operates during SA. Let denote the number of antennas at the AP; to fully utilize the MU-MIMO capability, all antennas are assumed active during scheduled transmissions. Consequently, simultaneously served STAs can be expressed as , where represents the number of resource units (RUs) allocated for scheduled access.

For efficient MU-MIMO operation, the AP requires accurate CSI to separate users spatially and minimize inter-user interference. Hence, a channel sounding procedure is periodically performed, initiated by the AP through a Null Data Packet Announcement (NDPA) frame followed by a Null Data Packet (NDP) frame, which allows STAs to estimate the channel. Subsequently, the AP triggers a subset of STAs to transmit their CSI feedback using the MU-OFDMA capability, enabling up to STAs to report their CSI simultaneously depending on the number of available RUs. When the total number of STAs exceeds , multiple sounding rounds (denoted by ) are required, each consisting of a Trigger frame followed by uplink CSI PPDUs. The total duration of the sounding process is given by [25]:


4. KEY PERFORMANCE METRICS ANALYSIS

4.1. Throughput

The throughput metric is considered to be the most important performance parameter in the IEEE 802.11ax technology. It measures the total amount of payload bits transferred successfully within one unit time for SA and RA stations

The mean number of successful transmissions per TF-cycle is given by


In MU-MIMO operation, .Under channel sounding overhead is considered, the achievable uplink throughput is reduced and can be expressed as:

4.2. RA Capability

RA Capability (RAC) measures how quickly new stations can join the network through random access. It represents the percentage of successful random-access attempts during one transmission TF cycleis calculated as:


4.4. Energy Efficiency & power consumption

Energy efficiency measures the network’s ability to deliver data with minimal energy consumption, defined as the number of successfully transmitted bits per unit energy. Let and be the number of RA STAs that attempt and succeed in transferring their Buffer Status Report (BSR) during one TF cycle, respectively:




5. RESULTS AND DISCUSSION

In this section, extensive MATLAB simulations are conducted to verify the MU-based HA system model. In each iteration, which is 20 in our experiment, the number of TF-Cycles will be taken to be 10000. The parameters and their default values for 802.11ax simulation are listed in Table 3. From the analysis, the theoretical results are close to the simulation results

5.1. Impact of Packet Arrival Rate (λ) on Throughput and Efficiency

Figure 3 below shows the effect of an increasing packet arrival rate (λ) on the throughput of the system under the Pareto traffic scheme. With a rising λ, more packets will accumulate in the buffer of the STAs, resulting in packets that can be transmitted per TF-cycle. Thus, the performance and efficiency of resource usage of the system will be greatly enhanced

5.2. Impact of Resource Partitioning Between Random and Scheduled Access

Figure 4 shows the effect of changing the random access (RA) resource ratio on the performance of the entire system based on five metrics, namely throughput, probability of success for random access, delay, energy consumption, and energy efficiency. Given that the total number of RUs remains constant, increasing the RA resources automatically decreases the scheduled access (SA) resources. This implies that there is an inherent trade-off between the number of RA resources and SA resources. From the results, it is clear that as RA resources increase, it is easier to achieve successful access when the network load is low. But, as the number of stations increases, more collisions/contention events will arise, leading to lower throughput, delays, and energy efficiency. On the other hand, increasing the SA resources increases throughput and energy efficiency but at the cost of longer delays and less random-access success.


5.3. Impact of PHY and Resource Configuration on System Performance

Fig. 5. illustrates the impact of physical layer and resource configuration on system performance under non-saturated Pareto traffic. Six configurations are analyzed by jointly varying channel bandwidth, number of resource units (Nru), and modulation and coding scheme (MCS).Configurations with larger bandwidth and higher MCS consistently achieve higher throughput, with Case 1 (Nru = 16, BW = 160 MHz, MCS = 11) representing the performance upper bound. Reducing MCS (Case 2) or channel bandwidth (Case 3) significantly lowers throughput, emphasizing the importance of spectral efficiency and sufficient bandwidth. More constrained configurations with fewer resource units and narrower bandwidth (Cases 4 and 5) exhibit the lowest throughput and rapidly increasing delays as station density rises. Case 6 demonstrates that employing a high MCS can partially compensate for limited bandwidth and resources, resulting in improved throughput and reduced delay. Overall, these results confirm that system performance under bursty non-saturated traffic is determined by the combined configuration of bandwidth, MCS, and resource allocation, highlighting the importance of crosslayer PHY–MAC design in IEEE 802.11ax networks

5.4. Impact of the Number of AP Antennas on System Performance

Figure 6. examines the effects of different AP antenna numbers on system performance when there is non-saturated traffic. A higher number of antennas positively influences system throughput because of increased spatial multiplexing and better simultaneous data transmission. The difference between delay values for various numbers of antennas is low since medium access still affects delay behavior. Therefore, the delay curves partly overlap each other in the case of high numbers of stations. Even though power consumption rises as the number of antennas increases, the growth in throughput is faster than that of power consumption.


5.5. Average Per-Station Throughput under Non-Saturated Traffic

Figure 7. presents the evaluation of the per-station throughput in a non-saturated environment for various access approaches. The three cases that are considered here include: the use of only OFDMA, the use of MU-MIMO with no channel sounding capability, and the use of MU-MIMO with channel sounding capability. Results show that as the number of STAs increasesthroughput becomes lower. The use of MU-MIMO improves throughput by utilizing spatial multiplexing, whereas channel sounding has limited impact on throughput.

5.6. Impact of Channel Sounding on System Performance

Figure 8. presents various channel sounding frequencies (λcsi = 5, 10, 20, 50) in comparison with the baseline scheme that lacks channel sounding (only OFDMA).

  • · Throughput: A minor drop can be noted as λcsi increases due to extra costs incurred for collecting CSI. In practice, when using λcsi from 5 to 20, the throughput reduction is small enough.
  • · Latency: A mild rise in latency can be seen as λcsi rises due to spending a greater share of transmission time on exchanging CSI rather than transmitting the payload.
  • · Energy Efficiency: Energy efficiency progressively falls under increasingly intensive channel sounding as extra energy is expended in the process of collecting CSI feedback. The value of λcsi = 50 is used here for demonstrating the maximal overhead associated with sounding. It should be noted that it is an impractical sounding rate because it spends almost half of the transmission time on channel sounding, causing a considerable drop in performance metrics. Simulation results align well with the theoretical model, proving its precision.

5.7. Performance of dynamic and static Pareto-based scheduling

Figure 9 depicts the outcome of throughput, delay, and random access probability from simulations and analysis. In static scheduling (Nsa=1,2), the number of resources used remains constant regardless of the buffer state, while the RA-only scheduling works through random access only without scheduling. Dynamic scheduling uses resource allocation depending on the buffer state of every STA and is more efficient since not all allocated resources are active. Split strategy uses static reservation of half of the resources for scheduled access while the other half remains for random access. Specifically, in peak Pareto traffic (N=2000 stations), the proposed dynamic scheduling achieves throughput of 103.97 Mbps, which is 254% higher than the pure RA scheme. Most importantly, even by decreasing the number of random access resources to serve queues, the dynamic mechanism manages to limit the delay of RA stations at 0.0846 s, resulting in 41.7% delay reduction as compared to the strict equal split scheme (0.1453 s).



5.8. Impact of Channel Sounding on System Performance

Figure 10 shows the performance of the dynamic scheduling approach on seven test cases, characterized by diverse system parameters. An increase in Nru (Case 2 vs. Case 1) improves throughput and per station throughput without affecting delay. Increased arrival rates (Case 3) positively affect the throughput performance at low to moderate STA numbers but reach saturation for heavy loads, with no impact on the delay performance, illustrating the scheduler robustness. The packet aggregation (Case 4) improves the per station throughput without increasing delay significantly. Quantitatively, during peak network activity, an increase in Nru from 16 (Case 1) to 32 (Case 2) increases simulation throughput from 94.82 Mbps to 99.74 Mbps (an increase of 5.18%), while decreasing delay by 20% (from 0.0846 s to 0.0677 s). Moreover, the importance of the modulation is shown when comparing Cases 5 and 7. Even with 75% less resources available, Case 5 uses a higher MCS number to achieve the peak throughput of 77.12 Mbps, surpassing Case 7 (26.39 Mbps) by 192.2% and decreasing delay by 46.9% (0.2291 s vs. 0.4320 s).

5.9. Comparison between Poisson and Pareto Traffic Models

Figure 11 illustrates the comparison between Poisson and Pareto traffic models with regard to both static and dynamic scheduling mechanisms. There is a good match between simulation and analytical results, confirming the validity of the analytical model. One can notice that dynamic scheduling performs better with higher throughput than static scheduling in all cases due to its ability to distribute the resources according to the buffer status of active nodes. Additionally, the Pareto traffic model provides higher throughput values in comparison with the Poisson model as its bursty nature enables more efficient exploitation of the transmission opportunities. Quantitatively, during the maximum load period, the developed Pareto-based dynamic scheduling provides peak throughput equal to 50.22 Mbps, outperforming the Pareto-based static scheduling mechanism (28.70 Mbps) by 76%. Under Poisson traffic model, the dynamic scheduling prevents baseline collapse, providing the throughput equal to 9.15 Mbps, surpassing static scheduling mode (2.85 Mbps) by 221%. These direct comparisons confirm mathematically that although dynamic scheduling provides the highest throughput in realistic bursty Pareto load, its ability to optimize the resources leads to important percentage improvements in both traffic models.


6. CONCLUSION AND FUTURE WORK

This study proposed an integrated model combining theoretical analysis and simulation for assessing the hybrid uplink channel access of IEEE 802.11ax WLANs in non-saturated conditions with Pareto distribution arrival traffic, dynamic RU assignment, MU-MIMO advantage, and channel sounding cost. Our findings revealed that hybrid channel access outperforms in its optimal combination of scheduled and random access channels, with dynamic scheduling contributing greatly to enhanced throughput, access latency, resource efficiency, and energy consumption. The analysis of physical layer parameters, antenna configuration, and sounding interval is valuable for future WLAN design.

Further research could be done in the field of QoS prioritized traffic, adaptive TWT, AI-assisted resource scheduling, and real trace validation with WLANs and Wi-Fi 7 multi-link operation

CONFLICTS OF INTEREST

The authors declare no conflict of interest

REFERENCES

[1] Salem MA, El-Kader SMA, Youssef MI, Tarrad IF. M2M in 5G Communication Networks. In: Fundamental and Supportive Technologies for 5G Mobile Networks. IGI Global; 2020, p. 309–321. https://doi.org/10.4018/978-1-7998-1152-7.ch012.  

[2] Z. Cordoba, R. Rana, G. Rendon, J. Thunell, and A. Elleithy, “WiFi Transmit Power and its Effect on Co-Channel Interference,” International journal of Computer Networks & Communications, vol. 13, no. 1, pp. 1–17, Jan. 2021, doi: 10.5121/ijcnc.2021.13101

[3] M. A. Salem and R. A. Roshdy, “OCEANIC TURBULENCE EFFECT ON UNDERWATER VISIBLE LIGHT COMMUNICATION,” Journal of Al-Azhar University Engineering Sector, vol. 0, no. 0, pp. 1143–1154, Oct. 2025, doi: 10.21608/auej.2025.369737.1799.

[4] P. N. Kota, P. B. Chopade, B. D. Jadhav, P. M. Ghate, and S. D. Chavan, “IoT Resource Allocation and Optimization Using Improved Reptile Search Algorithm,” International journal of Computer Networks & Communications, vol. 15, no. 04, pp. 39–53, Jul. 2023, doi: 10.5121/ijcnc.2023.15403.

[5] Wang D, Chen D, Song B, Guizani N, Yu X, Du X. From IoT to 5G I-IoT: The Next Generation IoTBased Intelligent Algorithms and 5G Technologies. IEEE Commun Mag 2018;56(10):114–120. https://doi.org/10.1109/mcom.2018.1701310.

[6] M. M. Abd El-Hamid, M. F. Zaghloul, and A. A. E.-A. Kolkila, “BEYOND FIFTH GENERATION (5G) NETWORKS AND BETTER PERFORMANCE EXPECTATIONS FOR CELLULAR WIRELESS NETWORKS,” Journal of Al-Azhar University Engineering Sector, vol. 0, no. 0, pp. 150–166, Jul. 2024, doi: 10.21608/auej.2024.252471.1501.

[7] Salem MA, Tarrad IF, Youssef MI, Abd El-Kader SM. QoS Categories Activeness-Aware Adaptive EDCA Algorithm For Dense IoT Networks. Int J ComputNetw Commun 2019;11(3):67–83. https://doi.org/10.5121/ijcnc.2019.11305.

[8] M. Al Rawajbeh, “Low Cost Design and Implementation for HAS Using Multifunctional WI-FI,” International journal of Computer Networks & Communications, vol. 9, no. 3, pp. 105–116, May 2017, doi: 10.5121/ijcnc.2017.9307.

[9] C. E. Sing, K. H. Mohd Azmi, L. A. Burhanuddin, and Z. A. Shaffiei, “UTILISING DEEP QNETWORK REINFORCEMENT LEARNING FOR RESOURCE ALLOCATION IN DYNAMIC CELLULAR VEHICLE-TO-ANYTHING (C-V2X) COMMUNICATIONS,” Journal of Al-Azhar University Engineering Sector, vol. 0, no. 0, pp. 0–0, Feb. 2026, doi: 10.21608/auej.2026.482874.

[10] Daldoul Y, Meddour DE, Ksentini A. Performance evaluation of OFDMA and MU-MIMO in 802.11ax networks. ComputNetw 2020;182:107477. https://doi.org/10.1016/j.comnet.2020.107477.

[11] Salem MA, Tarrad IF, Youssef MI, El-kader SMA. An Adaptive EDCA Selfishness-Aware Scheme for Dense WLANs in 5G Networks. IEEE Access 2020;8:47034–47046. https://doi.org/10.1109/access.2020.2979052.

[12] Behara A, Venkatesh TG. Performance Analysis and Energy Efficiency of MU-(OFDMA & MIMO) Based Hybrid MAC Protocol of IEEE 802.11ax WLANs. IEEE Trans Veh Technol 2023;72(5):6474–6490. https://doi.org/10.1109/tvt.2022.3230873.

[13] Magrin D, Avallone S, Roy S, Zorzi M. Performance Evaluation of 802.11ax OFDMA Through Theoretical Analysis and Simulations. IEEE Trans Wirel Commun 2023;22(8):5070–5083. https://doi.org/10.1109/twc.2022.3231447.

[14] Lanante L, Uwai HOT, Nagao Y, Kurosaki M, Ghosh C. Performance analysis of the 802.11ax UL OFDMA random access protocol in dense networks. In: Proc IEEE Int Conf Commun (ICC); 2017, p. 1–6. https://doi.org/10.1109/icc.2017.7997340.

[15] Lee Kh. Performance Analysis of the IEEE 802.11ax MAC Protocol for Heterogeneous Wi-Fi Networks in Non-Saturated Conditions. Sensors 2019;19(7):1540. https://doi.org/10.3390/s19071540.

[16] Kim S, Yun JH. Efficient Frame Construction for Multi-User Transmission in IEEE 802.11 WLANs. IEEE Trans Veh Technol 2019;68(6):5859–5870. https://doi.org/10.1109/tvt.2019.2907281.

[17] Madhavan N, Sekiya M, Nabetani T. Development of 802.11ax-compatible LSI and Performance Evaluation of Uplink OFDMA. In: Proc IEEE Global Commun Conf (GLOBECOM); 2018. https://doi.org/10.1109/glocom.2018.8647617.

[18] Sharon O, Alpert Y. Scheduling Strategies and Throughput Optimization for the Uplink for IEEE 802.11ax and IEEE 802.11ac Based Networks. Wirel Sens Netw 2017;9(8):250–273. https://doi.org/10.4236/wsn.2017.98014.

[19] Avallone S, Imputato P, Redieteab G, Ghosh C, Roy S. Will OFDMA Improve the Performance of 802.11 Wifi Networks? IEEE Wirel Commun 2021;28(3):100–107. https://doi.org/10.1109/mwc.001.2000332.

[20] Naik G, Bhattarai S, Park JM. Performance Analysis of Uplink Multi-User OFDMA in IEEE 802.11ax. In: Proc IEEE Int Conf Commun (ICC); 2018, p. 1–6. https://doi.org/10.1109/icc.2018.8422692.

[21] Lanante L, Ghosh C, Roy S. Hybrid OFDMA Random Access With Resource Unit Sensing for NextGen 802.11ax WLANs. IEEE Trans Mob Comput 2021;20(12):3338–3350. https://doi.org/10.1109/tmc.2020.3000503.

[22] Zhang Y, Li B, Yang M, Yan Z, Zuo X. An OFDMA-based joint reservation and cooperation MAC protocol for the next generation WLAN. WirelNetw 2019;25(2):471–485. https://doi.org/10.1007/s11276-017-1567-1.

[23] Cheng RG, Yang CM, Firmansyah BS, Harwahyu R. Uplink OFDMA-Based Random Access Mechanism With Bursty Arrivals for IEEE 802.11ax Systems. IEEE Netw Lett 2022;4(1):34–38. https://doi.org/10.1109/lnet.2021.3138277.

[24] Bhattarai S, Naik G, Park JMJ. Uplink Resource Allocation in IEEE 802.11ax. In: Proc IEEE Int Conf Commun (ICC); 2019, p. 1–6. https://doi.org/10.1109/icc.2019.8761594.

[25] Behara A, Venkatesh TG. Fluid-Limit Model for Dynamic MU-OFDMA Resource Allocation of WiFi6 Networks. IEEE Commun Lett 2022;26(1):207–211. https://doi.org/10.1109/lcomm.2021.3125421.

[26] IEEE. IEEE Approved Draft Standard for Information Technology — Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications Amendment 1: Enhancements for High Efficiency WLAN. IEEE P802.11ax/D8.0; 2021, p. 1–820.

[27] Choi J, Choi S, Lee KB. Sounding Node Set and Sounding Interval Determination for IEEE 802.11ac MU-MIMO. IEEE Trans Veh Technol 2016;65(12):10069–10074. https://doi.org/10.1109/tvt.2016.2547442.

[28] Kosek-Szott K, Cuka G. Consequences of Performing DL MU-MIMO Transmissions With TXOP Sharing for QoS Provisioning in IEEE 802.11ac Networks. IEEE Commun Lett 2018;22(3):606–609. https://doi.org/10.1109/lcomm.2017.2780857.

[29] Lee KH. Using OFDMA for MU-MIMO User Selection in 802.11ax-Based Wi-Fi Networks. IEEE Access 2019;7:186041–186055. https://doi.org/10.1109/access.2019.2960555.

[30] Bellalta B, Kosek-Szott K. AP-initiated multi-user transmissions in IEEE 802.11ax WLANs. Ad Hoc Netw 2019;85:145–159. https://doi.org/10.1016/j.adhoc.2018.10.021.

[31] Daldoul Y, Meddour DE, Ksentini A. Performance evaluation of OFDMA and MU-MIMO in 802.11ax networks. ComputNetw 2020;182:107477. https://doi.org/10.1016/j.comnet.2020.107477.

[32] Arun IB, Venkatesh TG. Design and performance analysis of a MAC protocol for wireless LANs supporting multipacket reception. J NetwComput Appl 2017;87:223–236. https://doi.org/10.1016/j.jnca.2017.03.010.

[33] Babich F, Comisso M. Theoretical analysis of asynchronous multi-packet reception in 802.11 networks. IEEE Trans Commun 2010;58(6):1782–1794. https://doi.org/10.1109/tcomm.2010.06.090186.

[34] Chen C, Hou S, Wu S. A Novel Analytical Model for Asynchronous Multi-Packet Reception MAC Protocol. IEEE Commun Lett 2017;21(6):1289–1292. https://doi.org/10.1109/lcomm.2017.2672992.

[35] Cecchi F, Borst SC, van Leeuwaarden JSH, Whiting PA. Mean-Field Limits for Large-Scale Random-Access Networks. Stoch Syst 2021;11(3):193–217. https://doi.org/10.1287/stsy.2021.0068.

[36] Xu Y, Shamrooz S, Li Q, Hou J. Self-Similarity Analysis and Application of Water Network Traffic. In: Proc IEEE Fifth Int Conf Big Data Comput Serv Appl (BigDataService); 2019, p. 257–261. https://doi.org/10.1109/bigdataservice.2019.00045.

[37] Ramsay CM. The Distribution of Sums of Certain I.I.D. Pareto Variates. Commun Stat Theory Methods 2006;35(3):395–405. https://doi.org/10.1080/03610920500476325.

[38] Rehman A, Hussain FB, Ali R, Khurshaid T. Collision-Based Up-Link OFDMA Random Access Mechanism for Wi-Fi 6. IEEE Access 2023;11:117094–117109. https://doi.org/10.1109/access.2023.3323162.

[39] Liu P, Li Y, Zhang D. Performance optimization of IEEE 802.11ax UL OFDMA random access. J Commun Netw 2024;26(6):580–592. https://doi.org/10.23919/jcn.2024.000069.

[40] Bianchi G. Performance analysis of the IEEE 802.11 distributed coordination function. IEEE J Sel Areas Commun 2000;18(3):535–547. https://doi.org/10.1109/49.840210.

[41] Kobbaey T, Hamzaoui R, Ahmad S, Al-Fayoumi M, Thomos N. Enhanced collision resolution and throughput analysis for the 802.11 distributed coordination function. Int J Commun Syst 2021;34(16). https://doi.org/10.1002/dac.4953.

[42] Arthi S, Mehta NB, Singh C. Hybrid Access MAC Protocol in Wi-Fi: Analysis and Optimal Resource Allocation Policy Design. IEEE Trans Mob Comput 2026;25(4):5742–5757. https://doi.org/10.1109/tmc.2025.3634127.

Leave a Reply

Information

This entry was posted on October 16, 2026 by .