We consider a downlink OFDMA cellular network wherein groups of access points are coordinated and we address the problem of jointly selecting the set of co-channel users and the power allocation across tones in order to maximize the weighted system sum-rate subject to per-base-station power constraints. To solve this problem, we propose a Successive Convex Approximation for Low-complExity (SCALE) algorithm which extends a previous optimization procedure developed for ADSL. Numerical examples are provided to assess its performance.
A Successive Convex Approximation Algorithm for Weighted Sum-Rate Maximization in Downlink OFDMA Networks
VENTURINO, Luca;
2008-01-01
Abstract
We consider a downlink OFDMA cellular network wherein groups of access points are coordinated and we address the problem of jointly selecting the set of co-channel users and the power allocation across tones in order to maximize the weighted system sum-rate subject to per-base-station power constraints. To solve this problem, we propose a Successive Convex Approximation for Low-complExity (SCALE) algorithm which extends a previous optimization procedure developed for ADSL. Numerical examples are provided to assess its performance.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
