UORA: Hybrid Uplink OFDMA Random Access

• UORA is defined as IEEE 802.11ax's hybrid uplink access method that combines scheduled OFDMA with random access for efficient buffer-status discovery.
• It employs AP-triggered trigger frames to allocate both Scheduled (SA) and Random Access (RA) resource units, optimizing uplink traffic management.
• Performance studies indicate UORA can reduce delay by over 40% in sparse, latency-sensitive networks while maintaining consistent throughput.

Searching arXiv for recent UORA papers to ground the article in current literature. Uplink OFDMA-based Random Access (UORA) is the IEEE 802.11ax uplink access mechanism that combines centralized Orthogonal Frequency Division Multiple Access (OFDMA) scheduling with contention-based access on random-access Resource Units (RUs). In UORA, an access point (AP) partitions uplink OFDMA resources into Scheduled Access (SA) RUs, which are explicitly assigned to stations (STAs), and Random Access (RA) RUs, on which eligible unscheduled STAs may contend. The mechanism addresses a central limitation of fully scheduled uplink OFDMA: efficient resource allocation requires timely AP knowledge of which STAs have buffered traffic, yet obtaining that knowledge through conventional polling becomes inefficient and unscalable as device density grows. Recent work has therefore emphasized UORA not primarily as a replacement for scheduled uplink OFDMA, but as a scalable mechanism for buffer-status discovery, especially for sparse, sporadic, or latency-sensitive uplink traffic (Agbeve et al., 6 Oct 2025).

1. Definition and system role

In IEEE 802.11ax, uplink OFDMA is AP-triggered. After winning channel access, the AP transmits a Trigger Frame (TF) that specifies how uplink RUs are to be used. UORA extends this framework by allowing the AP to mix explicitly scheduled opportunities with contention-based opportunities in the same uplink OFDMA exchange. The AP thereby retains centralized control where it has information, while permitting unscheduled STAs to reveal activity when the AP does not yet know their buffer status (Agbeve et al., 27 Jun 2025).

The motivation is tightly tied to the scaling limits of legacy uplink access. Enhanced Distributed Channel Access (EDCA) lets STAs contend for the whole channel, which becomes inefficient in dense deployments because collisions, retransmissions, and backoff overhead accumulate. Fully scheduled uplink OFDMA mitigates those issues by dividing the channel into RUs and assigning them to multiple STAs simultaneously, but it introduces a dependency: the AP must know which STAs have data to send and how much. If this knowledge is stale or incomplete, scheduled RUs may be wasted on empty buffers while newly active STAs remain unscheduled. UORA addresses that visibility problem by letting eligible unscheduled STAs contend on RA RUs, with particular utility for Buffer Status Reports (BSRs), since collisions among short signaling packets are much less costly than collisions among full data transmissions (Agbeve et al., 6 Oct 2025).

A recurrent theme across recent studies is therefore that UORA is best understood as a hybrid control mechanism. In latency-sensitive uplink scheduling, it serves as a means to discover buffered traffic from unscheduled STAs while preserving the throughput and coordination advantages of AP-driven OFDMA (Agbeve et al., 6 Oct 2025). In analytical studies, it appears as a trigger-based RU-level random access process whose tuning directly shapes contention, delay, and information freshness (Liu et al., 8 Feb 2025).

2. Protocol operation and contention process

UORA operates through AP-triggered exchanges. Two TF types are central in recent implementation and evaluation work: the Buffer Status Report Poll Trigger Frame (BSRP TF), used for polling and BSR collection, and the Basic TF, used for scheduling actual uplink data transmissions. This two-stage structure separates buffer-status discovery from data delivery, which is important both for standard compliance and for avoiding the cost of blind contention on data packets (Agbeve et al., 27 Jun 2025).

A STA is eligible to participate in UORA when it receives a TF, is not explicitly allocated any SA RU, and the TF indicates that RA is permitted. The AP advertises the OFDMA contention window bounds through management signaling using $EOCW_{min}$ and $EOCW_{max}$. These define the minimum and maximum OFDMA contention windows: $OCW_{MIN} = 2^{EOCW_{min} - 1$

$OCW_{MAX} = 2^{EOCW_{max} - 1$

The typesetting in the cited works is noted as garbled, but the intended exponential relation is stated explicitly in both implementation and evaluation descriptions (Agbeve et al., 27 Jun 2025).

An eligible STA initializes its OFDMA Backoff (OBO) by drawing uniformly from the current contention window: $OBO \in [0, OCW]$ with $OCW$ initially set to $OCW_{MIN}$. Upon reception of a TF advertising $N_{RA}$ RA RUs, the STA decreases its OBO by the number of advertised RA RUs. Operationally, if the STA’s $OBO$ is less than or equal to the number of RA RUs in the TF, it may transmit; otherwise it continues counting down over future TFs. This makes UORA fundamentally different from EDCA: backoff is decremented in units of RA opportunities per TF rather than in slot time (Agbeve et al., 27 Jun 2025).

If a STA becomes eligible, it randomly selects one advertised RA RU and transmits. After a successful transmission, the STA resets its contention window: $OCW \leftarrow OCW_{MIN}$ After an unsuccessful transmission, such as an RU collision, the STA enlarges its contention window up to the configured maximum: $EOCW_{max}$0 and redraws OBO from the updated window. This binary-exponential-style update is the core UORA contention process in current simulations and analytical models (Agbeve et al., 6 Oct 2025).

The exchange sequence typically proceeds as follows. The AP sends a BSRP TF; after one Short Interframe Space (SIFS), STAs transmit BSRs on either assigned SA RUs or contended RA RUs; after another SIFS, the AP transmits a Multi-STA Block Ack; after another SIFS, the AP sends a Basic TF to schedule uplink data; after another SIFS, scheduled STAs transmit data; and the AP concludes with a Multi-STA Block Ack after one SIFS (Agbeve et al., 27 Jun 2025). The literature also notes that the AP may designate some RUs for random access in the Basic TF, but generally avoids doing so because data collisions are much more costly than BSR collisions (Agbeve et al., 27 Jun 2025). This strongly suggests that the most practically relevant role of UORA is in the BSR stage rather than the payload data stage.

3. Resource partitioning, signaling, and frame structure

The defining structural feature of UORA is AP-side RU partitioning into SA and RA subsets. In a BSRP TF, some RUs may be assigned in contention-free fashion to particular STAs, while others are marked as RA RUs. Recent implementation work identifies RA RUs in the BSRP TF using AID 0. This lets the AP poll some STAs deterministically while simultaneously exposing opportunistic BSR opportunities to unscheduled STAs (Agbeve et al., 27 Jun 2025).

The signaling path for this functionality is compact and standard-structured. The UORA Parameter Set element contains one octet each for Element ID, Length, Element ID Extension, and OCW Range. Within the OCW Range octet, the first 3 bits encode $EOCW_{max}$1, the next 3 bits encode $EOCW_{max}$2, and the final 2 bits are Reserved. Management-frame support for this element allows the AP to advertise UORA parameters during association, beaconing, probing, and related control procedures (Agbeve et al., 27 Jun 2025).

The interaction with the MU EDCA Parameter Set is operationally important even though it is not UORA itself. The MU EDCA parameters include contention window, AIFSN, and the MU EDCA timer. A particularly important case is $EOCW_{max}$3, which signals STAs to disable EDCA-based contention entirely, thereby making uplink behavior fully AP-orchestrated via UL OFDMA and UORA. The MU EDCA timer governs how long the STA applies those parameters; it is reset when a STA successfully transmits by OFDMA and receives a Block Ack, and on expiry the STA reverts to default EDCA settings (Agbeve et al., 27 Jun 2025).

A representative sequence illustrates the combined SA/RA logic. In one example, a BSRP TF contains 3 RA RUs marked by AID 0 and 2 SA RUs assigned to STAs 5 and 7. Scheduled STAs use their SA RUs directly, while unscheduled STAs whose OBO permits transmission contend for the RA RUs. One STA succeeds on an RA RU, two others collide on the same RU, and the AP then uses the reported buffer information to construct the subsequent Basic TF for uplink data (Agbeve et al., 6 Oct 2025). The significance of this sequence is that the AP need not poll every STA deterministically to identify active uplink demand.

4. Implementation architectures and reproducibility in ns-3

A major 2025 contribution is the release of a fully standard-compliant and open source UORA implementation compatible with ns-3 version 3.38 (Agbeve et al., 27 Jun 2025). This work responds to a reproducibility gap: much prior UORA research relied on custom simulators that were not publicly available, and the previously known open-source ns-3 support had two limitations highlighted by the authors—use of the same TF to schedule both BSR and data transmissions, and lack of signaling for UORA configuration (Agbeve et al., 27 Jun 2025).

The implementation extends the ns-3 IEEE 802.11ax Wi-Fi stack through a combination of new and modified classes. The main classes involved are UoraParameterSet, MgtHeaders, HeConfiguration, ApWifiMac, StaWifiMac, QosTxop, HeFrameExchangeManager, RrMultiUserScheduler, and HePhy (Agbeve et al., 27 Jun 2025). The architectural significance of these changes is that UORA is embedded across the control plane, MAC state machine, scheduler, and PHY collision model rather than being approximated as a narrowly scoped patch.

The control-plane path centers on UoraParameterSet, which serializes and deserializes the UORA Parameter Set element carrying $EOCW_{max}$4 and $EOCW_{max}$5. MgtHeaders, ApWifiMac, StaWifiMac, and HeConfiguration are modified so that the AP can configure OCW bounds, advertise them in management frames, and have STAs receive and apply them (Agbeve et al., 27 Jun 2025).

The per-STA contention state is maintained in QosTxop. The implementation places the UORA contention-state update logic there, with QosTxop::UpdateObo resetting $EOCW_{max}$6 to $EOCW_{max}$7 after a successful transmission and assigning a new OBO, and QosTxop::UpdateFailedOcw updating both $EOCW_{max}$8 and $EOCW_{max}$9 after a failed transmission attempt (Agbeve et al., 27 Jun 2025). This ties UORA state evolution to the existing QoS transmission-opportunity machinery.

Protocol sequencing is orchestrated by HeFrameExchangeManager, which enforces the BSRP TF, BSR uplink, Multi-STA Block Ack, Basic TF, uplink data, and final Multi-STA Block Ack sequence with the required SIFS separations (Agbeve et al., 27 Jun 2025). Resource assignment is handled by RrMultiUserScheduler, which is extended to decouple BSR resource allocation from data resource allocation and to reuse unused RUs from the BSRP/BSR exchange in the following Basic TF. These unused RUs may arise because no STA selected them or because contention on another RU left some RUs idle. This reuse is presented as improving resource efficiency (Agbeve et al., 27 Jun 2025).

At the PHY layer, HePhy is modified so that if multiple STAs pick the same RU, the receiver synchronizes to the first successfully detected PPDU and treats all other concurrently transmitted PDUs in that same RU as interference (Agbeve et al., 27 Jun 2025). This provides a concrete RU-collision model for UORA simulations.

The implementation is explicitly positioned as open source, with code released as WiFi UORA in NS-3 at https://github.com/imec-idlab/WiFi_UORA_ns3 (Agbeve et al., 27 Jun 2025). One feature is still noted as missing: unassociated STAs should be able to send association requests in RA RUs when they receive a TF with AID 2045 identifying such an RA RU, but that feature is not yet implemented (Agbeve et al., 27 Jun 2025).

5. Performance evaluation: delay, throughput, and scalability

Recent evaluation work studies UORA as a polling mechanism for latency-sensitive uplink streams in dense Wi-Fi 6 networks (Agbeve et al., 6 Oct 2025). The core idea is hybrid polling: the AP reserves some RUs in the BSRP TF for scheduled polling and some for UORA-based opportunistic polling, while all available RUs in the subsequent Basic TF are scheduled for actual uplink data transmission. In the evaluated implementation, RA is therefore used in the BSRP/BSR phase, not in the Basic TF data phase (Agbeve et al., 6 Oct 2025).

The comparison framework includes four schemes: UORA, SA OFDMA, A2P, and EDCA. SA OFDMA schedules all RUs in both BSRP and Basic TFs and polls all associated STAs in round-robin. A2P uses EDCA for a STA’s first transmission to reveal activity, after which the AP adds that STA to a polling list and subsequently serves it by OFDMA. EDCA serves as the conventional full-band contention baseline (Agbeve et al., 6 Oct 2025).

The evaluated scenarios use ns-3 with a single Basic Service Set, one AP, multiple STAs, 5 GHz, 20 MHz, guard interval $OCW_{MIN} = 2^{EOCW_{min} - 1$0, MCS 8, 26-tone RUs only, uplink-only traffic, and sufficiently high transmit power that packet loss arises only from collisions rather than channel errors. The traffic mix contains 9 deterministic STAs with constant-bit-rate UDP at packet size 1700 bytes and inter-packet interval 2.08 ms, and stochastic STAs carrying latency-sensitive UDP with exponentially distributed inter-arrival times whose means are $OCW_{MIN} = 2^{EOCW_{min} - 1$1 s (Agbeve et al., 6 Oct 2025).

The main metrics are uplink delay and aggregate throughput. Uplink delay is defined as the time from packet generation at a STA to successful reception at the AP: $OCW_{MIN} = 2^{EOCW_{min} - 1$2 For each combination of number of stochastic STAs $OCW_{MIN} = 2^{EOCW_{min} - 1$3, number of RA RUs $OCW_{MIN} = 2^{EOCW_{min} - 1$4, and minimum contention window $OCW_{MIN} = 2^{EOCW_{min} - 1$5, the paper averages delay over $OCW_{MIN} = 2^{EOCW_{min} - 1$6 simulation runs: $OCW_{MIN} = 2^{EOCW_{min} - 1$7 and chooses the best $OCW_{MIN} = 2^{EOCW_{min} - 1$8 for each $OCW_{MIN} = 2^{EOCW_{min} - 1$9 pair as

$OCW_{MAX} = 2^{EOCW_{max} - 1$0

The percentage delay reduction relative to SA OFDMA is defined as

$OCW_{MAX} = 2^{EOCW_{max} - 1$1

where $OCW_{MAX} = 2^{EOCW_{max} - 1$2 is the delay with no RA RUs and $OCW_{MAX} = 2^{EOCW_{max} - 1$3 is the minimum delay achieved across tested UORA settings (Agbeve et al., 6 Oct 2025).

The strongest reported result is that UORA-based polling yields over 40% delay reduction compared to SA OFDMA under highly sparse and sporadic traffic conditions (Agbeve et al., 6 Oct 2025). The mechanism is especially advantageous when traffic is heterogeneous and dense, because it balances AP-controlled scheduled service for known active STAs with scalable discovery of newly active unscheduled STAs. The same study concludes that UORA achieves lower delay and higher throughput than alternatives in scenarios with a large number of stochastic STAs generating latency-sensitive traffic (Agbeve et al., 6 Oct 2025).

The comparison among competing mechanisms reveals distinct operating regimes. EDCA degrades very quickly and is shown only for one stochastic STA because its performance is already poor under that load. A2P achieves the lowest delay up to about 40 stochastic STAs, but beyond that point it sharply worsens as more stochastic STAs contend to get onto the polling list and the scheduler becomes less effective. By contrast, SA OFDMA and UORA are reported as the most scalable, keeping delay below 15 ms up to 90 stochastic STAs (Agbeve et al., 6 Oct 2025).

RA RU allocation has a pronounced effect. As the number of latency-sensitive stochastic STAs increases, increasing the number of RA RUs reduces delay up to the midpoint where RA and SA are equally split, with best behavior around 5 RA RUs out of 9 total 26-tone RUs. Beyond that point delay rises again, reflecting the trade-off between more access opportunities for unscheduled STAs and increased collision pressure in the RA region (Agbeve et al., 6 Oct 2025). UORA therefore performs best when used in moderation rather than as all-random access.

Throughput behavior is more stable than delay behavior because collisions occur in the BSR stage while all Basic-TF data RUs remain scheduled. Throughput remains fairly constant for SA OFDMA and UORA, with a notable exception when all RUs are reserved for RA in the BSR phase; in that case throughput drops because missed BSRs lead to underutilized scheduled data transmission (Agbeve et al., 6 Oct 2025). A separate validation study reports that throughput trends in ns-3 align well with an analytical model, with 80 MHz providing approximately 4× the performance of 20 MHz, while simulation throughput is slightly lower due to AP channel reacquisition between exchanges and the additional overhead of the separate Basic TF (Agbeve et al., 27 Jun 2025).

6. Analytical models and information freshness

Beyond throughput and delay, UORA has recently been analyzed through the Age of Information (AoI) lens (Liu et al., 8 Feb 2025). In that formulation, IEEE 802.11ax UORA is modeled as a trigger-based random access system with one AP, $OCW_{MAX} = 2^{EOCW_{max} - 1$4 time-sensitive STAs, and $OCW_{MAX} = 2^{EOCW_{max} - 1$5 random-access RUs. Time is slotted, with a slot defined as the time between the beginnings of two consecutive TFs: $OCW_{MAX} = 2^{EOCW_{max} - 1$6 Each STA generates status updates according to an i.i.d. Bernoulli arrival process with rate $OCW_{MAX} = 2^{EOCW_{max} - 1$7 per slot, maintains a size-1 buffer, and replaces older updates with newly arrived ones (Liu et al., 8 Feb 2025).

The paper distinguishes idle STAs, active STAs, and accessing STAs. An active STA is one with a status update in its buffer; an accessing STA is an active STA whose OBO counter has reached $OCW_{MAX} = 2^{EOCW_{max} - 1$8, making it eligible to select an RU and transmit. The long-term average AoI (AAoI) is defined as

$OCW_{MAX} = 2^{EOCW_{max} - 1$9

and is evaluated through the renewal-style expression

$OBO \in [0, OCW]$0

where $OBO \in [0, OCW]$1 is the interval between successive successful receptions from a STA and $OBO \in [0, OCW]$2 is the service time of the previously received update (Liu et al., 8 Feb 2025).

The central analytical contribution is a framework comprising two coupled discrete-time Markov chains (DTMCs): $OBO \in [0, OCW]$3, which tracks the number of active STAs in the BSS, and $OBO \in [0, OCW]$4, which tracks the OBO/backoff state of one STA. These chains are coupled through two quantities: $OBO \in [0, OCW]$5, the successful transmission probability of an accessing STA, and $OBO \in [0, OCW]$6, the stationary probability that an active STA is an accessing STA (Liu et al., 8 Feb 2025). The model adopts a standard decoupling approximation whereby each transmission attempt experiences a constant and independent success probability $OBO \in [0, OCW]$7.

From this framework, the paper derives a closed-form relation between $OBO \in [0, OCW]$8 and $OBO \in [0, OCW]$9, recursive expressions for the time from first arrival until successful transmission, and an analytical AAoI computation pipeline. The service-time term is approximated as

$OCW$0

which the authors explicitly identify as an approximation because packet preemption is not represented directly in the backoff DTMC (Liu et al., 8 Feb 2025).

A simplified regime with generate-at-will status updates $OCW$1 and fixed contention window $OCW$2 yields stronger structural results. In that regime, the paper proves a closed-form AAoI expression and a lower bound, and shows that AoI-optimal UORA should typically use a fixed or very shallow backoff window, with $OCW$3 preferred. It further proposes low-complexity optimization algorithms that approximate exhaustive-search optimum closely and reports that optimized UORA outperforms round-robin and max-AoI scheduling in large and low-traffic networks (Liu et al., 8 Feb 2025).

These results are methodologically distinct from the delay-focused ns-3 studies, but the design implications are consistent. Both lines of work indicate that UORA is most beneficial when centralized scheduling suffers from poor visibility of active demand, especially in large or sparse systems where deterministic polling or scheduling risks wasting opportunities on idle STAs (Liu et al., 8 Feb 2025).

7. Design trade-offs, limitations, and research directions

Several trade-offs recur across the literature. The first is the RA/SA split. Reserving some RA RUs in the BSRP stage improves the AP’s ability to discover newly active STAs, but reserving too many increases collision pressure and undermines the efficiency gains of scheduled service. Recent simulations locate the best behavior around an equal RA/SA split in the evaluated 9-RU, 20 MHz scenario, with 5 RA RUs emerging as a favorable operating point (Agbeve et al., 6 Oct 2025). This suggests that hybridization, rather than all-random access or all-scheduled operation, is the key design principle.

The second trade-off concerns contention-window tuning. UORA is highly sensitive to $OCW$4. In delay-based evaluation, $OCW$5 can produce performance worse than SA OFDMA, whereas $OCW$6 can reduce average delay relative to $OCW$7; moreover, the best $OCW$8 changes with both the number of stochastic STAs and the number of RA RUs (Agbeve et al., 6 Oct 2025). In AoI analysis, excessively deep exponential backoff worsens freshness, and the preferred regime is $OCW$9 or very small $OCW_{MIN}$0 (Liu et al., 8 Feb 2025). A plausible implication is that adaptive control of UORA parameters at the AP is central to practical deployment.

The third trade-off concerns what UORA should carry. Both implementation and performance studies explicitly argue that UORA is better suited to small signaling packets such as BSRs than to full data frames, because collisions and retransmissions are inherent to contention, and the cost of colliding data packets is much higher than the cost of colliding BSRs (Agbeve et al., 27 Jun 2025). This is why the evaluated mechanisms use random access in the BSR phase while keeping the data phase fully scheduled (Agbeve et al., 6 Oct 2025).

The current evidence base also has clear limitations. Delay and throughput studies are typically confined to a single BSS with no inter-BSS interference, no downlink traffic, idealized channel conditions, fixed PHY settings, and specific traffic models (Agbeve et al., 6 Oct 2025). The ns-3 implementation paper similarly focuses on validation against an analytical model rather than on fairness or heterogeneous channel conditions (Agbeve et al., 27 Jun 2025). The AoI analysis assumes a symmetric network, a collision-only channel model, and fixed AP trigger timing, and relies on decoupling and service-time approximations (Liu et al., 8 Feb 2025). These constraints do not invalidate the results, but they bound their direct generality.

Future work identified in the literature converges on parameter optimization. One study explicitly proposes future work on optimal selection of UORA parameters, potentially via mathematical optimization (Agbeve et al., 6 Oct 2025). Another develops efficient comparison-based algorithms for choosing $OCW_{MIN}$1 under AoI criteria and suggests that APs may achieve near-optimal operation without exhaustive search (Liu et al., 8 Feb 2025). Combined with the new open-source ns-3 infrastructure, this points toward a research agenda centered on adaptive RA/SA partitioning, dynamic OCW selection, trigger-frequency design, and cross-metric optimization spanning delay, throughput, and information freshness (Agbeve et al., 27 Jun 2025).

In contemporary IEEE 802.11ax research, UORA is therefore best characterized as a standard-compliant hybrid uplink control mechanism that augments scheduled OFDMA by enabling unscheduled STAs to opportunistically reveal buffered traffic. Its technical value lies not in replacing scheduling, but in resolving the unknown-buffer-status problem that limits the scalability of pure scheduled polling. Under sparse, sporadic, and latency-sensitive uplink demand—especially in dense deployments—this hybrid role has been shown to produce substantial delay gains, preserve throughput through scheduled data phases, and admit tractable optimization under AoI objectives (Agbeve et al., 6 Oct 2025).