中国邮电高校学报(英文) ›› 2010, Vol. 17 ›› Issue (6): 59-64.doi: 10.1016/S1005-8885(09)60526-4

• Wireless • 上一篇    下一篇

Adaptive subcarrier and bit allocation based on ant colony optimization

赵英宏1,许晓东1,郝志洁2,陶小峰3   

  1. Wireless Technology Innovation Institute, Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • 收稿日期:2010-04-28 修回日期:2010-07-13 出版日期:2010-12-30 发布日期:2010-12-06
  • 通讯作者: 陶小峰 E-mail: hongxiao_h@163.com
  • 基金资助:

    国家自然基金

Adaptive subcarrier and bit allocation based on ant colony optimization

  1. Wireless Technology Innovation Institute, Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2010-04-28 Revised:2010-07-13 Online:2010-12-30 Published:2010-12-06

摘要:

The problem of resource allocation in multiuser orthogonal frequency division multiplexing (OFDM) system is a combinatorial optimization problem, difficult to obtain optimal solutions in polynomial time. For the sake of reducing complexity, it can be solved either by relaxing constraints and making use of linear algorithms or by metaheuristic methods. In this paper, an algorithm based on ant colony optimization (ACO), which is a typical algorithm of metaheuristic methods, is proposed for the problem, utilizing excellent search performance of ACO to obtain good solutions. In addition, a parameter is applied to balance the efficiency and fairness of resource allocation. Performance analysis between algorithms based on ACO and genetic algorithm (GA) is carried out, indicating that the proposed algorithm based on ACO outperforms traditional linear algorithms as well as GA in the system throughput with assurance of fairness simultaneously, being as a promising technology for OFDM resource allocation.

关键词:

ACO, OFDM, GA

Abstract:

The problem of resource allocation in multiuser orthogonal frequency division multiplexing (OFDM) system is a combinatorial optimization problem, difficult to obtain optimal solutions in polynomial time. For the sake of reducing complexity, it can be solved either by relaxing constraints and making use of linear algorithms or by metaheuristic methods. In this paper, an algorithm based on ant colony optimization (ACO), which is a typical algorithm of metaheuristic methods, is proposed for the problem, utilizing excellent search performance of ACO to obtain good solutions. In addition, a parameter is applied to balance the efficiency and fairness of resource allocation. Performance analysis between algorithms based on ACO and genetic algorithm (GA) is carried out, indicating that the proposed algorithm based on ACO outperforms traditional linear algorithms as well as GA in the system throughput with assurance of fairness simultaneously, being as a promising technology for OFDM resource allocation.

Key words:

ACO, OFDM, GA