Efficient online learning for opportunistic spectrum access

@article{Dai2011EfficientOL,
  title={Efficient online learning for opportunistic spectrum access},
  author={Wenhan Dai and Yi Gai and Bhaskar Krishnamachari},
  journal={2012 Proceedings IEEE INFOCOM},
  year={2011},
  pages={3086-3090}
}
The problem of opportunistic spectrum access in cognitive radio networks has been recently formulated as a non-Bayesian restless multi-armed bandit problem. In this problem, there are N arms (corresponding to channels) and one player (corresponding to a secondary user). The state of each arm evolves as a finite-state Markov chain with unknown parameters. At each time slot, the player can select K <; N arms to play and receives state-dependent rewards (corresponding to the throughput obtained… CONTINUE READING
1
Twitter Mention

Citations

Publications citing this paper.
SHOWING 1-9 OF 9 CITATIONS

Low-Complexity, Low-Regret Link Rate Selection in Rapidly-Varying Wireless Channels

  • IEEE INFOCOM 2018 - IEEE Conference on Computer Communications
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

Decentralized Learning for Multiplayer Multiarmed Bandits

  • IEEE Transactions on Information Theory
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND

Online learning for multi-channel opportunistic access over unknown Markovian channels

  • 2014 Eleventh Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)
  • 2014
VIEW 2 EXCERPTS
CITES BACKGROUND & RESULTS

QoS-Compliant Sequential Channel Sensing for Cognitive Radios

  • IEEE Journal on Selected Areas in Communications
  • 2014
VIEW 2 EXCERPTS
CITES BACKGROUND

Distributed Learning and Multiaccess of On-Off Channels

  • IEEE Journal of Selected Topics in Signal Processing
  • 2013
VIEW 1 EXCERPT
CITES BACKGROUND

Rate-percentile-optimal sequential channel sensing and probing in cognitive radio networks under spectrum uncertainty

  • 2013 IEEE International Conference on Sensing, Communications and Networking (SECON)
  • 2013
VIEW 2 EXCERPTS
CITES BACKGROUND

On a restless multi-armed bandit problem with non-identical arms

  • 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2011
VIEW 1 EXCERPT
CITES RESULTS

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Online learning in opportunistic spectrum access: A restless bandit approach

  • 2011 Proceedings IEEE INFOCOM
  • 2010
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Logarithmic weak regret of non-Bayesian restless multi-armed bandit

  • 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2011
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Efficient Online Learning for Opportunistic Spectrum Access

W. Dai, Y. Gai, B. Krishnamachari
  • Arxiv pre-print http://arxiv.org/abs/1109.1552, September 2011
  • 2011
VIEW 1 EXCERPT

The non-Bayesian restless multi-armed bandit: A case of near-logarithmic regret

  • 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2010
VIEW 2 EXCERPTS

The complexity of optimal queueing network control

  • Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory
  • 1994
VIEW 2 EXCERPTS