Multi-user small base station association via contextual combinatorial volatile bandits

Simple item page
buir.contributor.authorQureshi, Muhammad Anjum
buir.contributor.authorNika, Andi
buir.contributor.authorTekin, Cem
buir.contributor.orcidQureshi, Muhammad Anjum|0000-0001-6426-1267
buir.contributor.orcidNika, Andi|0000-0002-7453-4975
buir.contributor.orcidTekin, Cem|0000-0003-4361-4021
dc.citation.epage3740en_US
dc.citation.issueNumber6en_US
dc.citation.spage3726en_US
dc.citation.volumeNumber69en_US
dc.contributor.authorQureshi, Muhammad Anjum
dc.contributor.authorNika, Andi
dc.contributor.authorTekin, Cem
dc.date.accessioned2022-01-28T06:39:56Z
dc.date.available2022-01-28T06:39:56Z
dc.date.issued2021-03-09
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractWe propose an efficient mobility management solution to the problem of assigning small base stations (SBSs) to multiple mobile data users in a heterogeneous setting. We formalize the problem using a novel sequential decision-making model named contextual combinatorial volatile multi-armed bandits (MABs), in which each association is considered as an arm, volatility of an arm is imposed by the dynamic arrivals of the users, and context is the additional information linked with the user and the SBS such as user/SBS distance and the transmission frequency. As the next-generation communications are envisioned to take place over highly dynamic links such as the millimeter wave (mmWave) frequency band, we consider the association problem over an unknown channel distribution with a limited feedback in the form of acknowledgments and under the absence of channel state information (CSI). As the links are unknown and dynamically varying, the assignment problem cannot be solved offline. Thus, we propose an online algorithm which is able to solve the user-SBS association problem in a multi-user and time-varying environment, where the number of users dynamically varies over time. Our algorithm strikes the balance between exploration and exploitation and achieves sublinear in time regret with an optimal dependence on the problem structure and the dynamics of user arrivals and departures. In addition, we demonstrate via numerical experiments that our algorithm achieves significant performance gains compared to several benchmark algorithms.en_US
dc.description.provenanceSubmitted by Evrim Ergin (eergin@bilkent.edu.tr) on 2022-01-28T06:39:56Z No. of bitstreams: 1 Multi-user_small_base_station_association_via_contextual_combinatorial_volatile_bandits.pdf: 2351169 bytes, checksum: 0346a0fdbaf973d149e62ea10187d212 (MD5)en
dc.description.provenanceMade available in DSpace on 2022-01-28T06:39:56Z (GMT). No. of bitstreams: 1 Multi-user_small_base_station_association_via_contextual_combinatorial_volatile_bandits.pdf: 2351169 bytes, checksum: 0346a0fdbaf973d149e62ea10187d212 (MD5) Previous issue date: 2021-03-09en
dc.identifier.doi10.1109/TCOMM.2021.3064939en_US
dc.identifier.eissn1558-0857
dc.identifier.issn0090-6778
dc.identifier.urihttp://hdl.handle.net/11693/76853
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttps://doi.org/10.1109/TCOMM.2021.3064939en_US
dc.source.titleIEEE Transactions on Communicationsen_US
dc.subjectSmall base stationsen_US
dc.subjectDynamic user associationen_US
dc.subjectContextual banditsen_US
dc.subjectVolatile banditsen_US
dc.titleMulti-user small base station association via contextual combinatorial volatile banditsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Multi-user_small_base_station_association_via_contextual_combinatorial_volatile_bandits.pdf
Size:
2.24 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering