Chance Constrained Robust Downlink Beamforming in Multicell Networks

We introduce a downlink robust optimization approach that minimizes a combination of total transmit power by a multiple antenna base station (BS) within a cell and the resulting aggregate inter-cell interference (ICI) power on the users of the other cells. This optimization is constrained to assure that a set of signal-to-interference-plus-noise ratio (SINR) targets are met at user terminals with certain outage probabilities. The outages are due to the uncertainties that naturally emerge in the estimation of channel covariance matrices between a BS and its intra-cell local users as well as the other users of the other cells. We model these uncertainties using random matrices, analyze their statistical behaviour and formulate a tractable probabilistic approach to the design of optimal robust downlink beamforming vectors. The proposed approach reformulates the original intractable non-convex problem in a semidefinite programming (SDP) form with linear matrix inequality (LMI) constraints. The resulting SDP formulation is convex and numerically tractable under the standard rank relaxation. We compare the proposed chance-constrained approach against two different robust design schemes as well as the worst-case robustness. The simulation results confirm better power efficiency and higher resilience against channel uncertainties of the proposed approach in realistic scenarios

Chance constrained robust downlink beamforming in multicell networks

We introduce a downlink robust optimization approach that minimizes a combination of total transmit power by a multiple antenna base station (BS) within a cell and the resulting aggregate inter-cell interference (ICI) power on the users of the other cells. This optimization is constrained to assure that a set of signal-to-interference-plus-noise ratio (SINR) targets are met at user terminals with certain outage probabilities. The outages are due to the uncertainties that naturally emerge in the estimation of channel covariance matrices between a BS and its intra-cell local users as well as the other users of the other cells. We model these uncertainties using random matrices, analyze their statistical behaviour and formulate a tractable probabilistic approach to the design of optimal robust downlink beamforming vectors. The proposed approach reformulates the original intractable non-convex problem in a semidefinite programming (SDP) form with linear matrix inequality (LMI) constraints. The resulting SDP formulation is convex and numerically tractable under the standard rank relaxation. We compare the proposed chance-constrained approach against two different robust design schemes as well as the worst-case robustness. The simulation results confirm better power efficiency and higher resilience against channel uncertainties of the proposed approach in realistic scenarios

Beamforming Techniques for Non-Orthogonal Multiple Access in 5G Cellular Networks

In this paper, we develop various beamforming techniques for downlink transmission for multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) systems. First, a beamforming approach with perfect channel state information (CSI) is investigated to provide the required quality of service (QoS) for all users. Taylor series approximation and semidefinite relaxation (SDR) techniques are employed to reformulate the original non-convex power minimization problem to a tractable one. Further, a fairness-based beamforming approach is proposed through a max-min formulation to maintain fairness between users. Next, we consider a robust scheme by incorporating channel uncertainties, where the transmit power is minimized while satisfying the outage probability requirement at each user. Through exploiting the SDR approach, the original non-convex problem is reformulated in a linear matrix inequality (LMI) form to obtain the optimal solution. Numerical results demonstrate that the robust scheme can achieve better performance compared to the non-robust scheme in terms of the rate satisfaction ratio. Further, simulation results confirm that NOMA consumes a little over half transmit power needed by OMA for the same data rate requirements. Hence, NOMA has the potential to significantly improve the system performance in terms of transmit power consumption in future 5G networks and beyond.Comment: accepted to publish in IEEE Transactions on Vehicular Technolog

Distributed Robust Multi-Cell Coordinated Beamforming with Imperfect CSI: An ADMM Approach

Multi-cell coordinated beamforming (MCBF), where multiple base stations (BSs) collaborate with each other in the beamforming design for mitigating the inter-cell interference, has been a subject drawing great attention recently. Most MCBF designs assume perfect channel state information (CSI) of mobile stations (MSs); however CSI errors are inevitable at the BSs in practice. Assuming elliptically bounded CSI errors, this paper studies the robust MCBF design problem that minimizes the weighted sum power of BSs subject to worst-case signal-to-interference-plus-noise ratio (SINR) constraints on the MSs. Our goal is to devise a distributed optimization method that can obtain the worst-case robust beamforming solutions in a decentralized fashion, with only local CSI used at each BS and little backhaul signaling for message exchange between BSs. However, the considered problem is difficult to handle even in the centralized form. We first propose an efficient approximation method in the centralized form, based on the semidefinite relaxation (SDR) technique. To obtain the robust beamforming solution in a decentralized fashion, we further propose a distributed robust MCBF algorithm, using a distributed convex optimization technique known as alternating direction method of multipliers (ADMM). We analytically show the convergence of the proposed distributed robust MCBF algorithm to the optimal centralized solution and its better bandwidth efficiency in backhaul signaling over the existing dual decomposition based algorithms. Simulation results are presented to examine the effectiveness of the proposed SDR method and the distributed robust MCBF algorithm

Sample Approximation-Based Deflation Approaches for Chance SINR Constrained Joint Power and Admission Control

Consider the joint power and admission control (JPAC) problem for a multi-user single-input single-output (SISO) interference channel. Most existing works on JPAC assume the perfect instantaneous channel state information (CSI). In this paper, we consider the JPAC problem with the imperfect CSI, that is, we assume that only the channel distribution information (CDI) is available. We formulate the JPAC problem into a chance (probabilistic) constrained program, where each link's SINR outage probability is enforced to be less than or equal to a specified tolerance. To circumvent the computational difficulty of the chance SINR constraints, we propose to use the sample (scenario) approximation scheme to convert them into finitely many simple linear constraints. Furthermore, we reformulate the sample approximation of the chance SINR constrained JPAC problem as a composite group sparse minimization problem and then approximate it by a second-order cone program (SOCP). The solution of the SOCP approximation can be used to check the simultaneous supportability of all links in the network and to guide an iterative link removal procedure (the deflation approach). We exploit the special structure of the SOCP approximation and custom-design an efficient algorithm for solving it. Finally, we illustrate the effectiveness and efficiency of the proposed sample approximation-based deflation approaches by simulations.Comment: The paper has been accepted for publication in IEEE Transactions on Wireless Communication

Mathematical optimization and game theoretic techniques for multicell beamforming

The main challenge in mobile wireless communications is the incompatibility between limited wireless resources and increasing demand on wireless services. The employment of frequency reuse technique has effectively increased the capacity of the network and improved the efficiency of frequency utilization. However, with the emergence of smart phones and even more data hungry applications such as interactive multimedia, higher data rate is demanded by mobile users. On the other hand, the interference induced by spectrum sharing arrangement has severely degraded the quality of service for users and restricted further reduction of cell size and enhancement of frequency reuse factor. Beamforming technique has great potential to improve the network performance. With the employment of multiple antennas, a base station is capable of directionally transmitting signals to desired users through narrow beams rather than omnidirectional waves. This will result users suffer less interference from the signals transmitted to other co-channel users. In addition, with the combination of beamforming technique and appropriate power control schemes, the resources of the wireless networks can be used more efficiently. In this thesis, mathematical optimization and game theoretic techniques have been exploited for beamforming designs within the context of multicell wireless networks. Both the coordinated beamforming and the coalitional game theoretic based beamforming techniques have been proposed. Initially, coordinated multicell beamforming algorithms for mixed design criteria have been developed, in which some users are allowed to achieve target signal-to-interference- plus-noise ratios (SINRs) while the SINRs of rest of the users in all cells will be balanced to a maximum achievable SINR. An SINR balancing based coordinated multicell beamforming algorithm has then been proposed which is capable of balancing users in different cells to different SINR levels. Finally, a coalitional game based multicell beamforming has been considered, in which the proposed coalition formation algorithm can reach to stable coalition structures. The performances of all the proposed algorithms have been demonstrated using MATLAB based simulations