{"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.