IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i21p3352-d1506815.html
   My bibliography  Save this article

Exploring Reinforcement Learning for Scheduling in Cellular Networks

Author

Listed:
  • Omer Gurewitz

    (School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer-Sheva 8410501, Israel)

  • Nimrod Gradus

    (School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer-Sheva 8410501, Israel)

  • Erez Biton

    (School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer-Sheva 8410501, Israel)

  • Asaf Cohen

    (School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer-Sheva 8410501, Israel)

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.

Suggested Citation

  • Omer Gurewitz & Nimrod Gradus & Erez Biton & Asaf Cohen, 2024. "Exploring Reinforcement Learning for Scheduling in Cellular Networks," Mathematics, MDPI, vol. 12(21), pages 1-34, October.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:21:p:3352-:d:1506815
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/21/3352/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/21/3352/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:21:p:3352-:d:1506815. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.