skip to main content
10.1145/3288599.3299727acmconferencesArticle/Chapter ViewAbstractPublication PagesicdcnConference Proceedingsconference-collections
short-paper

Channel selection in dynamic networks of unknown size

Published:04 January 2019Publication History

ABSTRACT

The dynamic spectrum access (DSA) algorithms aim to maximize network throughput by ensuring orthogonal channel allocation among secondary users (SUs) in cognitive radio network. Most of the existing DSA algorithms need prior knowledge of the number of active SUs and thus may not be suitable for battery operated resource constrained SU terminals in the infrastructure-less cognitive radio terminals. Another drawback of these algorithms is that they assume the static network with a fixed number of SUs in the network throughout the horizon and their extension for dynamic network in which SUs may enter or exit the network anytime is challenging. Thus, our goal is to design the DSA algorithms for the dynamic networks of unknown size.

References

  1. J. Rosenski, O. Shami and L. Szlak, "Multi-Player Bandits âĂŞ a Musical Chairs Approach," in Proceedings of the 33rd International Conference on Machine Learning (ICML), pp. 1--9, New York, USA, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. H. Joshi, R. Kumar, A. Yadav and S. J. Darak, "Distributed Algorithm for Dynamic Spectrum Access in Infrastructure-less Cognitive Radio Network, "Proc. of IEEE Wireless Communications and Networking Conference (WCNC), Barcelona, Spain, 2018.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    ICDCN '19: Proceedings of the 20th International Conference on Distributed Computing and Networking
    January 2019
    535 pages
    ISBN:9781450360944
    DOI:10.1145/3288599
    • General Chairs:
    • R. C. Hansdah,
    • Dilip Krishnaswamy,
    • Nitin Vaidya

    Copyright © 2019 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 4 January 2019

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • short-paper
  • Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader