Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3010089.3010094acmotherconferencesArticle/Chapter ViewAbstractPublication PagesbdawConference Proceedingsconference-collections
research-article

Two-Stage Decision Making Policy Using Bayesian Multi-armed Bandit Algorithm for Opportunistic Spectrum Access

Published: 10 November 2016 Publication History

Abstract

Recently, various paradigms, for instance, device-to-device (D2D) communications, LTE-unlicensed and cognitive radio are being envisioned to improve the average spectrum utilization as well as energy efficiency of the decentralized wireless communication networks. Such paradigms are based on an opportunistic spectrum access technique in which secondary (unlicensed) users (SUs) can use the temporarily unoccupied spectrum without any interference to the primary (licensed) users. SUs need decision making policies (DMPs) to identify optimum sub-bands and to minimize collisions with other SUs. Design of such DMP, especially for the decentralized networks, is a challenging problem where there is no communication among SUs and is the motivation behind the work presented in this paper. We have proposed a new two-stage DMP which consists of Bayesian Multiarmed Bandit algorithm for accurate estimation of sub-band statistics (i.e. probability of being vacant) independently at each SU and sub-band access scheme for orthogonalization among SUs. The simulation results indicate that the proposed DMP leads to 45% improvement in terms of average spectrum utilization compared to 36--39% in the existing DMPs. Furthermore, the number of collisions are 58.5 % lower in the proposed DMP making it energy efficient. We also show that sensing errors don't have significant effect on the performance of DMPs.

References

[1]
A. Asadi, Q. Wang, and V. Mancuso, "A Survey on Device-to-Device Communication in Cellular Networks," IEEE Communications Surveys & Tutorials, vol. 16, no. 4, pp. 1801--1819, Nov. 2014.
[2]
J. Palicot, H. Zhang and C. Moy, "On The Road towards Green Radio," URSI Radio Science Bulletin, no. 347, pp. 40--56, Dec. 2013.
[3]
A. Ananadkumar, N. Michael, K. Tang, and A. Swami, "Distributed algorithms for learning and cognitive medium access with logarithmic regret," IEEE J. Select. Areas Commun., vol. 29, no. 4, pp. 731--745, Apr. 2011.
[4]
S. J. Darak, Honggang Zhang, Jacques Palicot, Christophe Moy, "An efficient policy for D2D communications and energy harvesting in cognitive radios: Go Bayesian," 23rd European Signal Processing Conference (EUSIPCO), Nice, France, 2015.
[5]
K. Liu and Q. Zhao, "Distributed learning in multi-armed with multiple player, IEEE Trans. Signal Processing, vol. 58, no. 11, pp. 5665--5681, Nov. 2010.
[6]
M. Zandi, M. Dong, and A. Grami, "Decentralized spectrum learning and access adapting to primary channel availability distribution," in Proc. IEEE International workshop on Signal Processing Advances in Wireless Communications (SPAWC), Darmstadt, Germany, June 2013.
[7]
W. Jouini, D. Ernst, C. Moy and J. Palicot," Upper confidence bound algorithm for opportunistic spectrum access with sensing errors," Proc. International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, Osaka, Japan, June 2011.
[8]
P. Auer, N. Cesa-Bianchi, and P. Fisher, "Finite -time analysis of the multiarmed bandit problem," Machine Learning, vol. 47, no. 2, pp. 236--256, 2002.
[9]
E. Kaufmann, O. Cappé, and A. Garivier, "On the Efficiency of Bayesian Bandit Algorithms from a Frequentist Point of View," Neural Information Processing Systems (NIPS), Dec. 2011.
[10]
A. Garivier and O. Cappé, "The KL-ucb Algorithm for Bounded Stochastic Bandits and Beyond," Conference On Learning Theory (COLT), pp. 359--376, Budapest, Hungary, July 2011.
[11]
S. Agrawal and N. Goyal, "Further Optimal Regret Bounds for Thompson Sampling," in Proc. 16th International Conference on Artificial Intelligence and Statistics (AISTATS), Scottsdale, USA, April 2013.
[12]
S. J. Darak, S. Dhabhu, C. Moy, H. Zhang, J. Palicot and A. P. Vinod, "Low Complexity and Efficient Dynamic Spectrum Learning and Tunable Bandwidth Access for Heterogeneous Decentralized Cognitive Radio Networks," Digital Signal Processing (Elsevier), vol. 37, pp. 13--23, Feb. 2015.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
BDAW '16: Proceedings of the International Conference on Big Data and Advanced Wireless Technologies
November 2016
398 pages
ISBN:9781450347792
DOI:10.1145/3010089
© 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

In-Cooperation

  • ANR: Agence Nationale pour la Recherche
  • LABSTICC: Labsticc

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 November 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Decentralized network
  2. decision making policy
  3. dynamic spectrum learning and access
  4. multi-armed bandit
  5. opportunistic spectrum access

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

BDAW '16

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 85
    Total Downloads
  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media