261 research outputs found
A Practical Cooperative Multicell MIMO-OFDMA Network Based on Rank Coordination
An important challenge of wireless networks is to boost the cell edge
performance and enable multi-stream transmissions to cell edge users.
Interference mitigation techniques relying on multiple antennas and
coordination among cells are nowadays heavily studied in the literature.
Typical strategies in OFDMA networks include coordinated scheduling,
beamforming and power control. In this paper, we propose a novel and practical
type of coordination for OFDMA downlink networks relying on multiple antennas
at the transmitter and the receiver. The transmission ranks, i.e.\ the number
of transmitted streams, and the user scheduling in all cells are jointly
optimized in order to maximize a network utility function accounting for
fairness among users. A distributed coordinated scheduler motivated by an
interference pricing mechanism and relying on a master-slave architecture is
introduced. The proposed scheme is operated based on the user report of a
recommended rank for the interfering cells accounting for the receiver
interference suppression capability. It incurs a very low feedback and backhaul
overhead and enables efficient link adaptation. It is moreover robust to
channel measurement errors and applicable to both open-loop and closed-loop
MIMO operations. A 20% cell edge performance gain over uncoordinated LTE-A
system is shown through system level simulations.Comment: IEEE Transactions or Wireless Communications, Accepted for
Publicatio
Interference pricing mechanism for downlink multicell coordinated beamforming
We consider the downlink coordinated beamforming problem in a cellular network in which the base stations (BSs) are equipped with multiple antennas and each user is equipped with a single antenna. The BSs cooperate in sharing their local interference information, and they aim to maximize the sum-rate of the users in the network. A decentralized interference pricing beamforming (IPBF) algorithm is proposed to identify the coordinated beamformer, where a BS is penalized according to the interference it creates to its peers. We show that the decentralized pricing mechanism converges to an interference equilibrium, which is a KKT point of the sum-rate maximization problem. The proofs rely on the identification of rank-1 solutions of each BSs' interference-penalized rate maximization problem. Numerical results show that the proposed iterative mechanism reduces significantly the exchanged information with respect to other state-of-the-art beamforming algorithms with very little sum-rate loss. The version of the algorithm that limits the coordination to a cluster of base stations (IPBF-L) is shown to have very small sum-rate loss with respect to the full coordinated algorithm with much less backhaul information exchange.The work was partially supported by NSF grant CCF-1017982 and SICCNALS project (TEC2011-28219). The work of A. GarcĂa was partially supported by NSF grant CCF-1017982. A. GarcĂa-Armada’s work has been partially funded by research projects COMONSENS (CSD2008-00010) and GRE3N (TEC2011-29006-C03-02)Publicad
- …