Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
User Assignment in C-RAN Systems: Algorithms and Bounds
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems Engineering.ORCID iD: 0000-0002-9442-671X
KTH. Informat Technol Univ, Dept Elect Engn, Lahore 54000, Pakistan..
KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
Huawei Technol, S-16440 Kista, Sweden..
Show others and affiliations
2018 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 17, no 6, p. 3889-3902Article in journal (Refereed) Published
Abstract [en]

In this paper, we investigate the problem of mitigating interference between so-called antenna domains of a cloud radio access network (C-RAN). In contrast to previous work, we turn to an approach utilizing primarily the optimal assignment of users to central processors in a C-RAN deployment. We formulate this user assignment problem as an integer optimization problem and propose an iterative algorithm for obtaining a solution. Motivated by the lack of optimality guarantees on such solutions, we opt to find lower bounds on the problem and the resulting interference leakage in the network. We thus derive the corresponding Dantzig-Wolfe decomposition, formulate the dual problem, and show that the former offers a tighter bound than the latter. We highlight the fact that the bounds in question consist of linear problems with an exponential number of variables and adapt the column generation method for solving them. In addition to shedding light on the tightness of the bounds in question, our numerical results show significant sum-rate gains over several comparison schemes. Moreover, the proposed scheme delivers similar performance as weighted minimum mean squared-error (MMSE) with a significantly lower complexity (around 10 times less).

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2018. Vol. 17, no 6, p. 3889-3902
Keywords [en]
Cloud radio access networks, user assignment, interference coupling coefficients, block-coordinate descent, Dantzig-Wolfe decomposition
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-231722DOI: 10.1109/TWC.2018.2817223ISI: 000435196200028Scopus ID: 2-s2.0-85044848161OAI: oai:DiVA.org:kth-231722DiVA, id: diva2:1238814
Note

QC 20180814

Available from: 2018-08-14 Created: 2018-08-14 Last updated: 2019-08-20Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Ghauch, HadiImtiaz, SaharSkoglund, MikaelGross, James

Search in DiVA

By author/editor
Ghauch, HadiRahman, Muhammad Mahboob UrImtiaz, SaharSkoglund, MikaelGross, James
By organisation
Network and Systems EngineeringKTHInformation Science and Engineering
In the same journal
IEEE Transactions on Wireless Communications
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 78 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf