Dynamic Spectrum Access Using Stochastic Multi-User Bandits

Meghana Bande, Akshayaa Magesh, Venugopal V. Veeravalli

Research output: Contribution to journalArticlepeer-review

Abstract

A stochastic multi-user multi-armed bandit framework is used to develop algorithms for uncoordinated spectrum access. In contrast to prior work, it is assumed that rewards can be non-zero even under collisions, thus allowing for the number of users to be greater than the number of channels. The proposed algorithm consists of an estimation phase and an allocation phase. It is shown that if every user adopts the algorithm, the system wide regret is order-optimal of order O (log T) over a time-horizon of duration T. The regret guarantees hold for both the cases where the number of users is greater than or less than the number of channels. The algorithm is extended to the dynamic case where the number of users in the system evolves over time, and is shown to lead to sub-linear regret.

Original languageEnglish (US)
Article number9321391
Pages (from-to)953-956
Number of pages4
JournalIEEE Wireless Communications Letters
Volume10
Issue number5
DOIs
StatePublished - May 2021
Externally publishedYes

Keywords

  • Cognitive radio
  • multi-armed bandits
  • sub-linear regret
  • uncoordinated spectrum access

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Dynamic Spectrum Access Using Stochastic Multi-User Bandits'. Together they form a unique fingerprint.

Cite this