Bandit-based relay selection in cooperative networks over unknown stationary channels
Loading...
Access rights
openAccess
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2020-09
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
Proceedings of the 2020 IEEE 30th International Workshop on Machine Learning for Signal Processing, MLSP 2020, IEEE International Workshop on Machine Learning for Signal Processing
Abstract
In recent years, wireless node density has increased rapidly, as more base stations, users, and machines coexist. Exploiting this node density, cooperative relaying has been deployed to improve connectivity throughout the network. Such a configuration, however, often demands relay scheduling, which comes with increased channel estimation and signaling overheads. To reduce these overheads, in this paper, we propose low-complexity relay scheduling mechanisms with the aid of a multi-armed bandit (MAB) framework. More specifically, this MAB framework is used for relay scheduling, based only on observing the acknowledgements/negative-acknow-ledgements (ACK/NACK) of packet transmissions. Hence, a bandit-based opportunistic relay selection (BB - ORS) mechanism is developed, recovering eventually the performance of classical opportunistic relay selection (0RS) when channel state information (CSI) is available without requiring any CSI. In addition, a distributed implementation of BB - ORS is presented, herein called d - BB - ORS, where distributed timers are used at the relays for relay selection, thus reducing the signaling overhead significantly. BB - ORS is compared to optimal scheduling with full CSI and the negligible performance gap is compensated by the low-complexity low-overhead implementation, while it surpasses the performance of ORS with outdated CSI.Description
Keywords
Machine learning, Multi-armed bandits, Relay selection, Upper confidence bound policies
Other note
Citation
Nomikos, N, Talebi, S, Wichman, R & Charalambous, T 2020, Bandit-based relay selection in cooperative networks over unknown stationary channels . in Proceedings of the 2020 IEEE 30th International Workshop on Machine Learning for Signal Processing, MLSP 2020 ., 9231604, IEEE International Workshop on Machine Learning for Signal Processing, IEEE, IEEE International Workshop on Machine Learning for Signal Processing, Espoo, Finland, 21/09/2020 . https://doi.org/10.1109/MLSP49062.2020.9231604