Meta-Heuristic Solution for Dynamic Association Control in Virtualized Multi-Rate WLANs

Seyed Dawood Sajjadi Torshizi, Maryam Tanha, Jianping Pan
{"title":"Meta-Heuristic Solution for Dynamic Association Control in Virtualized Multi-Rate WLANs","authors":"Seyed Dawood Sajjadi Torshizi, Maryam Tanha, Jianping Pan","doi":"10.1109/LCN.2016.53","DOIUrl":null,"url":null,"abstract":"Chaotic deployment of Wireless Local Area Networks (WLANs) in dense urban areas is one of the common issues of many Internet Service Providers (ISPs) and Wi-Fi users. It results in a substantial reduction of the throughput and impedes the balanced distribution of bandwidth among the users. Most of these networks are managed independently and there is no cooperation among them. Moreover, the conventional association mechanism that selects the Access Points (APs) with the strongest Received Signal Strength Indicator (RSSI) aggravates this situation. In this paper, we present a versatile near-optimal solution for the fair bandwidth distribution over virtualized WLANs through dynamic association control. The proposed scheme is called ACO-PF, which is developed on top of Ant Colony Optimization (ACO) as a meta-heuristic technique to provide Proportional Fairness (PF) among the greedy clients. In fact, it presents a generic and centralized solution for ISPs that are using a common, virtualized or overlapped WLAN infrastructure for serving their customers. We have evaluated the efficacy of ACO-PF through numerical analysis versus popular existing schemes for both downlink and uplink scenarios. Our proposed technique has less complexity in terms of the implementation and running time for largescale WLANs and it can be easily developed and customized for different objective functions. In addition, it is implemented in a testbed environment to investigate the key challenges of real deployment scenarios.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"35 1","pages":"253-261"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2016.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Chaotic deployment of Wireless Local Area Networks (WLANs) in dense urban areas is one of the common issues of many Internet Service Providers (ISPs) and Wi-Fi users. It results in a substantial reduction of the throughput and impedes the balanced distribution of bandwidth among the users. Most of these networks are managed independently and there is no cooperation among them. Moreover, the conventional association mechanism that selects the Access Points (APs) with the strongest Received Signal Strength Indicator (RSSI) aggravates this situation. In this paper, we present a versatile near-optimal solution for the fair bandwidth distribution over virtualized WLANs through dynamic association control. The proposed scheme is called ACO-PF, which is developed on top of Ant Colony Optimization (ACO) as a meta-heuristic technique to provide Proportional Fairness (PF) among the greedy clients. In fact, it presents a generic and centralized solution for ISPs that are using a common, virtualized or overlapped WLAN infrastructure for serving their customers. We have evaluated the efficacy of ACO-PF through numerical analysis versus popular existing schemes for both downlink and uplink scenarios. Our proposed technique has less complexity in terms of the implementation and running time for largescale WLANs and it can be easily developed and customized for different objective functions. In addition, it is implemented in a testbed environment to investigate the key challenges of real deployment scenarios.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
虚拟多速率无线局域网动态关联控制的元启发式解决方案
在人口密集的城市地区,无线局域网(wlan)的混乱部署是许多互联网服务提供商(isp)和Wi-Fi用户共同面临的问题之一。它会导致吞吐量的大幅降低,并阻碍带宽在用户之间的均衡分配。这些网络大多是独立管理的,它们之间没有合作。此外,传统的关联机制选择具有最强接收信号强度指标(RSSI)的接入点(ap),这加剧了这种情况。本文提出了一种基于动态关联控制的虚拟wlan公平带宽分配的通用近最优解决方案。该方案是在蚁群优化(ACO)的基础上发展起来的一种元启发式算法,用于在贪婪客户端之间提供比例公平(PF)。实际上,它为使用通用的、虚拟化的或重叠的WLAN基础设施为其客户服务的isp提供了一种通用的集中式解决方案。我们通过数值分析评估了ACO-PF在下行和上行场景下的有效性,对比了现有的流行方案。该技术在大规模无线局域网的实现和运行时间方面具有较低的复杂性,并且可以很容易地针对不同的目标函数进行开发和定制。此外,它是在测试平台环境中实现的,以调查真实部署场景的关键挑战。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the General Chair Message from the general chair Best of Both Worlds: Prioritizing Network Coding without Increased Space Complexity Controlling Network Latency in Mixed Hadoop Clusters: Do We Need Active Queue Management? TransFetch: A Viewing Behavior Driven Video Distribution Framework in Public Transport
×
引用
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