Weighted sum-rate maximization in singlecast and multicast wireless networks - Global optimum via branch and bound

Author

Codreanu, M. ; Weeraddana, P.C. ; Latva-aho, M. ; Ephremides, A.

Author_Institution

Centre for Wireless Commun., Univ. of Oulu, Oulu, Finland

fYear

2011

fDate

11-14 Sept. 2011

Firstpage

2274

Lastpage

2278

Abstract

We consider the problem of weighted sum-rate maximization (WSRMax) in wireless networks. This problem is known to be NP-hard and it plays a central role in resource allocation, link scheduling or in finding achievable rate regions for both singlecast and multicast networks. We propose a solution method, based on the branch and bound technique, which solves globally the WSRMax problem with an optimality certificate. Efficient bounding techniques are introduced as well.

Keywords

computational complexity; multicast communication; optimisation; radio networks; tree searching; NP-hard; WSRMax; branch-and-bound technique; global optimum; link scheduling; multicast wireless network; resource allocation; singlecast wireless network; weighted sum-rate maximization; Fading; Interference; Receivers; Signal to noise ratio; Transmitters; Upper bound; Wireless networks; branch and bound; global (nonconvex) optimization; multicast networks; wireless singlecast;

fLanguage

English

Publisher

ieee

Conference_Titel

Personal Indoor and Mobile Radio Communications (PIMRC), 2011 IEEE 22nd International Symposium on

Conference_Location

Toronto, ON

ISSN

pending

Print_ISBN

978-1-4577-1346-0

Electronic_ISBN

pending

Type

conf

DOI

10.1109/PIMRC.2011.6139923

Filename

6139923