This paper studies the problem of online user grouping, scheduling and power allocation in beyond 5G cellular-based Internet of things networks. Due to the massive number of devices trying to be granted to the network, non-orthogonal multiple access method is adopted in order to accommodate multiple devices in the same radio resource block. Different from most previous works, the objective is to maximize the number of served devices while allocating their transmission powers such that their real-time requirements as well as their limited operating energy are respected. First, we formulate the general problem as a mixed integer non-linear program (MINLP) that can be transformed easily to MILP for some special cases. Second, we study its computational complexity by characterizing the NP-hardness of different special cases. Then, by dividing the problem into multiple NOMA grouping and scheduling subproblems, efficient online competitive algorithms are proposed. Further, we show how to use these online algorithms and combine their solutions in a reinforcement learning setting to obtain the power allocation and hence the global solution to the problem. Our analysis are supplemented by simulation results to illustrate the performance of the proposed algorithms with comparison to optimal and state-of-the-art methods.
翻译:本文研究了5G基于细胞的互联网网络以外的物质网络的在线用户分组、时间安排和权力分配问题。由于试图给予网络的装置数量庞大,因此采用了非横向多重访问方法,以容纳同一无线电资源区块的多种设备。与大多数以前的工作不同,目标是在分配其传输功能的同时,最大限度地增加服务设备的数量,使其实时要求和有限的操作能量得到尊重。首先,我们将一般问题作为一个混合的整数非线性程序(MINLP)来拟订,在某些特殊情况下可以很容易地转换为MILP(MILP)。第二,我们研究其计算复杂性,对不同特殊案例的NP-硬性进行定性。然后,通过将问题分为多个NOMA分组和安排子问题,提出高效的在线竞争性算法。此外,我们展示了如何使用这些在线算法并将其解决方案结合到强化学习环境中,以获得权力分配,从而实现问题的全球解决办法。我们的分析得到模拟结果的补充,以说明与最佳和状态方法相比较的拟议算法的绩效。