用于支持osa的IEEE 802.11 wlan的信道分配算法

Francisco Novillo, M. Churchman, R. Ferrús, R. Agustí
{"title":"用于支持osa的IEEE 802.11 wlan的信道分配算法","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":"{\"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}","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

摘要

信道分配问题是无线局域网(wlan)的一个主要挑战,特别是在接入点(ap)密集部署时,其中未授权频段(即ISM频段)的拥塞可能会破坏已实现的网络性能。本文分析了在被许可业务(即主用户)不受影响的情况下,允许一些ap以机会主义的方式使用位于许可频带中的额外信道,从而缓解ISM频带拥塞的可能性。假定许可频带中这些额外信道的可用性对所有ap都不相同。基于此假设,我们将信道分配问题表述为二进制线性规划(BLP)问题,该问题允许我们在增加执行时间的情况下获得最优解。我们还开发了一种基于构建最小生成树(MST)图的启发式方法,该方法关注干扰条件,能够以更短的执行时间找到接近最优的解决方案。在不同的WLAN部署情况和主信道可用性条件下,提供了评估这种提议的好处的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A channel allocation algorithm for OSA-enabled IEEE 802.11 WLANs
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信