A holding access-point assignment algorithm for IEEE802.11 wireless local-area networks

S. Tajima, N. Funabiki, T. Higashino
{"title":"A holding access-point assignment algorithm for IEEE802.11 wireless local-area networks","authors":"S. Tajima, N. Funabiki, T. Higashino","doi":"10.1504/IJSSC.2018.10012309","DOIUrl":null,"url":null,"abstract":"Nowadays, various types of access-points (APs) and hosts such as dedicated APs, laptop personal computers (PCs), and mobile terminals have been used in IEEE802.11 wireless local-area networks (WLANs). As a result, the optimal assignment of holding APs with different types into the network field, depending on the host type distribution, has become another important task to design high-performance WLANs. In this paper, we first define this holding access-point assignment problem as a combinatorial optimisation problem and propose its two-phase heuristic algorithm. Then, since plural partially overlapping channels are available in IEEE802.11 WLANs, we present the channel assignment extension to the APs such that the communication time of the APs is minimised, and the model to estimate the communication time increase by interferences. The effectiveness of our proposal is verified through simulations in six instances using the WIMNET simulator.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Space-Based and Situated Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJSSC.2018.10012309","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Nowadays, various types of access-points (APs) and hosts such as dedicated APs, laptop personal computers (PCs), and mobile terminals have been used in IEEE802.11 wireless local-area networks (WLANs). As a result, the optimal assignment of holding APs with different types into the network field, depending on the host type distribution, has become another important task to design high-performance WLANs. In this paper, we first define this holding access-point assignment problem as a combinatorial optimisation problem and propose its two-phase heuristic algorithm. Then, since plural partially overlapping channels are available in IEEE802.11 WLANs, we present the channel assignment extension to the APs such that the communication time of the APs is minimised, and the model to estimate the communication time increase by interferences. The effectiveness of our proposal is verified through simulations in six instances using the WIMNET simulator.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
IEEE802.11无线局域网的保持接入点分配算法
目前,IEEE802.11无线局域网(wlan)已广泛应用于各种类型的接入点和主机,如专用接入点、笔记本电脑、移动终端等。因此,根据主机类型的分布,将不同类型的持有ap优化分配到网络域中,成为设计高性能wlan的又一重要任务。本文首先将持有接入点分配问题定义为组合优化问题,并提出了其两阶段启发式算法。然后,由于IEEE802.11 wlan中有多个部分重叠的信道,我们提出了对ap的信道分配扩展,使ap的通信时间最小化,并建立了估计由于干扰而增加的通信时间的模型。利用WIMNET模拟器对六个实例进行了仿真,验证了该方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Space-Based and Situated Computing
International Journal of Space-Based and Situated Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-
自引率
0.00%
发文量
0
期刊最新文献
A hierarchical outlier detection method for spare parts transaction A multi-tiered spare parts inventory forecasting system GPS availability prediction based on air-ground collaboration Inventory Optimization based on NSGA-III Algorithm Data privacy and anonymisation of simulated health-care dataset using the ARX open source tool
×
引用
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