Academic Journal

Energy efficiency maximization for C-RANs:discrete monotonic optimization, penalty, and ℓ₀-approximation methods

التفاصيل البيبلوغرافية
العنوان: Energy efficiency maximization for C-RANs:discrete monotonic optimization, penalty, and ℓ₀-approximation methods
المؤلفون: Nguyen, K.-G. (Kien-Giang), Vu, Q.-D. (Quang-Doanh), Juntti, M. (Markku), Tran, L.-N. (Le-Nam)
بيانات النشر: Institute of Electrical and Electronics Engineers
سنة النشر: 2018
المجموعة: Jultika - University of Oulu repository / Oulun yliopiston julkaisuarkisto
مصطلحات موضوعية: Energy efficiency, beamforming, cloud radio access network, discrete branch-reduce-and-bound, limited fronthaul capacity, mixed binary integer program, nonlinear power amplifier, rate-dependent signal processing power, successive convex approximation
الوصف: 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 ℓ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.
نوع الوثيقة: article in journal/newspaper
وصف الملف: application/pdf
اللغة: English
الاتاحة: http://urn.fi/urn:nbn:fi-fe2018080233249
Rights: info:eu-repo/semantics/openAccess ; © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, 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 component of this work in other works.
رقم الانضمام: edsbas.C33F8EC3
قاعدة البيانات: BASE