Coordinated user scheduling and power control for weighted sum throughput maximization of multicell network

Lu Liu; Daiming Qu; Tao Jiang; Jie Ding

doi:10.1109/GLOCOM.2010.5683705

Coordinated user scheduling and power control for weighted sum throughput maximization of multicell network

Lu Liu^*, Daiming Qu, Tao Jiang, Jie Ding

^*Corresponding author for this work

School of Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

6 Citations (Scopus)

Abstract

In this paper, we consider the weighted sum throughput maximization (WSTM) problem of multicell network with full spectral reuse. The WSTM problem is a nonconvex combinatorial problem, and difficult to tackle in practice. Thus, we present and discuss three low-complexity suboptimal algorithms, which solve the WSTM problem via joint user scheduling and power control (USPC) among a set of coordinating cells. Extensive system level simulations show that all the proposed algorithms have close weighted sum throughput (WST) performances to that of exhaustive search (ES). Furthermore, the proposed distributed iterative (DI) algorithm, which enjoys both distributed operation and fast convergence, is the most attractive one in practical systems.

Original language	English
Title of host publication	2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
DOIs	https://doi.org/10.1109/GLOCOM.2010.5683705
Publication status	Published - 2010
Event	53rd IEEE Global Communications Conference, GLOBECOM - 2010 - Miami, United States Duration: 6 Dec 2010 → 10 Dec 2010

Other

Other	53rd IEEE Global Communications Conference, GLOBECOM - 2010
Country/Territory	United States
City	Miami
Period	6/12/10 → 10/12/10

Keywords

Inter-cell interference
Multicell network
Power control
User scheduling
Weighted sum throughput

Access to Document

10.1109/GLOCOM.2010.5683705

Cite this

@inproceedings{39825a73ffd1405e8616069e00f1eb64,

title = "Coordinated user scheduling and power control for weighted sum throughput maximization of multicell network",

abstract = "In this paper, we consider the weighted sum throughput maximization (WSTM) problem of multicell network with full spectral reuse. The WSTM problem is a nonconvex combinatorial problem, and difficult to tackle in practice. Thus, we present and discuss three low-complexity suboptimal algorithms, which solve the WSTM problem via joint user scheduling and power control (USPC) among a set of coordinating cells. Extensive system level simulations show that all the proposed algorithms have close weighted sum throughput (WST) performances to that of exhaustive search (ES). Furthermore, the proposed distributed iterative (DI) algorithm, which enjoys both distributed operation and fast convergence, is the most attractive one in practical systems.",

keywords = "Inter-cell interference, Multicell network, Power control, User scheduling, Weighted sum throughput",

author = "Lu Liu and Daiming Qu and Tao Jiang and Jie Ding",

year = "2010",

doi = "10.1109/GLOCOM.2010.5683705",

language = "English",

isbn = "9781424456383",

booktitle = "2010 IEEE Global Telecommunications Conference, GLOBECOM 2010",

note = "53rd IEEE Global Communications Conference, GLOBECOM - 2010 ; Conference date: 06-12-2010 Through 10-12-2010",

}

TY - GEN

T1 - Coordinated user scheduling and power control for weighted sum throughput maximization of multicell network

AU - Liu, Lu

AU - Qu, Daiming

AU - Jiang, Tao

AU - Ding, Jie

PY - 2010

Y1 - 2010

N2 - In this paper, we consider the weighted sum throughput maximization (WSTM) problem of multicell network with full spectral reuse. The WSTM problem is a nonconvex combinatorial problem, and difficult to tackle in practice. Thus, we present and discuss three low-complexity suboptimal algorithms, which solve the WSTM problem via joint user scheduling and power control (USPC) among a set of coordinating cells. Extensive system level simulations show that all the proposed algorithms have close weighted sum throughput (WST) performances to that of exhaustive search (ES). Furthermore, the proposed distributed iterative (DI) algorithm, which enjoys both distributed operation and fast convergence, is the most attractive one in practical systems.

AB - In this paper, we consider the weighted sum throughput maximization (WSTM) problem of multicell network with full spectral reuse. The WSTM problem is a nonconvex combinatorial problem, and difficult to tackle in practice. Thus, we present and discuss three low-complexity suboptimal algorithms, which solve the WSTM problem via joint user scheduling and power control (USPC) among a set of coordinating cells. Extensive system level simulations show that all the proposed algorithms have close weighted sum throughput (WST) performances to that of exhaustive search (ES). Furthermore, the proposed distributed iterative (DI) algorithm, which enjoys both distributed operation and fast convergence, is the most attractive one in practical systems.

KW - Inter-cell interference

KW - Multicell network

KW - Power control

KW - User scheduling

KW - Weighted sum throughput

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

U2 - 10.1109/GLOCOM.2010.5683705

DO - 10.1109/GLOCOM.2010.5683705

M3 - Conference proceeding contribution

AN - SCOPUS:79551618220

SN - 9781424456383

BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010

T2 - 53rd IEEE Global Communications Conference, GLOBECOM - 2010

Y2 - 6 December 2010 through 10 December 2010

ER -

Coordinated user scheduling and power control for weighted sum throughput maximization of multicell network

Abstract

Other

Keywords

Access to Document

Other files and links

Fingerprint

Cite this