Evaluating UORA-Based Polling Mechanism for Latency-Sensitive Uplink Traffic in Wi-Fi Networks

2025-10-06

AI Summary

To address the poor scalability and high latency of polling-based uplink OFDMA scheduling in dense Wi-Fi 6 (IEEE 802.11ax) deployments, this paper systematically evaluates the suitability of Uplink Orthogonal Frequency-Division Multiple Access Random Access (UORA) for delay-sensitive uplink traffic. We propose a lightweight, cache-state-aware UORA mechanism that dynamically identifies contending stations without explicit polling, thereby balancing coordination overhead and system scalability. ns-3 simulations under dense deployment and heterogeneous traffic conditions demonstrate that UORA significantly outperforms conventional polling-based scheduling. Specifically, under sparse-traffic scenarios, UORA reduces end-to-end latency by over 40% compared to Scheduled Access OFDMA, markedly improving real-time responsiveness and spectrum utilization efficiency in high-concurrency environments.

Technology Category

• Planning, Routing, and Scheduling: Scheduling under Uncertainty
• Search and Optimization: Sampling/Simulation-based Search
• Multiagent Systems: Mechanism Design

Application Category

• Systems and Infrastructure for Web, Mobile and WoT: Web performance, measurement, and characterization
• Search and Retrieval-Augmented AI: Efficiency and scalability of Web search engines
• Security and Privacy: Large-scale security measurements

Abstract

IEEE 802.11ax (Wi-Fi 6) introduced Orthogonal Frequency Division Multiple Access (OFDMA), which enables simultaneous transmissions through centralized resource allocation. However, effective uplink scheduling requires the Access Point (AP) to identify which stations (STAs) have data to transmit. This typically necessitates polling for buffer status reports, a process that becomes increasingly inefficient and unscalable with growing device density. In this paper, we study how the Uplink OFDMA-based Random Access (UORA) feature improves the scalability and delay experienced by latency-sensitive data streams. We show that UORA enables efficient uplink scheduling while opportunistically identifying buffered traffic from unscheduled STAs, striking a balance between coordination and scalability. Performance evaluation of different polling strategies is done by means of simulation in ns-3. The results indicate that UORA-based polling outperforms alternative schemes in densely deployed network environments with heterogeneous uplink traffic patterns. Furthermore, under highly sparse and sporadic traffic conditions, UORA-based polling yields over 40% delay reduction compared to Scheduled Access (SA) OFDMA.

Problem

• Evaluating UORA-based polling for latency-sensitive uplink Wi-Fi traffic
• Improving scalability and delay in dense Wi-Fi 6 networks
• Balancing coordination and scalability for uplink OFDMA scheduling

Innovation

• UORA enables efficient uplink scheduling for Wi-Fi
• UORA identifies buffered traffic from unscheduled stations
• UORA reduces delay by 40% in sparse traffic