Skip to search boxSkip to navigationSkip to main content

A comparison of reinforcement learning algorithms in fairness-oriented OFDMA schedulers

  • Ioan-Sorin Comșa
    ,
  • Sijing Zhang
    ,
  • Mehmet Emin Aydin
    ,
  • Pierre Kuonen
    ,
  • Ramona Trestian
    ,
  • Gheorghiţă Ghinea
  • HEIA-FR
    ,
  • Middlesex University
Research Output: Contribution to journal Article Peer-review

Open access

Abstract

Due to large-scale control problems in 5G access networks, the complexity of radio resource management is expected to increase significantly. Reinforcement learning is seen as a promising solution that can enable intelligent decision-making and reduce the complexity of different optimization problems for radio resource management. The packet scheduler is an important entity of radio resource management that allocates users’ data packets in the frequency domain according to the implemented scheduling rule. In this context, by making use of reinforcement learning, we could actually determine, in each state, the most suitable scheduling rule to be employed that could improve the quality of service provisioning. In this paper, we propose a reinforcement learning-based framework to solve scheduling problems with the main focus on meeting the user fairness requirements. This framework makes use of feed forward neural networks to map momentary states to proper parameterization decisions for the proportional fair scheduler. The simulation results show that our reinforcement learning framework outperforms the conventional adaptive schedulers oriented on fairness objective. Discussions are also raised to determine the best reinforcement learning algorithm to be implemented in the proposed framework based on various scheduler settings. View Full-Text

Publication Information

Output type

Research Output: Contribution to journal Article Peer-review

Original language

English

Pages from-to (Number of pages)

Pages 315

Journal (Volume, Issue Number)

Information (Switzerland) (Volume 10, Issue 10)

Publication milestones

  • Accepted/In press - 09/10/2019
  • Published - 14/10/2019

Publication status

Published - 14/10/2019

ISSN

2078-2489

External Publication IDs

  • handle.net: 10547/623639
  • Scopus: 85074024650

Access to documents

Publication metrics

Metrics

Download statistics
Download count
2