论文标题
新鲜公平性：基于OFDMA调度的最佳信息年龄，知识最少
Fairness for Freshness: Optimal Age of Information Based OFDMA Scheduling with Minimal Knowledge
论文作者
论文摘要
越来越清楚的是，无线网络的重要任务是最大程度地减少信息时代（AOI），即信息传递的及时性。尽管主流方法通常依赖于对用户AOI和渠道状态的实时观察，但在完全（或部分）缺乏此类知识的情况下，很少关注该问题。在本文中，我们提出了一项新的研究，以解决正交频施加多路复用访问（OFDMA）系统中最佳盲目无线电资源调度问题，以最大程度地减少长期平均AOI，这证明是时间域 - 费用聚类的聚类圆形旋翼蛋白和频率符合频率符合的内在群集群群集中群的组成。还提出了仿真结果表明的启发式解决方案，以在存在各种程度的额外知识（例如通道状态和AOI）时有效地提高性能。
It is becoming increasingly clear that an important task for wireless networks is to minimize the age of information (AoI), i.e., the timeliness of information delivery. While mainstream approaches generally rely on the real-time observation of user AoI and channel state, there has been little attention to solve the problem in a complete (or partial) absence of such knowledge. In this article, we present a novel study to address the optimal blind radio resource scheduling problem in orthogonal frequency division multiplexing access (OFDMA) systems towards minimizing long-term average AoI, which is proven to be the composition of time-domain-fair clustered round-robin and frequency-domain-fair intra-cluster sub-carrier assignment. Heuristic solutions that are near-optimal as shown by simulation results are also proposed to effectively improve the performance upon presence of various degrees of extra knowledge, e.g., channel state and AoI.
