基于蚁群算法的信道分配优化模型与仿真  

Simulation of Real Number Channel Assignment Model Based on ACO Algorithm

作　　者：林妍[1] 吴瑾[1] 樊锁海[1] 

机构地区：[1]暨南大学信息科学技术学院,广州510632

出　　处：《科学技术与工程》2012年第24期6016-6020,共5页Science Technology and Engineering

基　　金：国家自然科学基金(11071089);广东省自然科学基金(10151063201000005);中央高校基本科研业务费专项资金项目(21611610);暨南大学优秀本科推免研究生科研创新培育计划项目资助

摘　　要：由对蜂窝系统的分析,建立了一个固定信道分配的数学模型。在基本蚁群算法的基础上,改进了转移策略和信息素更新策略,提高了收敛速度并有效防止局部最优。在单一信道问题中,得到各种(K1,K2)约束的最优循环分配方案;且约束为(K,K)的图例,总能通过1+i×K(i=01,,…6,)这7个不同信道,分配出可无限延伸的最佳方案。而以21小区费城问题为实例的多信道分配,也得到较好的结果。通过实际图例给出的性能仿真结果,节约了过多的频率资源占用和计算时间。A mathematic model for assigning fixed channels is established with the help of analyzing the cellular system. Transfer strategy and pheromone strategy are improved based on the ACO algorithm. Meanwhile, the new algorithm has a faster convergence speed and also can prevent partial optimum effectively. In a signal channel assignment, the best schemes of various （K1,K2 ） constrains are obtained. For the graphs of （K,K） constrains, the best infinite schemes with the different channels such as the channel of 1 ＋ i x K（ i = 0,1,...,6） are given. As for a multi-channel assignment, an acceptable result is obtained solving the 21 district Philadelphia benchmark. The simulation results obtained by actual graphs, is proven more efficient in saving channel resources and saving calculating time.

关 键 词：信道分配 蚁群算法 信息素 转移策略 

分 类 号：TN911.5[电子电信—通信与信息系统]