By Topic

Complexity analysis and heuristic algorithms for radio resource allocation in OFDMA networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Marco Belleschi ; Departiment of Information Engineering, University of Siena, Via Roma 56, 53100 Siena, Italy ; Paolo Detti ; Andrea Abrardo

In this paper, we address the problem of allocating users to radio resources (i.e. subcarriers) in the downlink of an OFDMA system. In particular, we consider a multi-format resource allocation problem (MF-RAP) in which the link adaptation adjusts the spectral efficiency for each user-subcarrier pair, i.e. for each radio link, in order to minimize the total transmission power while fulfilling a rate request for each user. We propose an integer linear programming (ILP) formulation of the problem and exhaustively discuss the computational complexity. Specifically, we prove that the problem is NP-hard in the strong sense and demonstrate that it is hard to be approximated in polynomial time within a constant factor. Hence, we present heuristic approaches that achieve “reasonably good” solutions in the general case. Computational experiences show that, in comparison with a commercial state-of-the-art ILP optimization solver, the proposed algorithms are effective in terms of solution quality and CPU times.

Published in:

Telecommunications (ICT), 2011 18th International Conference on

Date of Conference:

8-11 May 2011