Novel radio resource management for high density chaotic wireless LANs

Suparerk Manitpornsut
{"title":"Novel radio resource management for high density chaotic wireless LANs","authors":"Suparerk Manitpornsut","doi":"10.1109/JCSSE.2011.5930089","DOIUrl":null,"url":null,"abstract":"It is well known that WLAN based on the IEEE 802.11 standard suffers from interference and scalability problems due to the limited number of non-overlapping channels. In order to mitigate the interference problem, channel assignment algorithms have been a popular research topic in recent years. It has been shown that such algorithms can greatly reduce the interference among wireless access points. However, in this paper we present our findings that traditional channel assignment algorithm can introduce a high hidden node index in high network density, thus greatly reducing the WLAN performance. We show that careful consideration needs to be taken when assigning channels using such algorithms. In addition, we propose a novel algorithm, called Cluster Channel Assignment (CCA), which is presented in the form of a state diagram. From our simulation results, we show that CCA can outperform traditional channel assignment in densely deployed scenarios, and is therefore a better alternative in such settings.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2011.5930089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

It is well known that WLAN based on the IEEE 802.11 standard suffers from interference and scalability problems due to the limited number of non-overlapping channels. In order to mitigate the interference problem, channel assignment algorithms have been a popular research topic in recent years. It has been shown that such algorithms can greatly reduce the interference among wireless access points. However, in this paper we present our findings that traditional channel assignment algorithm can introduce a high hidden node index in high network density, thus greatly reducing the WLAN performance. We show that careful consideration needs to be taken when assigning channels using such algorithms. In addition, we propose a novel algorithm, called Cluster Channel Assignment (CCA), which is presented in the form of a state diagram. From our simulation results, we show that CCA can outperform traditional channel assignment in densely deployed scenarios, and is therefore a better alternative in such settings.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
高密度混沌无线局域网无线资源管理新方法
众所周知,基于IEEE 802.11标准的WLAN由于非重叠信道数量有限而存在干扰和可扩展性问题。为了缓解干扰问题,信道分配算法是近年来研究的热点。研究表明,这种算法可以大大减少无线接入点之间的干扰。然而,在本文中,我们发现传统的信道分配算法会在高网络密度下引入高隐藏节点指数,从而大大降低WLAN的性能。我们表明,在使用这种算法分配信道时需要仔细考虑。此外,我们提出了一种新的算法,称为群集信道分配(CCA),它以状态图的形式呈现。从我们的模拟结果中,我们表明,在密集部署的场景中,CCA可以优于传统的信道分配,因此在这种设置中是一个更好的选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Transforming state tables to Coloured Petri nets for automatic verification of internet protocols Clustering by attraction and distraction Event recognition from information-linkage based using phrase tree traversal Towards a complete project oriented risk management model: A refinement of PRORISK Solving software module clustering problem by evolutionary algorithms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1