Centralized dual-agent DRL for joint region and power resource optimization in mMTC

Read full text Summarise with VIRAT
Authors: Nasim Ravi, Nuno Lourenço, Marília Curado
Cited by: 0
References: 36

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

• Jointly optimizes region partitioning and region-specific power pool design. • Proposes a dual-agent DRL framework for cooperative region and power decisions. • Reduces action space complexity using modular base-station agents under CTDE. • Demonstrates superior energy efficiency and SIC success compared to fixed or gap-based baselines and outperforms single-agent in convergence. Achieving energy-efficient transmission with high decoding reliability is a fundamental challenge for massive machine-type communication (mMTC) using grant-free Non-Orthogonal Multiple Access (NOMA), due to dense device activity, sporadic traffic, and strong uplink interference. This paper introduces a Centralized Dual-Agent Deep Reinforcement Learning (CDA-DRL) framework that jointly optimizes region partitioning and transmit power pool design in uplink grant-free NOMA. Two cooperative agents at the base station independently learn the number of spatial regions and the number of power levels, respectively, using recurrent Deep Q-Networks under a centralized training and decentralized execution paradigm. This factorized architecture reduces the action-space complexity and enables scalable learning. Simulation results demonstrate that CDA-DRL achieves more stable training, higher Successive Interference Cancellation (SIC) decoding success, and significantly improved energy efficiency, outperforming geometric gap–based baselines by up to 114% and fixed-power schemes by 33%.

Fields of Study & Subjects

Advanced Wireless Communication Technologies IoT Networks and Protocols Advanced MIMO Systems Optimization

Publication details

Journal / source
Computer Networks
Volume
282
Pages
112262–112262
Publication date
31 March 2026
Language
EN