NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
A Machine Learning Based Scheme for Dynamic Spectrum Access
Published
Author(s)
Anirudha Sahoo
Abstract
In this paper, we present a machine learning (ML) based dynamic spectrum access (DSA) scheme which can be used in a system in which primary user (PU) spectrum occupancy can be represented as a sequence of busy (on) and idle (off) periods. We use real world data collected from LTE systems at two locations for our study. We experiment with different feed forward artifical neural network (ANN) architectures to choose from for our DSA scheme. A simple perceptron based ANN architecture was determined to provide good performance. We compare performance of our ML based DSA scheme with a traditional DSA scheme based on analytical model that uses survival analysis. Our results show that our ML based scheme outperforms the survival analysis based scheme in terms of utilization of idle periods. In terms of probability of interference to the PU, our scheme is better in some configurations and slightly worse in some other configurations.
Proceedings Title
2021 IEEE Wireless Communications and Networking Conference (WCNC)
Sahoo, A.
(2021),
A Machine Learning Based Scheme for Dynamic Spectrum Access, 2021 IEEE Wireless Communications and Networking Conference (WCNC), Nanjing, , [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=931081
(Accessed October 15, 2025)