AI & ML
Evaluating Polling Schemes for OFDMA Uplink Scheduling in Time-Sensitive Wi-Fi Networks
arXiv cs.NI0 views
arXiv:2611.17898v1 Announce Type: new Abstract: IEEE 802.11ax introduced orthogonal frequency division multiple access (OFDMA) to improve channel utilization through concurrent multi-user transmissions. For effective uplink (UL) scheduling, the access point (AP) requires timely knowledge of buffered traffic at the stations (STAs). Explicit buffer-status polling provides this, yet each polling round can query only as many STAs as there are resource units (RUs). Scheduled-access, random-access, activity-based, and learning-based schemes address this buffer-status acquisition problem differently and have generally been evaluated in isolation under different conditions, so it remains unclear how they compare across time-sensitive workloads. We evaluate common schemes from the Wi-Fi standard and literature under three time-sensitive environments: a large-scale teleconferencing session, an industrial IoT deployment, and an extended reality (XR) service. The relative performance of the schemes depends strongly on traffic characteristics and offered load. In conferencing, activity-based and learning-based polling perform best, while conventional contention-based access remains competitive under light load. In the industrial scenario, scheduled-access most effectively delivers time-sensitive packets within their deadlines under heavy load, whereas contention-based access performs best under lighter load. In XR, OFDMA-based schemes achieve high video throughput that contention-based access cannot sustain; among them, activity-based polling achieves the lowest deadline-miss ratios for uplink head-tracking traffic, at the expense of longer video delay tails. These findings highlight the importance of selecting channel access and scheduling schemes according to traffic requirements and operating conditions.
Source:https://arxiv.org/abs/2611.17898PreviousStarlight: Whittle-Driven Fidelity Rescue for Satellite-Terrestrial Quantum NetworksNextPRISM: A Post-Prediction Reliability Framework for Evidence-Guided Correction and Selective Abstention
Related posts
Kusner's conjecture on equilateral sets is false
0arXiv cs.NA
Nearly Optimal Fixed-Confidence Best-Arm Identification with 1-Bit Feedback
0arXiv stat.ML
When Does On-Policy Interaction Help? Representational Tradeoffs in Value-Based Imitation Learning
0arXiv stat.ML
Disentangling Continuous-Time Latent Dynamics: Identifiability of Latent SDEs via Diffusion Shifts
0arXiv stat.ML
Exact Constrained Decoding for Sequence Models: Controller-Augmented Hidden Markov Models and Beyond
0arXiv stat.ML
Kernel-based potential mean-field games with unbiased random Fourier $U$-statistics
0arXiv stat.ML