arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2410.03398eess.SP
收藏

强化学习辅助的NOMA随机接入:基于AoI的时效性视角

Reinforcenment Learning-Aided NOMA Random Access: An AoI-Based Timeliness Perspective

Felippe Moraes Pereira, Jamil de Araujo Farhat, João Luiz Rebelatto, Glauber Brante, Richard Demo Souza

AI总结:

本文提出AoI-QL-NOMA方案,利用Q-learning在免授权NOMA网络中分布式优化设备传输时隙和功率,以最小化网络平均AoI,在保持吞吐量的同时显著提升信息时效性。

摘要:

本文研究了功率域非正交多址接入(NOMA)网络的信息年龄(AoI),其中多个物联网(IoT)设备以免授权随机方式向公共网关传输。更具体地说,我们考虑由多个时隙组成的分帧设置,并借助Q-learning算法以分布式方式合理确定每个IoT设备在帧内传输的时隙和功率电平。在所提出的AoI-QL-NOMA方案中,Q-learning奖励被调整以最小化网络的平均AoI,同时每个时隙仅需一个反馈比特,以帧为单位进行。结果表明,与最近提出的一些方案相比,AoI-QL-NOMA显著改善了AoI性能,且未显著降低网络吞吐量。

英文摘要:

In this paper, we investigate the age-of-information (AoI) of a power domain non-orthogonal multiple access (NOMA) network, where multiple internet-of-things (IoT) devices transmit to a common gateway in a grant-free random fashion. More specifically, we consider a framed setup composed of multiple time slots, and resort to the $Q$-learning algorithm to properly define, in a distributed manner, the time slot and the power level each IoT device transmits within a frame. In the proposed AoI-QL-NOMA scheme, the $Q$-learning reward is adapted with the aim of minimizing the average AoI of the network, while only requiring a single feedback bit per time slot, in a frame basis. Our results show that AoI-QL-NOMA significantly improves the AoI performance compared to some recently proposed schemes, without significantly reducing the network throughput.

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

↑