Now showing 1 - 10 of 10
  • Publication
    Energy Efficiency Maximization for C-RANs: Discrete Monotonic Optimization, Penalty, and ℓ0-Approximation Methods
    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.
      222Scopus© Citations 17
  • Publication
    Energy Efficiency Fairness for Multi-Pair Wireless-Powered Relaying Systems
    We consider a multi-pair amplify-and-forward relay network where the energy-constrained relays adopting the time-switching protocol harvest energy from the radio-frequency signals transmitted by the users for assisting user data transmission. Both one-way and two-way relaying techniques are investigated. Aiming at energy efficiency (EE) fairness among the user pairs, we construct an energy consumption model incorporating rate-dependent signal processing power, the dependence on output power level of power amplifiers’ efficiency, and nonlinear energy harvesting (EH) circuits. Then, we formulate the max-min EE fairness problems in which the data rates, users’ transmit power, relays’ processing coefficient, and EH time are jointly optimized under the constraints on the quality of service and users’ maximum transmit power. To achieve efficient suboptimal solutions to these nonconvex problems, we devise monotonic descent algorithms based on the inner approximation (IA) framework, which solve a second-order-cone program in each iteration. To further simplify the designs, we propose an approach combining IA and zero-forcing beamforming, which eliminates inter-pair interference and reduces the numbers of variables and required iterations. Finally, extensive numerical results are presented to validate the proposed approaches. More specifically, the results demonstrate that ignoring the realistic aspects of power consumption might degrade the performance remarkably, and jointly designing parameters involved could significantly enhance the EE.
      305Scopus© Citations 26
  • Publication
    Efficient Algorithms for Sum Rate Maximization in Fronthaul-Constrained C-RANs
    We consider downlink transmission of a fronthaul-constrained cloud radio access network. Our aim is to maximize the system sum data rate via jointly designing beamforming and user association. The problem is basically a mixed integer non-convex programs for which a global solution requires a prohibitively high computational effort. The focus is thus on efficient solutions capable of achieving the near optimal performance with low complexity. To this end, we transform the design problem into continuous programs by two approaches: penalty and sparse approximation methods. The resulting continuous nonconvex problems are then solved by the successive convex approximation framework. Numerical results indicate that the proposed methods are near-optimal, and outperform existing suboptimal methods in terms of achieved performances and computational complexity.
      137
  • Publication
    Globally Optimal Energy Efficiency Maximization for Capacity-Limited Fronthaul Crans with Dynamic Power Amplifiers’ Efficiency
    A joint beamforming and remote radio head (RRH)-user association design for downlink of cloud radio access networks (CRANs) is considered. The aim is to maximize the system energy efficiency subject to constraints on users' quality-of-service, capacity offronthaullinks and transmit power. Different to the conventional power consumption models, we embrace the dependence of baseband signal processing power on the data rate, and the dynamics of the power amplifiers' efficiency. The considered problem is a mixed Boolean nonconvex program whose optimal solution is difficult to find. As our main contribution, we provide a discrete branch-reduce-and-bound (DBRnB) approach to solve the problem globally. We also make some modifications to the standard DBRnB procedure. Those remarkably improve the convergence performance. Numerical results are provided to confirm the validity of the proposed method.
      319
  • Publication
    On Spectral Efficiency for Multiuser MISO Systems Under Imperfect Channel Information
    We consider downlink transmission whereby a multiantenna base station simultaneously transmits data to multiple single-antenna users. We focus on slow flat fading channel where the channel state information is imperfect, the channel estimation error is unbounded and its statistics are known. The aim is to design beamforming vectors such that the sum rate is maximized under the constraints on probability of successful transmission for each user and maximum transmit power. The optimization problem is intractable due to the chance constraints. To this end, we propose an efficient solution drawn upon stochastic optimization. In particular, we first use the step function and its smooth approximation to get an approximate nonconvex stochastic program of the considered problem. We then develop an iterative procedure to solve the stochastic program based on the stochastic successive convex approximation framework. The numerical results show that the proposed solution can achieve remarkable sum rate gains compared to the conventional one.
      166Scopus© Citations 1
  • Publication
    A Low-Complexity Algorithm for Achieving Secrecy Capacity in MIMO Wiretap Channels
    We consider a secure transmission including a transmitter, a receiver and an eavesdropper, each being equipped with multiple antennas. The aim is to develop a low-complexity and scalable method to find a globally optimal solution to the problem of secrecy rate maximization under a total power constraint at the transmitter. In principle, the original formulation of the problem is nonconvex. However, it can be equivalently translated into finding a saddle point of a minimax convex-concave program. An existing approach finds the saddle point using the Newton method, whose computational cost increases quickly with the number of transmit antennas, making it unsuitable for large scale antenna systems. To this end, we propose an iterative algorithm based on alternating optimization, which is guaranteed to converge to a saddle point, and thus achieves a globally optimal solution to the considered problem. In particular, each subproblem of the proposed iterative method admits a closed-form solution. We analytically show that the iteration cost of our proposed method is much cheaper than that of the known solution. As a result, numerical results demonstrate that the proposed method remarkably outperforms the existing one in terms of the overall run time.
      145Scopus© Citations 5
  • Publication
    Energy-Efficient Resource Allocation for OFDMA Heterogeneous Networks
    We proposed several energy-efficient resource allocation algorithms for the downlink of an orthogonal frequency-division-multiple-access (OFDMA) based femtocell heterogeneous networks (HetNets). Heterogeneous QoS and fairness in rate are investigated in the proposed resource allocation problem. A dense deployment of femtocells in the coverage area of a central macrocell is considered and energy usage of both femtocell and macrocell users are optimized simultaneously. We aim to maximize the weighted sum of the individual energy efficiencies (WSEEMax) and the network energy efficiency (NEEMax) while satisfying the following: (1) minimum throughput for delay-sensitive (DS) users, (2) fairness constraint for delay-tolerant (DT) users, (3) required constraints of OFDMA systems. The problem is formulated in three different forms: mixed 0-1 integer programming formulation, time-sharing formulation and sparsity-inducing formulation. The proposed resource block (RB) and power optimization problems are combinatorial and highly non-convex due to the fractional form of the objective function, the integer constraint of OFDMA RBs and non-affine fairness. We adopt the successive convex approximation (SCA) approach and transform the problems into a sequence of convex subproblems. With the proposed algorithms, we show that the overall joint RB and power allocation schemes converge to suboptimal solutions. Numerical examples confirm the merits of the proposed algorithms.
      258Scopus© Citations 39
  • Publication
    Noncoherent Joint Transmission Beamforming for Dense Small Cell Networks: Global Optimality, Efficient Solution and Distributed Implementation
    We investigate the coordinated multi-point noncoherent joint transmission (JT) in dense small cell networks. The goal is to design beamforming vectors for macro cell and small cell base stations (BSs) such that the weighted sum rate of the system is maximized, subject to a total transmit power at individual BSs. The optimization problem is inherently nonconvex and intractable, making it difficult to explore the full potential performance of the scheme. To this end, we first propose an algorithm to find a globally optimal solution based on the generic monotonic branch reduce and bound optimization framework. Then, for a more computationally efficient method, we adopt the inner approximation (InAp) technique to efficiently derive a locally optimal solution, which is numerically shown to achieve near-optimal performance. In addition, for decentralized networks such as those comprising of multi-access edge computing servers, we develop an algorithm based on the alternating direction method of multipliers, which distributively implements the InAp-based solution. Our main conclusion is that the noncoherent JT is a promising transmission scheme for dense small cell networks, since it can exploit the densitification gain, outperforms the coordinated beamforming, and is amenable to distributed implementation.
      161Scopus© Citations 7
  • Publication
    Energy-Efficient Bit Allocation for Resolution-Adaptive ADC in Multiuser Large-Scale MIMO Systems: Global Optimality
    We consider uplink multiuser wireless communications systems, where the base station (BS) receiver is equipped with a large-scale antenna array and resolution adaptive analog-to-digital converters (ADCs). The aim is to maximize the energy efficiency (EE) at the BS subject to constraints on the users' quality-of-service. The approach is to jointly optimize both the number of quantization bits at the ADCs and the on/off modes of the radio frequency (RF) processing chains. The considered problem is a discrete nonlinear program, the optimal solution of which is difficult to find. We develop an efficient algorithm based on the discrete branch-reduce-and-bound (DBRnB) framework. It finds the globally optimal solutions to the problem. In particular, we make some modifications, which significantly improve the convergence performance. The numerical results demonstrate that optimizing jointly the number of quantization bits and on/off mode can achieve remarkable EE gains compared to only optimizing the number of quantization bits.
      174Scopus© Citations 2
  • Publication
    Energy Efficiency Optimization for Dense Networks
    Dense networks open opportunities to optimize the network performance particularly from an energy efficiency perspective, since the total power consumption is a great concern as the number of devices is very large. The goal of this chapter is to provide a set of optimization tools applied in designing energy efficiency transmission for dense networks. Specifically, this chapter includes two parts. The first part introduces optimization techniques that are useful for energy efficiency optimization including concave-convex fractional programming, nontractable fractional programming, the alternating direction method of multipliers for distributed implementation. The second part is to demonstrate how these methods can be applied to dense networks with shared spectrum and small-cell dense networks being the case studies.
      190Scopus© Citations 1