东北大学学报(自然科学版) ›› 2003, Vol. 24 ›› Issue (3): 213-216.DOI: -

• 论著 • 上一篇    下一篇

蜂窝网络中基于遗传算法的信道分配

李满林;王玉娜;杜雷;王光兴   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院 辽宁沈阳110004
  • 收稿日期:2013-06-23 修回日期:2013-06-23 出版日期:2003-03-15 发布日期:2013-06-23
  • 通讯作者: Li, M.-L.
  • 作者简介:-
  • 基金资助:
    国家“八六三”高技术计划项目 ( 69973 0 11)

Channel assignment problem in cellular networks using genetic algorithms

Li, Man-Lin (1); Wang, Yu-Na (1); Du, Lei (1); Wang, Guang-Xing (1)   

  1. (1) Sch. of Info. Sci. and Eng., Northeastern Univ., Shenyang 110004, China
  • Received:2013-06-23 Revised:2013-06-23 Online:2003-03-15 Published:2013-06-23
  • Contact: Li, M.-L.
  • About author:-
  • Supported by:
    -

摘要: 信道分配问题属于组合优化中的NP完备问题 ,为了更有效的利用频率资源 ,在遗传算法的基础上提出了一种新的信道分配方法·在信道分配中主要考虑三种限制 :同频限制、邻频限制和同位置限制·目标是得到一个用最少的信道数 ,满足话务需求和电磁兼容限制的信道分配方案·采用了最小间隔编码方案 ,利用固定遗传算子 (交叉和变异 ) ,在整个迭代过程中始终满足话务需求的要求·提出了几种遗传算子并进行了验证 ,比较结果表明选择性变异技术能得到很好的结果·对几个著名的benchmark问题进行仿真 ,结果表明 ,它对解决信道分配问题是一个非常有效的方法

关键词: 移动通信, 蜂窝网络, 遗传算法, 最小间隔编码, 信道分配, 选择性变异算子

Abstract: In order to use the frequencies more efficiently, a new channel assignment approach based on genetic algorithms was proposed. Three constraints were considered for the channel assignment: the co-channel constraint, the adjacent constraint and the co-site constraint. The objective is to obtain a channel assignment scheme. The scheme satisfies both the traffic demand requirements and electromagnetic compatibility constraints with the lower-bound channel number. The minimum-separation encoding scheme was put forward. The traffic demand can be fulfilled throughout the iterative process using the genetic-fix operators (crossover and mutation). Some GAs operators were proposed and tested. Some well-known benchmark problems were simulated. The proposed algorithm is a better approach for solving the channel assignment problem.

中图分类号: