Optimization of 5G uRLLC Scheduling Using Deep Reinforcement Learning: From DDPG to Ka-SAC

uRLLC services in 5G often need to handle time-sensitive traffic. Existing scheduling algorithms are not designed for this type of traffic and perform poorly. As the scheduling policy is a mapping from channel and queue states to scheduling actions, it can be optimized by using Deep Reinforcement Learning (DRL) algorithms. In this paper, the scheduling problem is modelled using a theoretical model of wireless communications and set up as a Markov decision problem that can be solved by DRL and considered using the Deep Deterministic Policy Gradient (DDPG) algorithm. Tests show that the convergence speed and quality of service (QoS) performance is poor when applying ordinary DDPG directly. This paper optimises this by reproducing the knowledge-assisted DDPG (Ka-DDPG), which is based on expert knowledge of this type of problem and uses techniques such as multiple output value networks, reward shaping and importance sampling to improve QoS performance. Finally, this paper uses Soft Actor-Critic (SAC) to optimise Ka-DDPG, and proposes a knowledge-assisted SAC algorithm (Ka-SAC) based on it. Experimental results show that Ka-SAC can significantly improve QoS performance and convergence speed.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1145/3717934.3717952
Primary Topic
Network Time Synchronization Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimization of 5G uRLLC Scheduling Using Deep Reinforcement Learning: From DDPG to Ka-SAC

Qinghua Zhu, Qi Liu, Yu Chen
Network Time Synchronization Technologies
article

Optimization of 5G uRLLC Scheduling Using Deep Reinforcement Learning: From DDPG to Ka-SAC

Qinghua Zhu, Qi Liu, Yu Chen
article en

Abstract

uRLLC services in 5G often need to handle time-sensitive traffic. Existing scheduling algorithms are not designed for this type of traffic and perform poorly. As the scheduling policy is a mapping from channel and queue states to scheduling actions, it can be optimized by using Deep Reinforcement Learning (DRL) algorithms. In this paper, the scheduling problem is modelled using a theoretical model of wireless communications and set up as a Markov decision problem that can be solved by DRL and considered using the Deep Deterministic Policy Gradient (DDPG) algorithm. Tests show that the convergence speed and quality of service (QoS) performance is poor when applying ordinary DDPG directly. This paper optimises this by reproducing the knowledge-assisted DDPG (Ka-DDPG), which is based on expert knowledge of this type of problem and uses techniques such as multiple output value networks, reward shaping and importance sampling to improve QoS performance. Finally, this paper uses Soft Actor-Critic (SAC) to optimise Ka-DDPG, and proposes a knowledge-assisted SAC algorithm (Ka-SAC) based on it. Experimental results show that Ka-SAC can significantly improve QoS performance and convergence speed.

Beijing Polytechnic (CN)
Openalex Percentile: Top 64%
Network Time Synchronization Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.