Delay guaranteed joint user association and channel allocation for fog radio access networks
journal contributionposted on 2021-02-19, 11:32 authored by Minglei You, Gan Zheng, Tianrui ChenTianrui Chen, Hongjian Sun, Kwang-Cheng Chen
IEEE In the Fog Radio Access Networks (F-RANs), the local storage and computing capability of Fog Access Points (FAPs) provide new communication resources to address the latency and computing constraints for delay-sensitive applications. To achieve the ultra-low latency, a novel joint user association and channel allocation scheme is proposed in this paper, where the FAPs are clustered from a user-centric perspective. The delay performance is improved regarding both the control signaling procedure and the data transmission procedure. Specifically, the multiple access interference (MAI) between users is analyzed, where the closed-form expression for the effective rate of a typical user with multiple FAP connections and arbitrary interfering users is obtained. With the consideration of MAI, the proposed distributed joint user association and channel allocation algorithm provides a guaranteed delay violation probability. Moreover, the distributed algorithm can be conducted on individual FAPs, whose calculation is simplified by look-up tables. Simulation results show that the proposed algorithm is capable of providing statistical delay performance guarantee including both average delay and delay bound violation probability, which demonstrates its superiority in supporting delay-sensitive applications in F-RANs.
Unlocking Potentials of MIMO Full-duplex Radios for Heterogeneous Networks (UPFRONT)
Engineering and Physical Sciences Research CouncilFind out more...
Leverhulme Trust Research Project Grant under grant number RPG-2017-129
- Mechanical, Electrical and Manufacturing Engineering
Published inIEEE Transactions on Wireless Communications
Pages3723 - 3733
- AM (Accepted Manuscript)
Rights holder© IEEE
Publisher statementPersonal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.