Toggle Main Menu Toggle Search

ePrints

Optimal User Scheduling and Resource Allocation Strategy for AMC based OFDMA Systems

Lookup NU author(s): Muayad Al-Janabi, Dr Charalampos Tsimenidis, Professor Bayan Sharif, Dr Stephane Le Goff

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

We propose a cross-layer strategy that jointly optimizes user scheduling and resource allocation for adaptive modulation and coding (AMC) based orthogonal frequency multiple access (OFDMA). The objective of this paper is to maximize the system throughput as a function of the bit error rate (BER) and the spectral efficiency based on selected modulation and coding schemes (MCSs). The proposed optimal user scheduling and resource allocation (OSRA) strategy arranges the users in distinct queues according to their priorities and selects users in an optimal manner that guarantees fair services for users among different priority levels. Moreover, it allocates the available resources optimally over the utilized sub-channels. The transmitter of the investigated AMC-OFDMA system at the assigned base station (BS) divides the transmitted OFDMA frame into sub-channels depending on the number of the considered priority levels. Simulation results show that the performance of the investigated AMC-OFDMA system based on the proposed OSRA strategy outperforms the conventional approaches.


Publication metadata

Author(s): Al-Janabi MS, Tsimenidis CC, Sharif BS, Le Goff SY

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 2010 IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC)

Year of Conference: 2010

Pages: 1298-1302

Publisher: IEEE

URL: http://dx.doi.org/10.1109/PIMRC.2010.5672022

DOI: 10.1109/PIMRC.2010.5672022

Library holdings: Search Newcastle University Library for this item

ISBN: 9781424480173


Actions

    Link to this publication


Share