论文标题

通过深厚的增强学习传输电源池设计,以获取无资助的Noma-It网络

Transmit Power Pool Design for Grant-Free NOMA-IoT Networks via Deep Reinforcement Learning

论文作者

Fayaz, Muhammad, Yi, Wenqiang, Liu, Yuanwei, Nallanathan, Arumugam

论文摘要

无赠款的非正交多重访问(GF-NOMA)是短包联网(IoT)网络的潜在多重访问框架,以增强连接性。但是,由于缺乏闭环功率控制,GF-NOMA中的资源分配问题具有挑战性。我们设计了发射池(PP)的原型,以提供开环功率控制。物联网用户仅根据他们的通信距离就从该原型PP获得了发射功率。首先,提出了一个多代理深Q-NETWORK(DQN)辅助GF-NOMA算法来确定原型PP的最佳传输功率水平。更具体地说,每个物联网用户都充当代理,并通过与无线环境进行交互来学习策略,以指导他们选择最佳操作。其次,为防止Q学习模型高估问题,提出了基于双DQN的GF-NOMA算法。数值结果证实,基于双DQN的算法发现构成PP的最佳发射功率水平。与传统的在线学习方法相比,由于基于先前的学习限制了动作空间,因此提出的算法与原型PP在不断变化的环境下更快地收敛。考虑的GF-Noma系统以固定的传输功率优于网络,即所有用户都具有相同的传输功率和传统的GF,并具有正交多重访问技术,就吞吐量而言。

Grant-free non-orthogonal multiple access (GF-NOMA) is a potential multiple access framework for short-packet internet-of-things (IoT) networks to enhance connectivity. However, the resource allocation problem in GF-NOMA is challenging due to the absence of closed-loop power control. We design a prototype of transmit power pool (PP) to provide open-loop power control. IoT users acquire their transmit power in advance from this prototype PP solely according to their communication distances. Firstly, a multi-agent deep Q-network (DQN) aided GF-NOMA algorithm is proposed to determine the optimal transmit power levels for the prototype PP. More specifically, each IoT user acts as an agent and learns a policy by interacting with the wireless environment that guides them to select optimal actions. Secondly, to prevent the Q-learning model overestimation problem, double DQN based GF-NOMA algorithm is proposed. Numerical results confirm that the double DQN based algorithm finds out the optimal transmit power levels that form the PP. Comparing with the conventional online learning approach, the proposed algorithm with the prototype PP converges faster under changing environments due to limiting the action space based on previous learning. The considered GF-NOMA system outperforms the networks with fixed transmission power, namely all the users have the same transmit power and the traditional GF with orthogonal multiple access techniques, in terms of throughput.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源