Robust Power Allocation for Energy-Efficient Location-Aware Networks

In wireless location-aware networks, mobile nodes (agents) typically obtain their positions using the range measurements to the nodes with known positions. Transmit power allocation not only affects network lifetime and throughput, but also determines localization accuracy. In this paper, we present an optimization framework for robust power allocation in network localization with imperfect knowledge of network parameters. In particular, we formulate power allocation problems to minimize localization errors for a given power budget and show that such formulations can be solved via conic programming. Moreover, we design a distributed power allocation algorithm that allows parallel computation among agents. The simulation results show that the proposed schemes significantly outperform uniform power allocation, and the robust schemes outperform their non-robust counterparts when the network parameters are subject to uncertainty.National Natural Science Foundation (China) (Project 61201261)National Basic Research Program of China (973 Program) (61101131)University Grants Committee (Hong Kong, China) (GRF Grant Project 419509)National Science Foundation (U.S.) (Grant ECCS-0901034)United States. Office of Naval Research (Grant N00014-11-1-0397)Massachusetts Institute of Technology. Institute for Soldier Nanotechnologie

Two-Stage Subspace Constrained Precoding in Massive MIMO Cellular Systems

We propose a subspace constrained precoding scheme that exploits the spatial channel correlation structure in massive MIMO cellular systems to fully unleash the tremendous gain provided by massive antenna array with reduced channel state information (CSI) signaling overhead. The MIMO precoder at each base station (BS) is partitioned into an inner precoder and a Transmit (Tx) subspace control matrix. The inner precoder is adaptive to the local CSI at each BS for spatial multiplexing gain. The Tx subspace control is adaptive to the channel statistics for inter-cell interference mitigation and Quality of Service (QoS) optimization. Specifically, the Tx subspace control is formulated as a QoS optimization problem which involves an SINR chance constraint where the probability of each user's SINR not satisfying a service requirement must not exceed a given outage probability. Such chance constraint cannot be handled by the existing methods due to the two stage precoding structure. To tackle this, we propose a bi-convex approximation approach, which consists of three key ingredients: random matrix theory, chance constrained optimization and semidefinite relaxation. Then we propose an efficient algorithm to find the optimal solution of the resulting bi-convex approximation problem. Simulations show that the proposed design has significant gain over various baselines.Comment: 13 pages, accepted by IEEE Transactions on Wireless Communication