arrow
Return

A performance comparative study on the implementation methods for OFDMA cross-layer optimization

delete2012-06-01
delete5
PRE
AI
C
Charilaos C. Zarakovitis
Q
Qiang Ni *
DOI:10.1016/j.future.2011.10.008delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
One key issue in cross-layer optimization techniques for next-generation multi-user orthogonal frequency division multiple access (OFDMA)-based broadband wireless network systems lies in the implementation methods of optimal resource scheduling. In the literature the optimal solutions are derived either through dynamic programming (referred to as a purely numerical approach) or via mathematical analysis (referred to as an analytical approach). When the latter approach is adopted, an additional iterative process is usually needed for the final optimal solution to be obtained. This paper presents a first in-depth comparative study on the implementation performance between the analytical and the numerical techniques. For this purpose, various popular iterative methods and numerical methods are investigated in our study. Several performance metrics (e.g., achieved overall data rate, absolute approximation error, and computational time) are utilized for comparison. Our simulation results demonstrate clearly that the analytical approaches indeed outperform the numerical ones. Furthermore, regarding different iterative methods, it is shown that the semi-implicit root (SIR) mechanism performs best in terms of the convergence rate, the root-finding accuracy, and the computational time. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Cross-layer scheduling
Semi-implicit root (SIR)
Iterative method
Multiple access
Orthogonal Frequency Division Multiple Access (OFDMA)
Optimization techniques
Resource allocation
Wireless networks

Journal

F
Future Generation Computer Systems-The International Journal of eScience
IF:
6.1
Papers:
6.8K
Citations:
2.3W

Organization

B
brunel university
Scholars:
5.8K
Papers: 7.1K
Citations: 9