A genetic algorithm approach to solve channel assignment problem in cellular radio networks

G. Chakraborty, B. Chakraborty
{"title":"A genetic algorithm approach to solve channel assignment problem in cellular radio networks","authors":"G. Chakraborty, B. Chakraborty","doi":"10.1109/SMCIA.1999.782704","DOIUrl":null,"url":null,"abstract":"We propose an efficient algorithm for channel assignment problem in cellular radio networks. The task is to assign channels to different cells in a spectrum-efficient way i.e. the minimum frequency band is used and at the same time interference among calls from different cells is avoided. The simplest version of this problem, where only co-channel interference is considered, is NP-complete. We propose a solution based on genetic algorithm approach. The contribution of this paper is twofold. (1) A novel way of generating the initial population which creates near optimum solutions when the population is large is presented. In all the cases we tried the best of these solutions are better or as good as those obtained by existing methods. (2) A genetic mutation operation is defined which improves the quality of the previously obtained initial solutions to an optimum solution. Simulation results are reported.","PeriodicalId":222278,"journal":{"name":"SMCia/99 Proceedings of the 1999 IEEE Midnight - Sun Workshop on Soft Computing Methods in Industrial Applications (Cat. No.99EX269)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SMCia/99 Proceedings of the 1999 IEEE Midnight - Sun Workshop on Soft Computing Methods in Industrial Applications (Cat. No.99EX269)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMCIA.1999.782704","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 34

Abstract

We propose an efficient algorithm for channel assignment problem in cellular radio networks. The task is to assign channels to different cells in a spectrum-efficient way i.e. the minimum frequency band is used and at the same time interference among calls from different cells is avoided. The simplest version of this problem, where only co-channel interference is considered, is NP-complete. We propose a solution based on genetic algorithm approach. The contribution of this paper is twofold. (1) A novel way of generating the initial population which creates near optimum solutions when the population is large is presented. In all the cases we tried the best of these solutions are better or as good as those obtained by existing methods. (2) A genetic mutation operation is defined which improves the quality of the previously obtained initial solutions to an optimum solution. Simulation results are reported.
一种解决蜂窝无线网络信道分配问题的遗传算法
提出了一种有效的蜂窝无线网络信道分配算法。任务是以频谱有效的方式将信道分配给不同的小区,即使用最小的频带,同时避免来自不同小区的呼叫之间的干扰。这个问题的最简单的版本,只考虑同信道干扰,是np完全的。我们提出了一种基于遗传算法的解决方案。本文的贡献是双重的。(1)提出了一种在种群较大时产生近似最优解的初始种群生成方法。在所有情况下,我们都尽力使这些解决方案比现有方法得到的解决方案更好或同样好。(2)定义了一种基因突变操作,该操作将先前获得的初始解的质量提高到最优解。给出了仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信