Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks

Consider a downlink MIMO heterogeneous wireless network with multiple cells, each containing many mobile users and a number of base stations with varying capabilities. A central task in the management of such a network is to assign each user to a base station and design a linear transmit strategy to...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on signal processing Jg. 62; H. 8; S. 1950 - 1961
Hauptverfasser: Sanjabi, Maziar, Razaviyayn, Meisam, Zhi-Quan Luo
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 15.04.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:1053-587X, 1941-0476
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Consider a downlink MIMO heterogeneous wireless network with multiple cells, each containing many mobile users and a number of base stations with varying capabilities. A central task in the management of such a network is to assign each user to a base station and design a linear transmit strategy to ensure a satisfactory level of network performance. In this work, we propose a formulation for the joint base station assignment and linear transceiver design problem based on the maximization of a system wide utility. We first establish the NP-hardness of the resulting optimization problem for a large family of α-fairness utility functions. Then, we propose an efficient algorithm to approximately solve this problem for a variety of different utility functions. Our numerical experiments show that the proposed algorithm can achieve significantly higher levels of system throughput and user fairness than what is possible by optimizing the precoders alone.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2014.2303946