Proportional fair scheduling (PFS) is a widely used scheduling algorithm in the wireless networks which utilizes the network resources efficiently while maintaining a balance with the fairness among the users. It is a channel aware scheduling algorithm that allocates resources to the users with the best channel conditions, it also takes into account the users with bad channel quality by considering the user's access history in the scheduling decision. In this paper, the authors propose a two-step multiple carrier proportional fair scheduling (MC-PF) algorithm for the cloud radio access networks (C-RAN). The main purpose of this algorithm is to maximize the sum of logarithm transmission rate. The scheduler assigns users to each carrier in order to maximize the logarithm transmission rate for overall links of C-RAN. To prove the effectiveness of the proposed algorithm, the authors have shown the simulation results and compared it with the round robin (RR) scheduling scheme.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.