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. Energy Efficiency Maximization for C-RANs: Discrete Monotonic Optimization, Penalty, and ℓ0-Approximation Methods
 
  • Details
Options

Energy Efficiency Maximization for C-RANs: Discrete Monotonic Optimization, Penalty, and ℓ0-Approximation Methods

Author(s)
Nguyen, Kien-Giang  
Vu, Quang-Doanh  
Juntti, Markku  
Tran, Le-Nam  
Uri
http://hdl.handle.net/10197/10540
Date Issued
2018-06-25
Date Available
2019-05-20T12:48:21Z
Abstract
We study downlink of multiantenna cloud radio access networks with finite-capacity fronthaul links. The aim is to propose joint designs of beamforming and remote radio head (RRH)-user association, subject to constraints on users' quality-of-service, limited capacity of fronthaul links and transmit power, to maximize the system energy efficiency. To cope with the limited-capacity fronthaul we consider the problem of RRH-user association to select a subset of users that can be served by each RRH. Moreover, different to the conventional power consumption models, we take into account the dependence of the baseband signal processing power on the data rate, as well as the dynamics of the efficiency of power amplifiers. The considered problem leads to a mixed binary integer program which is difficult to solve. Our first contribution is to derive a globally optimal solution for the considered problem by customizing a discrete branch-reduce-and-bound approach. Since the global optimization method requires a high computational effort, we further propose two suboptimal solutions able to achieve the near optimal performance but with much reduced complexity. To this end, we transform the design problem into continuous (but inherently nonconvex) programs by two approaches: penalty and l 0 -approximation methods. These resulting continuous nonconvex problems are then solved by the successive convex approximation framework. Numerical results are provided to evaluate the effectiveness of the proposed approaches.
Sponsorship
Science Foundation Ireland
Other Sponsorship
Academy of Finland
Type of Material
Journal Article
Publisher
IEEE
Journal
IEEE Transactions on Signal Processing
Volume
66
Issue
17
Start Page
4435
End Page
4449
Copyright (Published Version)
2018 IEEE
Subjects

Energy efficiency

Cloud radio access ne...

Limited fronthaul cap...

Rate-dependent signal...

Nonlinear power ampli...

Beamforming

Mixed binary integer ...

Discrete branch-reduc...

Successive convex app...

DOI
10.1109/tsp.2018.2849746
Language
English
Status of Item
Peer reviewed
Conference Details
Also presented at: 2018 IEEE International Conference on Acoustics, Speech and Signal Processing
(ICASSP 2018), Alberta, Canada, April 15-20 2018
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

Giang_TSP_Final_manuscript.pdf

Size

381.65 KB

Format

Adobe PDF

Checksum (MD5)

a40bc0b4b1da07166f865b8d224a2ac8

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.

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

  • Cookie settings
  • Privacy policy
  • End User Agreement