Article (Scientific journals)
Computation Rate Maximization for SCMA-Aided Edge Computing in IoT Networks: A Multi-Agent Reinforcement Learning Approach
Liu, Pengtao; An, Kang; Lei, Jing et al.
2024In IEEE Transactions on Wireless Communications, 23 (8), p. 10414 - 10429
Peer Reviewed verified by ORBi
 

Files


Full Text
Computation_Rate_Maximization_for_SCMA-Aided_Edge_Computing_in_IoT_Networks_A_Multi-Agent_Reinforcement_Learning_Approach.pdf
Author postprint (10.67 MB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
computation offloading; IoT; MEC; multi-agent reinforcement learning; resource allocation; SCMA; Computation offloading; Heuristics algorithm; Multi-agent reinforcement learning; Multiple access; NOMA; Optimisations; Resource management; Resources allocation; Sparse code multiple access; Sparse codes; Task analysis; Computer Science Applications; Electrical and Electronic Engineering; Applied Mathematics; Internet of Things; Heuristic algorithms; Optimization; Long short term memory
Abstract :
[en] Integrating sparse code multiple access (SCMA) and mobile edge computing (MEC) into the Internet of Things (IoT) networks can enable efficient connectivity and timely computation for resource-limited IoT users. This paper studies the computation rate maximization problem under task deadline constraints in dynamic SCMA-MEC networks. Specifically, we propose a predictive deep Q-network for SCMA resource allocation and computation offloading (PQ-RACO) algorithm for single-cell scenarios, where IoT devices use long short-term memory (LSTM) networks to predict the states and actions of other agents. However, the PQ-RACO algorithm is not scalable for increasing numbers of IoT devices. To address this issue, an improved multi-agent deep Q-network for SCMA resource allocation and computation offloading algorithm (MQ-RACO) is proposed for multi-cell scenarios. The algorithm is a centralized training and decentralized execution (CTDE) multi-agent reinforcement learning (MARL) algorithm with explicit rewards, which is tailored to the special structure of joint rewards. Simulation results demonstrate that the proposed algorithm outperforms several state-of-the-art MARL algorithms and other benchmark schemes in terms of convergence speed and computation rate.
Disciplines :
Computer science
Author, co-author :
Liu, Pengtao ;  National University of Defense Technology, College of Electronic Science and Technology, Changsha, China
An, Kang ;  Sixty-Third Research Institute, National University of Defense Technology, Nanjing, China
Lei, Jing ;  National University of Defense Technology, College of Electronic Science and Technology, Changsha, China
Sun, Yifu ;  National University of Defense Technology, College of Electronic Science and Technology, Changsha, China
Liu, Wei ;  National University of Defense Technology, College of Electronic Science and Technology, Changsha, China
CHATZINOTAS, Symeon  ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom
External co-authors :
yes
Language :
English
Title :
Computation Rate Maximization for SCMA-Aided Edge Computing in IoT Networks: A Multi-Agent Reinforcement Learning Approach
Publication date :
2024
Journal title :
IEEE Transactions on Wireless Communications
ISSN :
1536-1276
eISSN :
1558-2248
Publisher :
Institute of Electrical and Electronics Engineers Inc.
Volume :
23
Issue :
8
Pages :
10414 - 10429
Peer reviewed :
Peer Reviewed verified by ORBi
Funders :
National Natural Science Foundation of China
National Natural Science Foundation of China
Available on ORBilu :
since 26 March 2026

Statistics


Number of views
18 (0 by Unilu)
Number of downloads
10 (0 by Unilu)

Scopus citations®
 
32
Scopus citations®
without self-citations
30
OpenCitations
 
13
OpenAlex citations
 
28
WoS citations
 
26

Bibliography


Similar publications



Contact ORBilu