Joint Path Selection and Rate Allocation Framework for 5G Self-Backhauled mm-wave Networks

• Published in: IEEE transactions on wireless communications 2019-04, Vol.18 (4), p.2431-2445
• Main Authors: Vu, Trung Kien, Bennis, Mehdi, Debbah, Merouane, Latva-Aho, Matti
• Format: Article
• Language: English
• Subjects: 5G mobile communication; Bandwidths; Delays; Dynamic stability; Frequencies; Mathematical analysis; Mathematical models; Millimeter waves; mm-wave communications; multi-hop scheduling; Optimization; reinforcement learning; Reliability; Resource management; self-backhaul; Spread spectrum communication; stochastic optimization; Systems design; ultra-dense small cells; Ultra-low latency and reliable communication (URLLC); Wireless communication
• ISSN: 1536-1276; 1558-2248
• DOI: 10.1109/TWC.2019.2904275

Owing to severe path loss and unreliable transmission over a long distance at higher frequency bands, this paper investigates the problem of path selection and rate allocation for multi-hop self-backhaul millimeter-wave (mm-wave) networks. Enabling multi-hop mm-wave transmissions raises a potential issue of increased latency, and thus, this paper aims at addressing the fundamental questions: how to select the best multi-hop paths and how to allocate rates over these paths subject to latency constraints? In this regard, a new system design, which exploits multiple antenna diversity, mm-wave bandwidth, and traffic splitting techniques, is proposed to improve the downlink transmission. The studied problem is cast to as a network utility maximization, subject to the upper delay bound constraint, network stability, and network dynamics. By leveraging stochastic optimization, the problem is decoupled into: 1) path selection and 2) rate allocation sub-problems, whereby a framework which selects the best paths is proposed using reinforcement learning techniques. Moreover, the rate allocation is a non-convex program, which is converted into a convex one by using the successive convex approximation method. Via mathematical analysis, the comprehensive performance analysis and convergence proof are provided for the proposed solution. The numerical results show that the proposed approach ensures reliable communication with a guaranteed probability of up to 99.9999% and reduces latency by 50.64% and 92.9% as compared to baseline models. Furthermore, the results showcase the key tradeoff between latency and network arrival rate.