IEEE 802.11网络中的动态信道分配

R. Akl, Anurag Arepally
{"title":"IEEE 802.11网络中的动态信道分配","authors":"R. Akl, Anurag Arepally","doi":"10.1109/PORTABLE.2007.63","DOIUrl":null,"url":null,"abstract":"We design a dynamic channel assignment algorithm for IEEE 802.11 wireless networks. Our algorithm assigns channels dynamically in a way that minimizes channel interference generated by neighboring access points (APs) on a reference access point, resulting in higher throughput. We implement and simulate our algorithm using two versions (I: pick rand and II: pick first) and different number of APs (4, 9, 16, and 25). Analysis of our algorithm shows an improvement by a factor of 4 (by lowering the total interference on an AP by 6 dBm on average) over default settings of having all APs use the same channel. As the number of APs is increased in a given service area, dynamic channel assignment becomes crucial; otherwise overlapping channel interference becomes a limiting factor.","PeriodicalId":426585,"journal":{"name":"2007 IEEE International Conference on Portable Information Devices","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"98","resultStr":"{\"title\":\"Dynamic Channel Assignment in IEEE 802.11 Networks\",\"authors\":\"R. Akl, Anurag Arepally\",\"doi\":\"10.1109/PORTABLE.2007.63\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We design a dynamic channel assignment algorithm for IEEE 802.11 wireless networks. Our algorithm assigns channels dynamically in a way that minimizes channel interference generated by neighboring access points (APs) on a reference access point, resulting in higher throughput. We implement and simulate our algorithm using two versions (I: pick rand and II: pick first) and different number of APs (4, 9, 16, and 25). Analysis of our algorithm shows an improvement by a factor of 4 (by lowering the total interference on an AP by 6 dBm on average) over default settings of having all APs use the same channel. As the number of APs is increased in a given service area, dynamic channel assignment becomes crucial; otherwise overlapping channel interference becomes a limiting factor.\",\"PeriodicalId\":426585,\"journal\":{\"name\":\"2007 IEEE International Conference on Portable Information Devices\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"98\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Conference on Portable Information Devices\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PORTABLE.2007.63\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Conference on Portable Information Devices","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PORTABLE.2007.63","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 98

摘要

设计了一种适用于IEEE 802.11无线网络的动态信道分配算法。我们的算法以最小化参考接入点上相邻接入点(ap)产生的信道干扰的方式动态分配信道,从而获得更高的吞吐量。我们使用两个版本(I: pick rand和II: pick first)和不同数量的ap(4,9,16和25)实现和模拟我们的算法。对我们算法的分析表明,与让所有AP使用相同信道的默认设置相比,改进了4倍(通过将AP上的总干扰平均降低6 dBm)。随着给定服务区域内ap数量的增加,动态信道分配变得至关重要;否则重叠信道干扰将成为限制因素。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic Channel Assignment in IEEE 802.11 Networks
We design a dynamic channel assignment algorithm for IEEE 802.11 wireless networks. Our algorithm assigns channels dynamically in a way that minimizes channel interference generated by neighboring access points (APs) on a reference access point, resulting in higher throughput. We implement and simulate our algorithm using two versions (I: pick rand and II: pick first) and different number of APs (4, 9, 16, and 25). Analysis of our algorithm shows an improvement by a factor of 4 (by lowering the total interference on an AP by 6 dBm on average) over default settings of having all APs use the same channel. As the number of APs is increased in a given service area, dynamic channel assignment becomes crucial; otherwise overlapping channel interference becomes a limiting factor.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信