Low-Complexity Power Allocation for Network-Coded User Scheduling in Fog-RANs
Abstract
Consider a Fog Radio Access Network (FRAN) in which a cloud base station (CBS) is responsible for scheduling user-equipments (UEs) to a set of radio resource blocks (RRBs) of Fog Access Points (F-APs) and for allocating power to the RRBs. The conventional graphical approach for solving the coordinated scheduling and power control problem in FRAN requires prohibitive computational complexity. This letter, instead, proposes a low-complexity solution to the problem under the constraint that all the scheduled UEs can decode the requested files sent by their associated RRBs/F-APs. Unlike previous solution that requires constructing the total power control graph, the proposed computationally efficient solution is developed using a single power control subgraph. Numerical results reveal a close-to-optimal performance of the proposed method in terms of throughput maximization for correlated channels with a significant reduction in the computational complexity.
Additional Information
© 2020 IEEE. Manuscript received September 21, 2020; revised October 23, 2020 and November 29, 2020; accepted December 1, 2020. Date of publication December 4, 2020; date of current version April 9, 2021. This work was supported by the Natural Science of Engineering Research Council, Canada. The associate editor coordinating the review of this letter and approving it for publication was M. Kaneko.Additional details
- Eprint ID
- 107096
- Resolver ID
- CaltechAUTHORS:20201215-141037233
- Natural Sciences and Engineering Research Council of Canada (NSERC)
- Created
-
2020-12-16Created from EPrint's datestamp field
- Updated
-
2021-04-13Created from EPrint's last_modified field