Online Frequency Scheduling by Learning Parallel Actions
Radio Resource Management is a challenging topic in future 6G networks where novel applications create strong competition among the users for the available resources. In this work we consider the frequency scheduling problem in a multi-user MIMO system. Traditional methods are insufficient to cope with all the involved constraints and uncertainties, whereas reinforcement learning can directly learn near-optimal solutions for such complex environments. However, the scheduling problem has an enormous action space accounting for all the combinations of users and sub-bands, so out-of-the-box algorithms cannot be used directly. In this work, we propose a scheduler based on action-branching over sub-bands, which is a deep Q-learning architecture with parallel decision capabilities. The sub-bands learn correlated but local decision policies and altogether they optimize a global reward. To improve the scaling of the architecture with the number of sub-bands, we propose variations (unibranch, GNN-based) that reduce the number of parameters to learn. The parallel decision making of the proposed architecture allows to meet short inference time requirements in real systems. Furthermore, the deep Q-learning approach permits online fine-tuning after deployment to bridge the sim-to-real gap. The proposed architectures are evaluated against relevant baselines from the literature showing competitive performance and possibilities of online adaptation to evolving environments.
Authors
- Mathieu Leconte
- Sabrine Aroua
- David E. Sandberg (ORCID: https://orcid.org/0000-0002-7389-8283)
- Anastasios Giovanidis (ORCID: https://orcid.org/0000-0002-7121-4802)
- Tor Kvernvik
Institutions
- Ericsson (Sweden) (SE)
Publication Details
- Published
- 2024-10-21
- DOI
- https://doi.org/10.1109/6gnet63182.2024.10765674
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00