Solving Integrated Access Backhaul Frequency Allocation Problem with Graph-Based Deep Reinforcement Learning 


Vol. 51,  No. 2, pp. 275-284, Feb.  2026
10.7840/kics.2026.51.2.275


PDF Full-Text
  Abstract

We present a novel deep reinforcement learning (DRL) framework for ultra-dense integrated access and backhaul (IAB) frequency allocation, formulated as a combinatorial optimization problem. Our approach leverages graph neural networks (GNNs) to model the network as a graph optimization task, capturing intricate spatial dependencies. To further enhance learning, we integrate a transformer-based attention mechanism that dynamically prioritizes critical factors such as channel states, interference patterns, and resource allocation states. Unlike conventional time-based DRL optimization methods, our framework employs an iterative optimization approach that allocates one resource per step, thereby effectively addressing the curse of dimensionality in DRL.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Related Articles
  Cite this article

[IEEE Style]

R. M. Syahran, W. W. Ro, K. W. Choi, "Solving Integrated Access Backhaul Frequency Allocation Problem with Graph-Based Deep Reinforcement Learning," The Journal of Korean Institute of Communications and Information Sciences, vol. 51, no. 2, pp. 275-284, 2026. DOI: 10.7840/kics.2026.51.2.275.

[ACM Style]

Raihan Muhammad Syahran, Won Woo Ro, and Kae Won Choi. 2026. Solving Integrated Access Backhaul Frequency Allocation Problem with Graph-Based Deep Reinforcement Learning. The Journal of Korean Institute of Communications and Information Sciences, 51, 2, (2026), 275-284. DOI: 10.7840/kics.2026.51.2.275.

[KICS Style]

Raihan Muhammad Syahran, Won Woo Ro, Kae Won Choi, "Solving Integrated Access Backhaul Frequency Allocation Problem with Graph-Based Deep Reinforcement Learning," The Journal of Korean Institute of Communications and Information Sciences, vol. 51, no. 2, pp. 275-284, 2. 2026. (https://doi.org/10.7840/kics.2026.51.2.275)
Vol. 51, No. 2 Index