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

mURLLC中用于免授权NOMA优化的通用深度强化学习框架

A General Deep Reinforcement Learning Framework for Grant-Free NOMA Optimization in mURLLC

Yan Liu, Yansha Deng, Hui Zhou, Maged Elkashlan, Arumugam Nallanathan

摘要:

免授权非正交多址接入(GF-NOMA)是支持大规模超可靠低延迟通信(mURLLC)业务的一种潜在技术。然而,GF-NOMA系统中的动态资源配置是具有挑战性的,由于随机业务和冲突,这是未知的基站(BS)。同时,延迟和可靠性要求的联合考虑使得用于mURLLC的GF-NOMA的资源配置更加复杂。为了解决这个问题,我们开发了一个通用的学习框架,基于签名的GF-NOMA在mURLLC服务考虑到多址接入签名冲突,UE检测,以及数据解码过程的K-重复GF和主动GF计划。我们的学习框架的目标是在延迟约束下最大化成功服务的用户(UE)的长期平均数量。我们首先执行一个实时的重复值配置的基础上的双深度Q网络(DDQN),然后提出了一个合作的多智能体学习技术的基础上的DQN(CMA-DQN),以优化配置的重复值和竞争传输单元(CTU)的数量。我们的研究结果表明,在我们提出的学习框架中,在相同的延迟约束下,成功服务的UE的数量对于K-重复方案是10倍,对于主动方案是2倍,比具有固定重复值和CTU数量的多。此外,CMA-DQN优于传统的基于负载估计的方法(LE-URC)的性能证明了其长期动态配置的能力。重要的是,我们的通用学习框架可以用来优化所有基于签名的GF-NOMA方案中的资源配置问题。

英文摘要:

Grant-free non-orthogonal multiple access (GF-NOMA) is a potential technique to support massive Ultra-Reliable and Low-Latency Communication (mURLLC) service. However, the dynamic resource configuration in GF-NOMA systems is challenging due to random traffics and collisions, that are unknown at the base station (BS). Meanwhile, joint consideration of the latency and reliability requirements makes the resource configuration of GF-NOMA for mURLLC more complex. To address this problem, we develop a general learning framework for signature-based GF-NOMA in mURLLC service taking into account the multiple access signature collision, the UE detection, as well as the data decoding procedures for the K-repetition GF and the Proactive GF schemes. The goal of our learning framework is to maximize the long-term average number of successfully served users (UEs) under the latency constraint. We first perform a real-time repetition value configuration based on a double deep Q-Network (DDQN) and then propose a Cooperative Multi-Agent learning technique based on the DQN (CMA-DQN) to optimize the configuration of both the repetition values and the contention-transmission unit (CTU) numbers. Our results show that the number of successfully served UEs under the same latency constraint in our proposed learning framework is up to ten times for the K-repetition scheme, and two times for the Proactive scheme, more than that with fixed repetition values and CTU numbers. In addition, the superior performance of CMA-DQN over the conventional load estimation-based approach (LE-URC) demonstrates its capability in dynamically configuring in long term. Importantly, our general learning framework can be used to optimize the resource configuration problems in all the signature-based GF-NOMA schemes.

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

↑