Multiple armed bandits based opportunistic channel access with switching cost in block fading channel

In this paper we consider the channel access problem with switching cost under the block fading channel. We formulate the problem to multi-armed bandit problem with the goal of minimizing the outage rate and switching cost. To achieve this goal we propose the block based multi-armed bandit combining with repetition time diversity for channel access. The regret of the algorithm is proved logarithmic in time. The simulations show the algorithm outperforms traditional slot multi-armed bandit in regret and outage rate.