TY - JOUR
T1 - An ant colony optimization algorithm for spectrum assignment in cognitive radio networks
AU - Yang, Miao
AU - An, Jian Ping
PY - 2011/10
Y1 - 2011/10
N2 - To solve the spectrum assignment issue in cognitive network, a new ant optimization algorithm for spectrum assignment is proposed in this paper. In the cognitive radio network model, where primary and secondary users are coexistent, ants visit secondary users as the node, and leave pheromones using channel rewards. By this way the optimized parallel algorithm is implemented. Compared with the traditional spectrum assignment method, it can implement enhanced accumulation by learning, fast coverage to the optimal resolution, and improve the performance in the whole network average throughput. The method is analyzed. Simulation results verify the stability and validity of the method.
AB - To solve the spectrum assignment issue in cognitive network, a new ant optimization algorithm for spectrum assignment is proposed in this paper. In the cognitive radio network model, where primary and secondary users are coexistent, ants visit secondary users as the node, and leave pheromones using channel rewards. By this way the optimized parallel algorithm is implemented. Compared with the traditional spectrum assignment method, it can implement enhanced accumulation by learning, fast coverage to the optimal resolution, and improve the performance in the whole network average throughput. The method is analyzed. Simulation results verify the stability and validity of the method.
KW - Ant colony optimization
KW - Cognitive Radio (CR)
KW - Pheromone
KW - Spectrum assignment
UR - http://www.scopus.com/inward/record.url?scp=80555135483&partnerID=8YFLogxK
U2 - 10.3724/SP.J.1146.2011.00242
DO - 10.3724/SP.J.1146.2011.00242
M3 - Article
AN - SCOPUS:80555135483
SN - 1009-5896
VL - 33
SP - 2306
EP - 2311
JO - Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology
JF - Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology
IS - 10
ER -