Skip to Main content Skip to Navigation
Book sections

Resource allocation for multi-source multi-relay wireless networks: A multi-armed bandit approach

Abstract : In this paper, we consider the problem of link adaptation (rate allocation) of Orthogonal Multiple Access Multiple Relay Channel (OMAMRC) using the Multi-Armed Bandit (MAB) online learning framework. The cooperative system is composed of a transmission phase where sources transmit in a round robin manner, and a retransmission phase where a scheduled node sends redundancies. We assume that we have no knowledge of the Channel State Information (CSI) nor of the Channel Distributed Information (CDI). Accordingly, rate allocation must be learned online following a sequential learning algorithm. We adapt to one variant of the MAB framework algorithms, the Upper Confidence Bound (UCB) family, and specifically the UCB1 algorithm. The UCB1 algorithm achieves a logarithmic regret uniformly over time, without any preliminary knowledge about the reward distributions. Due to the exponential growth of the number of arms, following the multiple sources included in the rate allocation, the UCB1 algorithm features a complexity problem. Thus, we propose a sequential UCB1 (SUCB1) algorithm which solves the complexity issue, and outperforms the UCB1 algorithm.
Document type :
Book sections
Complete list of metadata
Contributor : Yezekael Hayel Connect in order to contact the contributor
Submitted on : Monday, January 3, 2022 - 11:34:20 AM
Last modification on : Sunday, January 9, 2022 - 3:00:51 AM




Ali Al Khansa, Raphael Visoz, Yezekael Hayel, Samson Lasaulce. Resource allocation for multi-source multi-relay wireless networks: A multi-armed bandit approach. Ubiquitous Networking, 12845, Springer International Publishing, pp.62-75, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86356-2_6⟩. ⟨hal-03507430⟩



Les métriques sont temporairement indisponibles