Joint downlink base station association and power control for max-min fairness: Computation and complexity

Ruoyu Sun, Mingyi Hong, Zhi Quan Luo

Research output: Contribution to journalArticlepeer-review

Abstract

In a heterogeneous network (HetNet) with a large number of low power base stations (BSs), proper user-BS association and power control is crucial to achieving desirable system performance. In this paper, we systematically study the joint BS association and power allocation problem for a downlink cellular network under the max-min fairness criterion. First, we show that this problem is NP-hard. Second, we show that the upper bound of the optimal value can be easily computed, and propose a two-stage algorithm to find a high-quality suboptimal solution. Simulation results show that the proposed algorithm is near-optimal in the high-SNR regime. Third, we show that the problem under some additional mild assumptions can be solved to global optima in polynomial time by a semi-distributed algorithm. This result is based on a transformation of the original problem to an assignment problem with gains log(gij), where {gij} are the channel gains.

Original languageEnglish (US)
Pages (from-to)1040-1054
Number of pages15
JournalIEEE Journal on Selected Areas in Communications
Volume33
Issue number6
DOIs
StatePublished - Jun 1 2015
Externally publishedYes

Keywords

  • Base station association
  • Distributed algorithm
  • Downlink interference channel
  • Polynomial time solvable
  • Power control

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Joint downlink base station association and power control for max-min fairness: Computation and complexity'. Together they form a unique fingerprint.

Cite this