Low-Complexity Power Allocation for Network-Coded User Scheduling in Fog-RANs

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 coordinat...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2021-04, Vol.25 (4), p.1318-1322
Main Authors: Al-Abiad, Mohammed S., Hassan, Md. Zoheb, Douik, Ahmed, Hossain, Md. Jahangir
Format: Article
Language:English
Subjects:
Cloud computing
Complexity
Computational complexity
Coordinated scheduling
file streaming
fog radio access networks
Graph theory
Network coding
Optimization
power allocation
Power control
Radio equipment
Resource management
Schedules
Scheduling
Throughput
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2020.3042586