Greedy Algorithm for Dynamic Resource Allocation in Downlink of OFDMA System

This paper investigates the problem of dynamic multiuser resource allocation in the downlink of OFDMA system. To overcome the users' buffer overflow, a greedy algorithm is proposed in order to minimize the total power consumption subject to user's traffic requirement. The optimization prob...

Full description

Saved in:
Bibliographic Details
Published in2005 2nd International Symposium on Wireless Communication Systems pp. 475 - 479
Main Authors Najeh, S., Besbes, H., Bouallegue, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Bandwidth
Broadcasting
Communications technology
Downlink
Energy consumption
Fading
Greedy algorithms
Radio spectrum management
Resource management
Throughput
Online AccessGet full text
ISBN9780780392069
078039206X
ISSN2154-0217
DOI10.1109/ISWCS.2005.1547746

Cover

More Information
Summary:This paper investigates the problem of dynamic multiuser resource allocation in the downlink of OFDMA system. To overcome the users' buffer overflow, a greedy algorithm is proposed in order to minimize the total power consumption subject to user's traffic requirement. The optimization problem is split into two steps. In the first step, we perform subchannel allocation based on the buffer size and channel condition for every user. In the second step, we optimize power allocation for each user based on a single "water-filling" approach. Simulation results show that the proposed algorithm outperforms classical ones, since it offers a reduced total power consumption. We note a 10 dB gain when the number of users exceeds 4
ISBN:9780780392069
078039206X
ISSN:2154-0217
DOI:10.1109/ISWCS.2005.1547746