Performance Evaluation of the K-Means-LSTM Hybrid Model for Optimization of Spectrum Sensing in Cognitive Radio Networks
Bibliographic record
Abstract
CR (cognitive radio) technology has become an attractive field of research owing to the increased demand for spectrum resources.One of the duties of this technology is spectrum sensing which involves the opportunistic identification of vacant frequency bands for occupation by unlicensed users.Various traditional and state of art Machine-Learning algorithms have been proposed for sensing these vacant frequency bands.However, the common drawbacks of the proposed traditional techniques are degraded performance at low signal-to-noise ratios (SNR) as well as the requirement for prior information about the licensed user signal characteristics.More so, several Machine-Learning / Deep Learning techniques depend on simulated, supervised, and static (batch) spectrum datasets with synthesized features, which is not the case with real-world networks.Hence, this study aims to optimize realtime and dynamic spectrum sensing in wireless networks by establishing and evaluating a K-means-LSTM novice model (artifact) that is robust to low SNR and doesn't require a supervised spectrum dataset.Firstly, the unsupervised spectrum dataset was collected by an RTL-SDR dongle and labelled by the K-means algorithm in MATLAB.The labelled spectrum dataset was utilized for training the LSTM algorithm.The resultant LSTM model's performance was evaluated and compared to other commonly used spectrum detection models.Findings revealed that the proposed model established from the K-Means and LSTM algorithms yielded a Pd (detection probability) of 94%, Pfa (false-alarm probability) of 71%, and an accuracy of 97% at low SNR such as -20 dB, a performance which was superior to other models' performance.Using our proposed model, it is possible to optimize real-time spectrum sensing at low SNR without a prior supervised spectrum dataset.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".