Francisco Novillo, M. Churchman, R. Ferrús, R. Agustí
{"title":"A channel allocation algorithm for OSA-enabled IEEE 802.11 WLANs","authors":"Francisco Novillo, M. Churchman, R. Ferrús, R. Agustí","doi":"10.1109/ISWCS.2009.5285281","DOIUrl":null,"url":null,"abstract":"Channel allocation problem is a major challenge in wireless local area networks (WLANs), especially in dense deployments of access points (APs) where congestion of the unlicensed spectrum bands (i.e., ISM bands) could undermine achieved network performance. This paper analyses the possibility to alleviate congestion of the ISM band by allowing some APs to use additional channels located in licensed bands in an opportunistic manner whenever licensee services (i.e., primary users) are not affected. Availability of these additional channels in licensed bands is assumed not to be the same for all the APs. Based on this assumption, we formulate the problem for the channel assignment as a Binary Linear Programming (BLP) problem, which allows us to obtain an optimal solution despite an elevated execution time. We also develop a heuristic method based on building a Minimum Spanning Tree (MST) graph attending to interference conditions that is able to find near-optimal solutions with a shorter execution time. Results are provided to assess the benefits of such a proposal under different WLAN deployment situations and primary channel availability conditions.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"181 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 6th International Symposium on Wireless Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2009.5285281","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
Channel allocation problem is a major challenge in wireless local area networks (WLANs), especially in dense deployments of access points (APs) where congestion of the unlicensed spectrum bands (i.e., ISM bands) could undermine achieved network performance. This paper analyses the possibility to alleviate congestion of the ISM band by allowing some APs to use additional channels located in licensed bands in an opportunistic manner whenever licensee services (i.e., primary users) are not affected. Availability of these additional channels in licensed bands is assumed not to be the same for all the APs. Based on this assumption, we formulate the problem for the channel assignment as a Binary Linear Programming (BLP) problem, which allows us to obtain an optimal solution despite an elevated execution time. We also develop a heuristic method based on building a Minimum Spanning Tree (MST) graph attending to interference conditions that is able to find near-optimal solutions with a shorter execution time. Results are provided to assess the benefits of such a proposal under different WLAN deployment situations and primary channel availability conditions.