A Reinforcement Learning Approach for the Multichannel Rendezvous Problem

by   Jen-Hung Wang, et al.
National Tsing Hua University

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 modeled 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 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, ..., 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, ..., N. Our experimental results show that the reinforcement learning approach is very effective and yields comparable ETTRs when comparing to various approximation policies in the literature.


page 1

page 2

page 3

page 4


Deep Reinforcement Learning for Dynamic Multichannel Access in Wireless Networks

We consider a dynamic multichannel access problem, where multiple correl...

A Reinforcement Learning Approach to Age of Information in Multi-User Networks with HARQ

Scheduling the transmission of time-sensitive information from a source ...

Active Exploration via Experiment Design in Markov Chains

A key challenge in science and engineering is to design experiments to l...

Optimal Neuron Selection: NK Echo State Networks for Reinforcement Learning

This paper introduces the NK Echo State Network. The problem of learning...

Please sign up or login with your details

Forgot password? Click here to reset