DYNAMIC SUBCARRIER AND BIT ALLOCATION FOR THROUGHPUT MAXIMIZATION IN MULTIUSER OFDM SYSTEMS USING ANT COLONY OPTIMAL ALGORITHM

Citations

WEB OF SCIENCE

4
Citations

SCOPUS

6

초록

In this paper, an efficient dynamic resource allocation scheme for multiuser orthogonal frequency division multiplexing (OFDM) systems is investigated There have been many researches to maximize total system throughput with only limited transmission Power In addition to the limited power, we add required minimum transmission. bits for each user as another constraint for the quality of service (QoS) requirement Greedy based algorithms are usually considered as methods that, maximize total system throughput, but, our algorithm outperforms the greedy based algorithm by using one of the heuristic algorithms called ant colony algorithm (ACA). The proposed algorithm maximizes the overall system throughput, under the given total transmission power while satisfying QoS requirements such as required bit error rate (BER) and minimum transmission bits for each user. Also, it is shown that the proposed algorithm provides better performance in terms of system outage probability, throughput fairness per user, and subcarrier availability through numerical simulation results.

키워드

Subcarrier and bit allocationThroughput maximizationHeuristic algorithmAnt colony algorithmOrthogonal frequency division multiplexingADAPTIVE SUBCARRIEROPTIMIZATIONSELECTION
제목
DYNAMIC SUBCARRIER AND BIT ALLOCATION FOR THROUGHPUT MAXIMIZATION IN MULTIUSER OFDM SYSTEMS USING ANT COLONY OPTIMAL ALGORITHM
저자
Song, JungsupKim, Dong Hoi
발행일
2010-10
유형
Article
저널명
International Journal of Innovative Computing, Information and Control
6
10
페이지
4705 ~ 4718