论文标题
URLLC的资源分配，并在上行链路无线网络中进行流量
Resource Allocation for URLLC and eMBB Traffic in Uplink Wireless Networks
论文作者
论文摘要
在本文中，我们考虑了URLLC流量的两个资源分配问题，并在上行链路5G网络中删除了流量。我们建议将频率分为一个公共区域和基于赠款的区域。基于赠款区域的频率只能由EMBB流量使用，而通用区域中的频率可以通过EMBB流量和URLLC流量使用。在第一个资源分配问题中，我们提出了一个两人游戏，以解决基于赠款区域的大小和公共区域的大小。我们证明该游戏具有特定的纯纳什平衡。在第二个资源分配问题中，我们确定了每个EMBB用户可以在请求授予周期中传输的数据包数量。我们提出了一个受限的优化问题，以最大程度地减少授予用户的数据包数量的差异。我们表明，填充水算法解决了这一受约束的优化问题。通过模拟，我们表明，根据游戏的NASH平衡，我们的方案由资源分配组成，持续的随机重新传递URLLC数据包以及通过填充水算法的EMBB数据包的分配，比其他四种启发式方法更好。
In this paper we consider two resource allocation problems of URLLC traffic and eMBB traffic in uplink 5G networks. We propose to divide frequencies into a common region and a grant-based region. Frequencies in the grant-based region can only be used by eMBB traffic, while frequencies in the common region can be used by eMBB traffic as well as URLLC traffic. In the first resource allocation problem we propose a two-player game to address the size of the grant-based region and the size of the common region. We show that this game has specific pure Nash equilibria. In the second resource allocation problem we determine the number of packets that each eMBB user can transmit in a request-grant cycle. We propose a constrained optimization problem to minimize the variance of the number of packets granted to the eMBB users. We show that a water-filling algorithm solves this constrained optimization problem. From simulation, we show that our scheme, consisting of resource allocation according to Nash equilibria of a game, persistent random retransmission of URLLC packets and allocation of eMBB packets by a water-filling algorithm, works better than four other heuristic methods.
