🤖 AI Summary
This work addresses the insufficient timeliness of status updates in uplink orthogonal frequency-division multiple access (UORA) for WiFi 6 (IEEE 802.11ax). We present the first systematic modeling and optimization of Age of Information (AoI) performance in UORA. A two-layer discrete-time Markov chain (DTMC) model is proposed to characterize the transmission dynamics of stations (STAs), enabling derivation of a closed-form expression for the average AoI (AAoI) and its analytically tractable lower bound. Furthermore, we design a lightweight parameter optimization algorithm requiring only a few comparisons. Experimental results demonstrate that the algorithm achieves near-optimal AoI performance and significantly outperforms both polling and max-AoI strategies under both high- and low-load conditions. This work fills a critical gap in the analysis and optimization of AoI in UORA networks.
📝 Abstract
The latest WiFi standard, IEEE 802.11ax (WiFi 6), introduces a novel uplink random access mechanism called uplink orthogonal frequency division multiple access-based random access (UORA). While existing work has evaluated the performance of UORA using conventional performance metrics, such as throughput and delay, its information freshness performance has not been thoroughly investigated in the literature. This is of practical significance as WiFi 6 and beyond are expected to support real-time applications. This paper presents the first attempt to fill this gap by investigating the information freshness, quantified by the Age of Information (AoI) metric, in UORA networks. We establish an analytical framework comprising two discrete-time Markov chains (DTMCs) to characterize the transmission states of stations (STAs) in UORA networks. Building on the formulated DTMCs, we derive an analytical expression for the long-term average AoI (AAoI), facilitating the optimization of UORA parameters for enhanced AoI performance through exhaustive search. To gain deeper design insights and improve the effectiveness of UORA parameter optimization, we derive a closed-form expression for the AAoI and its approximated lower bound for a simplified scenario characterized by a fixed backoff contention window and generate-at-will status updates. By analyzing the approximated lower bound of the AAoI, we propose efficient UORA parameter optimization algorithms that can be realized with only a few comparisons of different possible values of the parameters to be optimized. Simulation results validate our analysis and demonstrate that the AAoI achieved through our proposed parameter optimization algorithm closely approximates the optimal AoI performance obtained via exhaustive search, outperforming the round-robin and max-AoI policies in large and low-traffic networks.