Please be patient while the object screen loads.
Please use this identifier to cite or link to this item : http://hdl.handle.net/2078.1/74616
This paper considers the downlink of a cellular orthogonal frequency division multi-access (OFDMA) system, in which multiple base stations (BSs) are coordinated by a centralized resource allocation algorithm. We address the problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each BS. In particular, the solution of this problem corresponds to a resource allocation that guarantees similar rates to users in each cell. We propose a coordinate ascent based iterative algorithm which alternatively updates the power allocation by solving a successive set of convex optimization problems with geometric programming, as well as optimizes the subcarrier allocation by solving a linear program for each cell. We illustrate the effectiveness of the algorithm by numerical experiments.
|Publication Date :||2010|
|Document type :||Communication à un colloque (Conference Paper) - (Présentation orale avec comité de sélection)|
|Conference :||"2010 IEEE 21st International Symposium on Personal, Indoor and MobileRadio Communications Workshops (PIMRC Workshops)", Turkey (du 26/09/2010 au 30/09/2010)|
|Source :||"2010 IEEE 21st International Symposium on Personal, Indoor and MobileRadio Communications Workshops (PIMRC Workshops)"- 381-6 (ISBN : 978-1-4244-9117-9)|
|Publication status :||Publié|
|Subject :||Coordinate ascent ; Resource allocation algorithm ; Maximizing WSMR ; Downlink cellular OFDMA systems ; Multiple base stations ; Convex optimization problems ; Geometric programming ; Subcarrier allocation|
|No file available|