By Topic

Adaptive Resource Allocation for OFDMA System Based on Ant Colony Algorithm

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
$31 $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

4 Author(s)
Xin Zhang ; Sch. of Electron. & Inf. Eng., South China Univ. of Technol., Guangzhou, China ; Wu Ye ; Suili Feng ; Hongcheng Zhuang

This paper studies the problem of adaptive resource allocation in OFDMA system. An ant colony algorithm based adaptive resource allocation is proposed in this paper. The problem is modeled as finding a minimum cost path in a graph. The ants' solution construction is guided by pheromone trail and heuristic information. Due to the unique heuristic searching mechanism of the ant colony algorithm, the proposed algorithm is guaranteed to converge quickly to an approximately optimal solution. Simulation results showed that the performance of the proposed algorithm is close to the optimal solution, and gains 1-2 dB in comparison with the fixed allocation scheme.

Published in:

Information Science and Engineering (ICISE), 2009 1st International Conference on

Date of Conference:

26-28 Dec. 2009