A Reinforcement Learning Approach For The Multichannel Rendezvous Problem

Abstract

In this paper, we consider the multichannel rendezvous problem in cognitive radio networks (CRNs) where the probability that two users hopping on the same channel have a successful rendezvous is a function of channel states. The channel states are modelled by two-state Markov chains that have a good state and a bad state. These channel states are not observable by the users. For such a multichannel rendezvous problem, we are interested in finding the optimal policy to minimize the expected time-to-rendezvous (ETTR) among the class of \{\em dynamic blind rendezvous policies\}, i.e., at the \(t^\{th\}\) time slot each user selects channel \(i\) independently with probability \(p_i(t)\), \(i=1,2, \ldots, N\). By formulating such a multichannel rendezvous problem as an adversarial bandit problem, we propose using a reinforcement learning approach to learn the channel selection probabilities \(p_i(t)\), \(i=1,2, \ldots, N\). Our experimental results show that the reinforcement learning appr

Stats

• citations8
• S2 citations—
• github stars0
• HF likes0
• heat score7.16
• arxiv keywang2019a

Related papers

• A Deep Actor-critic Reinforcement Learning Framework For Dynamic Multichannel Access (2019)15.22
• Dynamic Channel Access Via Meta-reinforcement Learning (2021)5.84
• Deep Reinforcement Learning For Distributed And Uncoordinated Cognitive Radios Resource Allocation (2022)0.00
• Deep Reinforcement Learning For Distributed Uncoordinated Cognitive Radios Resource Allocation (2019)0.00
• Cognitive Radio Network Throughput Maximization With Deep Reinforcement Learning (2020)4.52
• Structured Reinforcement Learning For Media Streaming At The Wireless Edge (2024)3.58
• Offline Reinforcement Learning For Wireless Network Optimization With Mixture Datasets (2023)9.59
• Cooperative Multi-agent Reinforcement Learning For Low-level Wireless Communication (2018)0.00