arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1607.07547cs.ITmath.IT
收藏

训练型大规模天线系统中时延最优的上行链路调度策略

Latency-Optimal Uplink Scheduling Policy in Training-based Large-Scale Antenna Systems

Kyung Jun Choi, Kwang Soon Kim

摘要:

在本文中,上行链路调度策略问题,以最大限度地减少网络延迟,定义为空中时间,以服务所有用户的服务质量(QoS),在能量约束下,被认为是在一个基于训练的大规模天线系统(LSAS)采用一个简单的线性接收机。提出了一种具有多项式时间复杂度的精确时延最优上行调度策略的优化算法。通过数值模拟,它表明,所提出的调度策略可以提供几倍的网络延迟比传统的在现实环境中。此外,所提出的调度策略及其网络延迟进行了渐近分析,以提供更好的洞察系统的行为。根据平均接收信号质量$ρ$和BS天线的数量$M$,将四种操作状态分类。结果表明,正交导频仅在$ρ\gg1$和$ M\ll \log^2ρ$机制中是最优的。在其它方案($ρ\ll 1$或$ M\gg \log^2ρ$)中,结果是非正交导频变得最优。更严格地说,使用非正交导频可以在$ρ\ll 1$时将网络延迟降低$Θ(M)$的一个因子,或者在$ρ\gg 1$和$M\gg \logρ$时将网络延迟降低$Θ(\sqrt{M}/\log M)$的一个因子,这将是设计5G未来蜂窝系统的关键准则。

英文摘要:

In this paper, an uplink scheduling policy problem to minimize the network latency, defined as the air-time to serve all of users with a quality-of-service (QoS), under an energy constraint is considered in a training-based large-scale antenna systems (LSAS) employing a simple linear receiver. An optimal algorithm providing the exact latency-optimal uplink scheduling policy is proposed with a polynomial-time complexity. Via numerical simulations, it is shown that the proposed scheduling policy can provide several times lower network latency over the conventional ones in realistic environments. In addition, the proposed scheduling policy and its network latency are analyzed asymptotically to provide better insights on the system behavior. Four operating regimes are classified according to the average received signal quality, $ρ$, and the number of BS antennas, $M$. It turns out that orthogonal pilots are optimal only in the regime $ρ\gg1$ and $ M\ll \log^2ρ$. In other regimes ($ρ\ll 1$ or $ M\gg \log^2ρ$), it turns out that non-orthogonal pilots become optimal. More rigorously, the use of non-orthogonal pilots can reduce the network latency by a factor of $Θ(M)$ when $ρ\ll 1$ or by a factor of $Θ(\sqrt{M}/\log M)$ when $ρ\gg 1$ and $M\gg \logρ$, which would be a critical guideline for designing 5G future cellular systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑