Abstract
This paper addresses the joint coordinated scheduling and power control problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where the cloud is only responsible for the scheduling policy, power control, and synchronization of the transmit frames across the single-antenna base-stations (BS). The transmit frame consists of several time/frequency blocks, called power-zones (PZs). The paper considers the problem of scheduling users to PZs and determining their power levels (PLs), by maximizing the weighted sum-rate under the practical constraints that each user cannot be served by more than one base-station, but can be served by one or more power-zones within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the joint scheduling and power control graph formed by several clusters, where each is formed by a set of vertices, representing the possible association of users, BSs, and PLs for one specific PZ. The problem is, then, formulated as a maximum-weight clique problem, in which the weight of each vertex is the sum of the benefits of the individual associations belonging to that vertex. Simulation results suggest that the proposed cross-layer scheme provides appreciable performance improvement as compared to schemes from recent literature.
| Original language | English |
|---|---|
| Article number | 7342981 |
| Pages (from-to) | 2523-2536 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Wireless Communications |
| Volume | 15 |
| Issue number | 4 |
| DOIs | |
| State | Published - Apr 2016 |
Bibliographical note
Publisher Copyright:© 2015 IEEE.
Keywords
- Coordinated scheduling
- joint scheduling and power control graph
- maximum-weight clique
- power control
ASJC Scopus subject areas
- Computer Science Applications
- Electrical and Electronic Engineering
- Applied Mathematics