Coordinated scheduling for the downlink of cloud radio-access networks

Handle URI:
http://hdl.handle.net/10754/621245
Title:
Coordinated scheduling for the downlink of cloud radio-access networks
Authors:
Douik, Ahmed S. ( 0000-0001-7791-9443 ) ; Dahrouj, Hayssam ( 0000-0002-3075-321X ) ; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Abstract:
This paper addresses the coordinated scheduling 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 and the synchronization of the transmit frames across the connected base-stations (BS). The transmitted frame of every BS consists of several time/frequency blocks, called power-zones (PZ), maintained at fixed transmit power. The paper considers the problem of scheduling users to PZs and BSs in a coordinated fashion across the network, by maximizing a network-wide utility under the practical constraint 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 scheduling graph in which each vertex represents an association of users, PZs and BSs. The problem is formulated as a maximum weight clique, in which the weight of each vertex is the benefit of the association represented by that vertex. The paper further presents heuristic algorithms with low computational complexity. Simulation results show the performance of the proposed algorithms and suggest that the heuristics perform near optimal in low shadowing environments. © 2015 IEEE.
KAUST Department:
King Abdullah University of Science and Technology (KAUST), Saudi Arabia
Citation:
Douik A, Dahrouj H, Al-Naffouri TY, Alouini M-S (2015) Coordinated scheduling for the downlink of cloud radio-access networks. 2015 IEEE International Conference on Communications (ICC). Available: http://dx.doi.org/10.1109/ICC.2015.7248768.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2015 IEEE International Conference on Communications (ICC)
Conference/Event name:
IEEE International Conference on Communications, ICC 2015
Issue Date:
11-Sep-2015
DOI:
10.1109/ICC.2015.7248768
Type:
Conference Paper
Appears in Collections:
Conference Papers

Full metadata record

DC FieldValue Language
dc.contributor.authorDouik, Ahmed S.en
dc.contributor.authorDahrouj, Hayssamen
dc.contributor.authorAl-Naffouri, Tareq Y.en
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2016-11-03T06:56:18Z-
dc.date.available2016-11-03T06:56:18Z-
dc.date.issued2015-09-11en
dc.identifier.citationDouik A, Dahrouj H, Al-Naffouri TY, Alouini M-S (2015) Coordinated scheduling for the downlink of cloud radio-access networks. 2015 IEEE International Conference on Communications (ICC). Available: http://dx.doi.org/10.1109/ICC.2015.7248768.en
dc.identifier.doi10.1109/ICC.2015.7248768en
dc.identifier.urihttp://hdl.handle.net/10754/621245-
dc.description.abstractThis paper addresses the coordinated scheduling 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 and the synchronization of the transmit frames across the connected base-stations (BS). The transmitted frame of every BS consists of several time/frequency blocks, called power-zones (PZ), maintained at fixed transmit power. The paper considers the problem of scheduling users to PZs and BSs in a coordinated fashion across the network, by maximizing a network-wide utility under the practical constraint 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 scheduling graph in which each vertex represents an association of users, PZs and BSs. The problem is formulated as a maximum weight clique, in which the weight of each vertex is the benefit of the association represented by that vertex. The paper further presents heuristic algorithms with low computational complexity. Simulation results show the performance of the proposed algorithms and suggest that the heuristics perform near optimal in low shadowing environments. © 2015 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectCoordinated schedulingen
dc.subjectmaximum weight clique problemen
dc.subjectoptimal and near optimal schedulingen
dc.titleCoordinated scheduling for the downlink of cloud radio-access networksen
dc.typeConference Paperen
dc.contributor.departmentKing Abdullah University of Science and Technology (KAUST), Saudi Arabiaen
dc.identifier.journal2015 IEEE International Conference on Communications (ICC)en
dc.conference.date8 June 2015 through 12 June 2015en
dc.conference.nameIEEE International Conference on Communications, ICC 2015en
dc.contributor.institutionKing Fahd University of Petroleum and Minerals (KFUPM), Saudi Arabiaen
kaust.authorDouik, Ahmed S.en
kaust.authorDahrouj, Hayssamen
kaust.authorAl-Naffouri, Tareq Y.en
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.