{"title":"蜂窝移动网络中的信道分配问题:一种分布式约束满足方法","authors":"Visale Kim, Wei Liu, W. Cheng","doi":"10.1109/CMC.2010.296","DOIUrl":null,"url":null,"abstract":"Since the natural resources of electromagnetic spectrum are strictly administrated, the channel assignment problem (CAP) has been an important issue for cellular mobile network. CAP is a well-known NP-hard problem, which is to minimize the maximum of channel utilization, while guaranteeing the voice quality. In this paper, we model CAP as a Distributed Constraint Satisfaction Problem (DCSP) with fully considerations on all kinds of interference constraints. A kind of distributed backtracking algorithm (DBA) is proposed to solve this DCSP problem. Simulation results show that, comparing with the similar previous work in [10], our approach can achieve much tight lower bounds on the number of required channels with related less computation time and cost.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Channel Assignment Problem in Cellular Mobile Network: A Distributed Constraint Satisfaction Approach\",\"authors\":\"Visale Kim, Wei Liu, W. Cheng\",\"doi\":\"10.1109/CMC.2010.296\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since the natural resources of electromagnetic spectrum are strictly administrated, the channel assignment problem (CAP) has been an important issue for cellular mobile network. CAP is a well-known NP-hard problem, which is to minimize the maximum of channel utilization, while guaranteeing the voice quality. In this paper, we model CAP as a Distributed Constraint Satisfaction Problem (DCSP) with fully considerations on all kinds of interference constraints. A kind of distributed backtracking algorithm (DBA) is proposed to solve this DCSP problem. Simulation results show that, comparing with the similar previous work in [10], our approach can achieve much tight lower bounds on the number of required channels with related less computation time and cost.\",\"PeriodicalId\":296445,\"journal\":{\"name\":\"2010 International Conference on Communications and Mobile Computing\",\"volume\":\"82 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Communications and Mobile Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMC.2010.296\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Communications and Mobile Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMC.2010.296","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Channel Assignment Problem in Cellular Mobile Network: A Distributed Constraint Satisfaction Approach
Since the natural resources of electromagnetic spectrum are strictly administrated, the channel assignment problem (CAP) has been an important issue for cellular mobile network. CAP is a well-known NP-hard problem, which is to minimize the maximum of channel utilization, while guaranteeing the voice quality. In this paper, we model CAP as a Distributed Constraint Satisfaction Problem (DCSP) with fully considerations on all kinds of interference constraints. A kind of distributed backtracking algorithm (DBA) is proposed to solve this DCSP problem. Simulation results show that, comparing with the similar previous work in [10], our approach can achieve much tight lower bounds on the number of required channels with related less computation time and cost.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
