Decentralized AP selection using multi-armed bandits: opportunistic ε-greedy with stickiness

Mostra el registre complet Registre parcial de l'ítem

• dc.contributor.author Carrascosa Zamacois, Marc
• dc.date.accessioned 2020-11-16T12:59:41Z
• dc.date.available 2020-11-16T12:59:41Z
• dc.date.issued 2020
• dc.description Comunicació presentada a: IEEE Symposium on Computers and Communications (ISCC) celebrat del 29 de juny al de 3 juliol de 2019 a Barcelona, Espanya.
• dc.description.abstract WiFi densification leads to the existence of multiple overlapping coverage areas, which allows user stations (STAs) to choose between different Access Points (APs). The standard WiFi association method makes the STAs select the AP with the strongest signal, which in many cases leads to underutilization of some APs while overcrowding others. To mitigate this situation, Reinforcement Learning techniques such as Multi-Armed Bandits can be used to dynamically learn the optimal mapping between APs and STAs, and so redistribute the STAs among the available APs accordingly. This is an especially challenging problem since the network response observed by a given STA depends on the behavior of the others, and so it is very difficult to predict without a global view of the network. In this paper, we focus on solving this problem in a decentralized way, where STAs independently explore the different APs inside their coverage range, and select the one that better satisfy its needs. To do it, we propose a novel approach called opportunistic ε-greedy with Stickiness that halts the exploration when a suitable AP is found, then, the STA remains associated to that same AP while it is satisfied, only resuming the exploration after several unsatisfactory association periods. With this approach, we reduce significantly the network response variability, improving the ability of the STAs to find a solution faster, as well as achieving a more efficient use of the network resources.
• dc.description.sponsorship This work has been partially supported by a Gift from CISCO University Research Program (CG#890107) & Silicon Valley Community Foundation, by the Spanish Ministry of Economy and Competitiveness under the Maria de Maeztu Units of Excellence Programme (MDM-2015-0502), and by the Catalan Government under grant SGR-2017-1188.
• dc.format.mimetype application/pdf
• dc.identifier.citation Carrascosa M, Bellalta B. Decentralized AP selection using multi-armed bandits: opportunistic ε-greedy with stickiness. In: Proceedings of the 2019 IEEE Symposium on Computers and Communications (ISCC); 2019 Jun 29-Jul 3; Barcelona, Spain. [New York]: IEEE; 2020. [7 p.] DOI: 10.1109/ISCC47284.2019.8969724
• dc.identifier.doi http://dx.doi.org/10.1109/ISCC47284.2019.8969724
• dc.identifier.isbn 978-1-7281-2999-0
• dc.identifier.issn 2642-7389
• dc.identifier.uri http://hdl.handle.net/10230/45780
• dc.language.iso eng
• dc.publisher Institute of Electrical and Electronics Engineers (IEEE)
• dc.relation.ispartof Proceedings of the 2019 IEEE Symposium on Computers and Communications (ISCC); 2019 Jun 29-Jul 3; Barcelona, Spain. [New York]: IEEE; 2020.
• dc.rights © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. http://dx.doi.org/10.1109/ISCC47284.2019.8969724
• dc.rights.accessRights info:eu-repo/semantics/openAccess
• dc.subject.keyword IEEE 802.11
• dc.subject.keyword WLANs
• dc.subject.keyword Reinforcement Learning
• dc.subject.keyword Multi-Armed Bandits
• dc.title Decentralized AP selection using multi-armed bandits: opportunistic ε-greedy with stickiness
• dc.type info:eu-repo/semantics/conferenceObject
• dc.type.version info:eu-repo/semantics/acceptedVersion