Repository logo
  • Log In
    New user? Click here to register.Have you forgotten your password?
University College Dublin
    Colleges & Schools
    Statistics
    All of DSpace
  • Log In
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. College of Engineering & Architecture
  3. School of Electrical and Electronic Engineering
  4. Electrical and Electronic Engineering Research Collection
  5. Optimal Joint Remote Radio Head Selection and Beamforming Design for Limited Fronthaul C-RAN
 
  • Details
Options

Optimal Joint Remote Radio Head Selection and Beamforming Design for Limited Fronthaul C-RAN

Author(s)
Luong, Phuong  
Gagnon, François  
Despins, Charles  
Tran, Le-Nam  
Uri
http://hdl.handle.net/10197/10325
Date Issued
2017-08-11
Date Available
2019-05-07T14:20:56Z
Abstract
This paper considers the downlink transmission of cloud-radio access networks (C-RANs) with limited fronthaul capacity. We formulate a joint design of remote radio head (RRH) selection, RRH-user association, and transmit beamforming for simultaneously optimizing the achievable sum rate and total power consumption, using the multiobjective optimization concept. Due to the nonconvexity of perfronthaul capacity constraints and introduced binary selection variables, the formulated problem lends itself to a mixed-integer nonconvex program, which is generally non-deterministic polynomial-time hard. Motivated by powerful computing capability of C-RAN and for benchmarking purposes, we propose a branch and reduce and bound-based algorithm to attain a globally optimal solution. For more practically appealing approaches, we then propose three iterative low-complexity algorithms. In the first method, we iteratively approximate the continuous nonconvex constraints by convex conic ones using successive convex approximation framework. More explicitly, the problem obtained at each iteration is a mixed-integer second-order cone program (MI-SOCP) for which dedicated solvers are available. In the second method, we first relax the binary variables to be continuous to arrive at a sequence of SOCPs and then perform a postprocessing procedure on the relaxed variables to search for a high-performance solution. In the third method, we solve the considered problem in view of sparsity-inducing regularization. Numerical results show that our proposed algorithms converge rapidly and achieve near-optimal performance as well as outperform the known algorithms.
Type of Material
Journal Article
Publisher
IEEE
Journal
IEEE Transactions on Signal Processing
Volume
65
Issue
21
Start Page
5605
End Page
5620
Copyright (Published Version)
2017 IEEE
Subjects

Base station selectio...

Beamforming

Cloud radio access ne...

Limited fronthaul

Mixed integer second ...

Optimization

DOI
10.1109/tsp.2017.2739102
Language
English
Status of Item
Peer reviewed
ISSN
1053-587X
This item is made available under a Creative Commons License
https://creativecommons.org/licenses/by-nc-nd/3.0/ie/
File(s)
Loading...
Thumbnail Image
Name

Phuong_TSP_CRAN_FINAL_VERSION.pdf

Size

3.39 MB

Format

Adobe PDF

Checksum (MD5)

2441b9f02bce2e072aad3d15596f41e9

Owning collection
Electrical and Electronic Engineering Research Collection

Item descriptive metadata is released under a CC-0 (public domain) license: https://creativecommons.org/public-domain/cc0/.
All other content is subject to copyright.

For all queries please contact research.repository@ucd.ie.

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement