Contiguous Frequency-Time Resource Allocation andScheduling for Wireless OFDMA Systems with QoS Support
The orthogonal frequency division multiple access (OFDMA) scheme has been selected as a potential candidate for many emerging broadband wireless access standards. In this paper, a new joint scheduling and resource allocation scheme is proposed for the OFDMA systems using contiguous subcarrier permut...
| Autores: | , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2009 |
| País: | España |
| Recursos: | Universitat Ramon Llull (URL) |
| Repositorio: | DAU Arxiu Digital de la Universitat Ramon Llull |
| OAI Identifier: | oai:dau.url.edu:20.500.14342/3350 |
| Acesso em linha: | http://hdl.handle.net/20.500.14342/3350 http://doi.org/10.1155/2009/134579 |
| Access Level: | acceso abierto |
| Palavra-chave: | Telecomunicació de banda ampla, Sistemes de Telecomunicació, Sistemes de |
| Resumo: | The orthogonal frequency division multiple access (OFDMA) scheme has been selected as a potential candidate for many emerging broadband wireless access standards. In this paper, a new joint scheduling and resource allocation scheme is proposed for the OFDMA systems using contiguous subcarrier permutation. The proposed resource allocation algorithm provides contiguous sets of frequency-time resource units following a rectangular shape yielding a reduction on the required burst signalling. The joint scheduling and resource allocation process is divided into two phases: the QoS requirements fulfilment and the input buffers emptying status. For each phase, a specific prioritization function is defined in order to obtain a trade-off between the fairness and the spectral efficiency maximization. The new prioritization scheme provides a reduction of 50% of the 99th percentile from the delivered packets delay in case of non real-time services, and 30% of the packet loss rate in case of real-time services compared to the proportional fair scheduling function. On the other hand, it is also demonstrated that using the rectangular data packing algorithm, the number of required bursts per frame can be reduced up to a few tenths without compromising the performance. |
|---|