Delay Guaranteed Joint User Association and Channel Allocation for Fog Radio Access Networks

Abstract

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.

A Survey on Resource Management for 6G Heterogeneous Networks: Current Research, Future Trends, and Challenges

“…By selecting one or more of the BSs to associate with, each UE received the required data rate from a BS, which can guarantee their minimum required rates. In [107], the authors investigated a joint UA and channel allocation problem of a fog radio access network in the uplink scenario. A novel joint UA and channel allocation scheme are developed in order to accomplish the ultra-low latency goal.…”

Joint Optimization Scheme of User Association and Channel Allocation in 6G HetNets

“…Several recent studies have been investigated about user association based on rate while improving QoS [21][22][23][24][25][26]. In [21], a novel scheme for joint user association and channel allocation has been developed to achieve the objective of ultra-low latency.…”

“…Several recent studies have been investigated about user association based on rate while improving QoS [21][22][23][24][25][26]. In [21], a novel scheme for joint user association and channel allocation has been developed to achieve the objective of ultra-low latency. The scheme under consideration takes into account the impact of multiple-access interference and ensures a certain level of delay probability.…”

Untitled

“…Thus, the channel assignment problem is concerned with allocating channels to base stations in such a way that each base station is assigned a predetermined number of channels in order to minimize adjacent channel interference [4][5][6]. Because there is no simple efficient solution to this optimization problem, many channel allocation strategies have been proposed in the literature [7][8][9][10][11][12].…”