TY - JOUR

T1 - Distributed linear precoder optimization and base station selection for an uplink heterogeneous network

AU - Hong, Mingyi

AU - Luo, Zhi-Quan

PY - 2013/6/3

Y1 - 2013/6/3

N2 - In a heterogeneous wireless cellular network, each user may be covered by multiple access points such as macro/pico/relay/femto base stations (BS). An effective approach to maximize the sum utility (e.g., system throughput) in such a network is to jointly optimize users' linear procoders as well as their BS associations. In this paper, we first show that this joint optimization problem is NP-hard and thus is difficult to solve to global optimality. To find a locally optimal solution, we formulate the problem as a noncooperative game in which the users and the BSs both act as players. We introduce a set of new utility functions for the players and show that every Nash equilibrium (NE) of the resulting game is a stationary solution of the original sum utility maximization problem. Moreover, we develop a best-response type algorithm that allows the players to distributedly reach a NE of the game. Simulation results show that the proposed distributed algorithm can effectively relieve local BS congestion and simultaneously achieve high throughput and load balancing in a heterogeneous network.

AB - In a heterogeneous wireless cellular network, each user may be covered by multiple access points such as macro/pico/relay/femto base stations (BS). An effective approach to maximize the sum utility (e.g., system throughput) in such a network is to jointly optimize users' linear procoders as well as their BS associations. In this paper, we first show that this joint optimization problem is NP-hard and thus is difficult to solve to global optimality. To find a locally optimal solution, we formulate the problem as a noncooperative game in which the users and the BSs both act as players. We introduce a set of new utility functions for the players and show that every Nash equilibrium (NE) of the resulting game is a stationary solution of the original sum utility maximization problem. Moreover, we develop a best-response type algorithm that allows the players to distributedly reach a NE of the game. Simulation results show that the proposed distributed algorithm can effectively relieve local BS congestion and simultaneously achieve high throughput and load balancing in a heterogeneous network.

KW - Base station selection

KW - Nash equilibrium

KW - heterogeneous networks

KW - noncooperative gams

KW - precoder optimization

UR - http://www.scopus.com/inward/record.url?scp=84878310316&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878310316&partnerID=8YFLogxK

U2 - 10.1109/TSP.2013.2252169

DO - 10.1109/TSP.2013.2252169

M3 - Article

AN - SCOPUS:84878310316

VL - 61

SP - 3214

EP - 3228

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 12

M1 - 6477158

ER -