跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+816新增论文
+642其中 AI 相关
+95已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-21 12:19 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-20 13:49 — 2026-11-21 13:49(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-21 12:19最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
新论文 · v1arXiv:2611.17898

Evaluating Polling Schemes for OFDMA Uplink Scheduling in Time-Sensitive Wi-Fi Networks

Douglas Dziedzorm Agbeve, Ferhat Van Herck, Andrey Belogaev, Jeroen Famaey

原文摘要

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.

cs.NI