Show simple item record

dc.contributor.authorDouik, Ahmed S.
dc.contributor.authorDahrouj, Hayssam
dc.contributor.authorAl-Naffouri, Tareq Y.
dc.contributor.authorAlouini, Mohamed-Slim
dc.date.accessioned2017-07-19T10:45:01Z
dc.date.available2017-07-19T10:45:01Z
dc.date.issued2017-07-17
dc.identifier.citationDouik A, Dahrouj H, Al-Naffouri TY, Alouini M-S (2017) Low-Complexity Scheduling and Power Adaptation for Coordinated Cloud-Radio Access Networks. IEEE Communications Letters: 1–1. Available: http://dx.doi.org/10.1109/LCOMM.2017.2728009.
dc.identifier.issn1089-7798
dc.identifier.doi10.1109/LCOMM.2017.2728009
dc.identifier.urihttp://hdl.handle.net/10754/625223
dc.description.abstractIn practical wireless systems, the successful implementation of resource allocation techniques strongly depends on the algorithmic complexity. Consider a cloud-radio access network (CRAN), where the central cloud is responsible for scheduling devices to the frames’ radio resources blocks (RRBs) of the single-antenna base-stations (BSs), adjusting the transmit power levels, and for synchronizing the transmit frames across the connected BSs. Previous studies show that the jointly coordinated scheduling and power control problem in the considered CRAN can be solved using an approach that scales exponentially with the number of BSs, devices, and RRBs, which makes the practical implementation infeasible for reasonably sized networks. This paper instead proposes a low-complexity solution to the problem, under the constraints that each device cannot be served by more than one BS but can be served by multiple RRBs within each BS frame, and under the practical assumption that the channel is constant during the duration of each frame. The paper utilizes graph-theoretical based techniques and shows that constructing a single power control graph is sufficient to obtain the optimal solution with a complexity that is independent of the number of RRBs. Simulation results reveal the optimality of the proposed solution for slow-varying channels, and show that the solution performs near-optimal for highly correlated channels.
dc.description.sponsorshipHayssam Dahrouj would like to thank Effat University in Jeddah, Saudi Arabia, for funding the research reported in this paper through the Research and Consultancy Institute
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttp://ieeexplore.ieee.org/document/7982775/
dc.rights(c) 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
dc.subjectJoint scheduling and power adaptation
dc.subjectslowvarying channels
dc.subjectcomplexity reduction
dc.titleLow-Complexity Scheduling and Power Adaptation for Coordinated Cloud-Radio Access Networks
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentElectrical Engineering Program
dc.identifier.journalIEEE Communications Letters
dc.eprint.versionPost-print
dc.contributor.institutionDepartment of Electrical Engineering, California Institute of Technology, Pasadena, CA 91125 USA
dc.contributor.institutionDepartment of Electrical and Computer Engineering, Effat University, Jeddah 22332, Saudi Arabia
kaust.personAl-Naffouri, Tareq Y.
kaust.personAlouini, Mohamed-Slim
refterms.dateFOA2018-06-14T02:29:03Z
dc.date.published-online2017-07-17
dc.date.published-print2017-10


Files in this item

Thumbnail
Name:
07982775.pdf
Size:
305.0Kb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record