SUBCARRIER AND BIT ALLOCATION SCHEME FOR THE MA PROBLEM BASED ON THE ANT COLONY OPTIMIZATION TO MINIMIZE POWER CONSUMPTION IN OFDMA SYSTEMS

Citations

WEB OF SCIENCE

3
Citations

SCOPUS

6

초록

Subcarrier and bit allocation for margin adaptive (MA) problem with goal of minimizing the transmit power consumption under a given requirement has become an important issue for providing efficient power saving design in downlink orthogonal frequency division multiplexing access (OFDMA) systems. However, the problem becomes NP-hard because it requires a great complex searching facility to find a bit and subcarrier combination which performs the best. To find the best combination without a full search, we propose an efficient subcarrier and bit allocation scheme for the MA problem based on the ant colony optimization (ACO) algorithm minimizing transmit power consumption with satisfaction of required bits. Simulation results show the proposed ACO based scheme provides better performance in terms of less transmit power consumption and faster convergence.

키워드

OFDMA systemSubcarrier and bit allocationAnt colony optimizationGenetic algorithmTransmit power minimizationGENETIC ALGORITHMS
제목
SUBCARRIER AND BIT ALLOCATION SCHEME FOR THE MA PROBLEM BASED ON THE ANT COLONY OPTIMIZATION TO MINIMIZE POWER CONSUMPTION IN OFDMA SYSTEMS
저자
Song, JungsupKim, Dong Hoi
발행일
2011-08
유형
Article
저널명
International Journal of Innovative Computing, Information and Control
7
8
페이지
4755 ~ 4764