Cited by 432Cognitive Radio Networks and Spectrum SensingWireless Signal Modulation ClassificationEnergy Harvesting in Wireless Networks

Machine Learning Techniques for Cooperative Spectrum Sensing in Cognitive Radio Networks

Thilina, Karaputugala Madushan, Kae Won Choi, Saquib, Nazmus, Hossain, Ekram·2013·IEEE Journal on Selected Areas in Communications

Abstract

We propose novel cooperative spectrum sensing (CSS) algorithms for cognitive radio (CR) networks based on machine learning techniques which are used for pattern classification. In this regard, unsupervised (e.g., K-means clustering and Gaussian mixture model (GMM)) and supervised (e.g., support vector machine (SVM) and weighted K-nearest-neighbor (KNN)) learning-based classification techniques are implemented for CSS. For a radio channel, the vector of the energy levels estimated at CR devices is treated as a feature vector and fed into a classifier to decide whether the channel is available or not. The classifier categorizes each feature vector into either of the two classes, namely, the "channel available class" and the "channel unavailable class". Prior to the online classification, the classifier needs to go through a training phase. For classification, the K-means clustering algorithm partitions the training feature vectors into K clusters, where each cluster corresponds to a combined state of primary users (PUs) and then the classifier determines the class the test energy vector belongs to. The GMM obtains a mixture of Gaussian density functions that well describes the training feature vectors. In the case of the SVM, the support vectors (i.e., a subset of training vectors which fully specify the decision function) are obtained by maximizing the margin between the separating hyperplane and the training feature vectors. Furthermore, the weighted KNN classification technique is proposed for CSS for which the weight of each feature vector is calculated by evaluating the area under the receiver operating characteristic (ROC) curve of that feature vector. The performance of each classification technique is quantified in terms of the average training time, the sample classification delay, and the ROC curve. Our comparative results clearly reveal that the proposed algorithms outperform the existing state-of-the-art CSS techniques.

Integrity signals

Registry

Crossref · 10.1109/jsac.2013.131120

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Thilina, K. M., Choi, K. W., Saquib, N., & Hossain, E.
Affiliations
  • University of Manitoba (CA)
  • Seoul National University of Science and Technology (KR)
Venue
IEEE Journal on Selected Areas in Communications
Published
2013-11
Volume
31
Issue
11
Pages
2209-2221
ISSN
0733-8716 (ISSN-L)
OpenAlex
W2065424480
Cited by
432
References
2
Citations by year
2026: 17 · 2025: 21 · 2024: 21 · 2023: 46 · 2022: 42 · 2021: 70 · 2020: 50 · 2019: 58 · 2018: 38 · 2017: 24 · 2016: 23 · 2015: 11 · 2014: 11
FWCI
19.73
Type
journal article
Language
en
Open access
closed
Locations
IEEE Journal on Selected Areas in Communications (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cognitive Radio Networks and Spectrum Sensing
  • Physical Sciences › Computer Science › Artificial Intelligence › Wireless Signal Modulation Classification
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Energy Harvesting in Wireless Networks
Keywords
cooperative spectrum sensing, cognitive radio networks, energy detection, K-means clustering, Gaussian mixture model, support vector machine, weighted k-nearest neighbors, feature vector classification, primary user detection, ROC curve

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review