延迟最优OFDMA功率和子带分配的分布式随机学习
Distributive Stochastic Learning for Delay-Optimal OFDMA Power and Subband Allocation
摘要:
在本文中,我们考虑了分布式感知的功率和子带分配设计的延迟最优的OFDMA上行链路系统与一个基站,$K$用户和$N_F$独立的子带。每个移动站都有一个上行链路队列,具有不同的分组到达和延迟要求。我们模型的问题作为一个无限的地平线平均奖励马尔可夫决策问题(MDP)的控制行动的瞬时信道状态信息(CSI)以及联合队列状态信息(QSI)的功能。为了解决分布式的要求和指数的内存需求和计算复杂性的问题,我们近似的子带分配Q-因子的每用户的子带分配Q-因子的总和,并推导出一个分布式的在线随机学习算法估计每个用户的Q-因子和拉格朗日乘子(LM),同时使用拍卖机制确定的控制动作。我们表明,在建议的拍卖机制,分布式在线学习几乎肯定收敛(概率为1)。为了说明,我们提出的分布式随机学习框架的应用程序的例子与指数包大小分布。我们表明,延迟最优功率控制具有{ \em多级注水}结构,其中CSI决定瞬时功率分配和QSI决定水位。所提出的算法具有线性的信令开销和计算复杂性$\mathcal O(KN)$,这是从实现的角度来看所期望的。
英文摘要:
In this paper, we consider the distributive queue-aware power and subband allocation design for a delay-optimal OFDMA uplink system with one base station, $K$ users and $N_F$ independent subbands. Each mobile has an uplink queue with heterogeneous packet arrivals and delay requirements. We model the problem as an infinite horizon average reward Markov Decision Problem (MDP) where the control actions are functions of the instantaneous Channel State Information (CSI) as well as the joint Queue State Information (QSI). To address the distributive requirement and the issue of exponential memory requirement and computational complexity, we approximate the subband allocation Q-factor by the sum of the per-user subband allocation Q-factor and derive a distributive online stochastic learning algorithm to estimate the per-user Q-factor and the Lagrange multipliers (LM) simultaneously and determine the control actions using an auction mechanism. We show that under the proposed auction mechanism, the distributive online learning converges almost surely (with probability 1). For illustration, we apply the proposed distributive stochastic learning framework to an application example with exponential packet size distribution. We show that the delay-optimal power control has the {\em multi-level water-filling} structure where the CSI determines the instantaneous power allocation and the QSI determines the water-level. The proposed algorithm has linear signaling overhead and computational complexity $\mathcal O(KN)$, which is desirable from an implementation perspective.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。