5G Cognitive Radio Networks Using Reliable Hybrid Deep Learning Based on Spectrum Sensing
Post-publication record
OpenAlex flags this work as retracted, but it carries no matching Retraction Watch record in this frame.
Bibliographic record
Abstract
Spectrum sensing is critical in allowing the cognitive radio network, which will be used in the next generation of wireless communication systems. Several approaches, including cyclostationary process, energy detectors, and matching filters, have been suggested over the course of several decades. These strategies, on the other hand, have a number of disadvantages. Energy detectors have poor performance when the signal‐to‐noise ratio (SNR) is changing, cyclostationary detectors are very complicated, and matching filters need previous knowledge of the main user (PU) signals. Additionally, these strategies rely on thresholds under particular signal‐noise model assumptions in addition to the thresholds, and as a result, the detection effectiveness of these techniques is wholly dependent on the accuracy of the sensor. In this way, one of the most sought‐after difficulties among wireless researchers continues to be the development of a reliable and intelligent spectrum sensing technology. In contrast, multilayer learning models are not ideal for dealing with time‐series data because of the large computational cost and high rate of misclassification associated with them. For this reason, the authors propose a hybrid combination of long short‐term memory (LSTM) and extreme learning machines (ELM) to learn temporal features from spectral data and to exploit other environmental activity statistics such as energy, distance, and duty cycle duration for the improvement of sensing performance. The suggested system has been tested on a Raspberry Pi Model B+ and the GNU‐radio experimental testbed, among other platforms.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".