Exploring Reinforcement Learning for Scheduling in Cellular Networks

Cellular network scheduling is crucial for wireless deployments like 4G, 5G, and 6G and is a challenging resource allocation task performed by the scheduler located at the base stations. The scheduler must balance two critical metrics, throughput and fairness, which often conflict, as maximizing throughput favors users with better channel conditions, while ensuring fairness requires allocating resources to those with poorer channel conditions. The proportional fairness metric is a prominent scheduling approach that aims to balance these competing metrics with minimal compromise. The common strategy to attain proportional fairness relies on a greedy approach in which each resource block is allocated to the user who maximizes the proportional fairness criterion. With such a strategy, the scheduler can ensure that the resources allocated to the users at each time instance maximize the proportional fairness metric. However, users can usually tolerate some delay and are willing to accept temporary fairness imbalances if they ultimately improve their performance, provided that the fairness criterion is maintained over time. In this paper, we propose a new scheduler that uses reinforcement learning to enhance proportional fairness. The suggested scheduler considers both current and predicted future channel conditions for each user, aiming to maximize the proportional fairness criterion over a set of predefined periodic time epochs. Specifically, by learning patterns in channel fluctuations, our reinforcement learning-based scheduler allocates each resource block not to the user who maximizes the instantaneous proportional fairness metric, but to the user who maximizes the expected proportional fairness metric at the end of the current time epoch. This approach achieves an improved balance between throughput and fairness across multiple slots. Simulations demonstrate that our approach outperforms standard proportional fairness scheduling. We further implemented the proposed scheme on a live 4G eNodeB station and observed similar gains.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2024-10-25
DOI
https://doi.org/10.3390/math12213352
Citations
3
Primary Topic
Advanced MIMO Systems Optimization
Type
article
Field-Weighted Citation Impact
0.63
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Exploring Reinforcement Learning for Scheduling in Cellular Networks

Omer Gurewitz, Asaf Cohen, Erez Biton, Nimrod Gradus
3 citations
Mathematics
Advanced MIMO Systems Optimization
0.63
article

Exploring Reinforcement Learning for Scheduling in Cellular Networks

Omer Gurewitz, Asaf Cohen, Erez Biton, Nimrod Gradus
article en
3 citations

Abstract

Cellular network scheduling is crucial for wireless deployments like 4G, 5G, and 6G and is a challenging resource allocation task performed by the scheduler located at the base stations. The scheduler must balance two critical metrics, throughput and fairness, which often conflict, as maximizing throughput favors users with better channel conditions, while ensuring fairness requires allocating resources to those with poorer channel conditions. The proportional fairness metric is a prominent scheduling approach that aims to balance these competing metrics with minimal compromise. The common strategy to attain proportional fairness relies on a greedy approach in which each resource block is allocated to the user who maximizes the proportional fairness criterion. With such a strategy, the scheduler can ensure that the resources allocated to the users at each time instance maximize the proportional fairness metric. However, users can usually tolerate some delay and are willing to accept temporary fairness imbalances if they ultimately improve their performance, provided that the fairness criterion is maintained over time. In this paper, we propose a new scheduler that uses reinforcement learning to enhance proportional fairness. The suggested scheduler considers both current and predicted future channel conditions for each user, aiming to maximize the proportional fairness criterion over a set of predefined periodic time epochs. Specifically, by learning patterns in channel fluctuations, our reinforcement learning-based scheduler allocates each resource block not to the user who maximizes the instantaneous proportional fairness metric, but to the user who maximizes the expected proportional fairness metric at the end of the current time epoch. This approach achieves an improved balance between throughput and fairness across multiple slots. Simulations demonstrate that our approach outperforms standard proportional fairness scheduling. We further implemented the proposed scheme on a live 4G eNodeB station and observed similar gains.

MathematicsVol. 12(21)
Ben-Gurion University of the Negev (IL)
No poverty
Openalex Percentile: Top 31%
Advanced MIMO Systems Optimization
0.63
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.