Mitigating starvation in dense WLANs: A multi-armed Bandit solution

被引:4
|
作者
Bardou, Anthony [1 ]
Begin, Thomas [1 ]
Busson, Anthony [1 ]
机构
[1] Univ Lyon, ENS Lyon, UCBL, CNRS,Inria,LIP,UMR 5668, 46 allee Italie, F-69007 Lyon, France
关键词
WLANs; Spatial reuse; Fairness; Reinforcement learning; Thompson sampling; Power control; Clear channel assessment; SPATIAL REUSE; NETWORKS;
D O I
10.1016/j.adhoc.2022.103015
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the recent 802.11ax amendment to the IEEE standard commercialized as Wi-Fi 6, WLANs have the potential to greatly improve the spatial reuse of radio channels. This resorts to the new ability for APs (Access Points) to dynamically modify their transmission power as well as the signal energy threshold beyond which they consider the radio channel to be free or busy. In general, selecting adequate values for these parameters is complex because of (i) the high dimensionality of the problem and (ii) the uncertainty of the radio environment. To overcome these difficulties, we frame this problem as a MAB (Multi-Armed Bandit) problem and propose an efficient and robust solution using Thompson sampling, an original sampling of WLAN configurations, and a tailor-made reward function. We evaluate the efficiency of our solution as well as several other ones with scenarios inspired by real-life WLANs' deployments using the network simulator ns-3. The numerical results show the ability of our solution along with its superiority over the others at finding adequate parameterization at each AP thereby significantly improving the overall performance of WLANs.
引用
收藏
页数:13
相关论文
共 50 条
  • [11] Fair Link Prediction with Multi-Armed Bandit Algorithms
    Wang, Weixiang
    Soundarajan, Sucheta
    PROCEEDINGS OF THE 15TH ACM WEB SCIENCE CONFERENCE, WEBSCI 2023, 2023, : 219 - 228
  • [12] Contextual Multi-Armed Bandit for Email Layout Recommendation
    Chen, Yan
    Vankov, Emilian
    Baltrunas, Linas
    Donovan, Preston
    Mehta, Akash
    Schroeder, Benjamin
    Herman, Matthew
    PROCEEDINGS OF THE 17TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, RECSYS 2023, 2023, : 400 - 402
  • [13] Achieving fairness in the stochastic multi-armed bandit problem
    Patil, Vishakha
    Ghalme, Ganesh
    Nair, Vineet
    Narahari, Y.
    1600, Microtome Publishing (22): : 1 - 31
  • [14] Empirical Gittins index strategies with ?-explorations for multi-armed bandit problems
    Li, Xiao
    Li, Yuqiang
    Wu, Xianyi
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2023, 180
  • [15] Balancing Optimization for Underwater Network Cost Effectiveness (BOUNCE): a Multi-Armed Bandit solution
    Busacca, F.
    Galluccio, L.
    Palazzo, S.
    Panebianco, A.
    Scarvaglieri, A.
    2024 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS, ICC WORKSHOPS 2024, 2024, : 1340 - 1345
  • [16] Multi-objective Contextual Multi-armed Bandit With a Dominant Objective
    Tekin, Cem
    Turgay, Eralp
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2018, 66 (14) : 3799 - 3813
  • [17] The Effect of Communication on Noncooperative Multiplayer Multi-Armed Bandit Problems
    Evirgen, Noyan
    Kose, Alper
    2017 16TH IEEE INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA), 2017, : 331 - 336
  • [18] Tug-of-War Model for Multi-armed Bandit Problem
    Kim, Song-Ju
    Aono, Masashi
    Hara, Masahiko
    UNCONVENTIONAL COMPUTATION, PROCEEDINGS, 2010, 6079 : 69 - +
  • [19] Multi-armed bandit problem with online clustering as side information
    Dzhoha, Andrii
    Rozora, Iryna
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2023, 427
  • [20] A Batched Multi-Armed Bandit Approach to News Headline Testing
    Mao, Yizhi
    Chen, Miao
    Wagle, Abhinav
    Pan, Junwei
    Natkovich, Michael
    Matheson, Don
    2018 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2018, : 1966 - 1973