A Data-Driven Approach to Radio Frequency Signal Level Forecasting Using Machine Learning Algorithms
Bibliographic record
Abstract
Advances in wireless technology allow autonomous wireless network deployments. Radiofrequency (RF). To integrate into networks, transmitters and receivers need to be aware of their environment and modify their broadcasting and receiving capacities. Because it can learn, evaluate, and forecast RF signals and environmental factors, machine learning is widely used. This dissertation tackles some of the challenges with RF learning approaches. Jamming and spoofing may render most machine learning algorithms useless when attackers are present. Adversarial learning is used to detect illegal RF spectrum use to allow learning in such circumstances. First, the researcher illustrates$\mathbf{R F}$machine learning. Using separate cellular models, they build and deploy three recurrent neural networks for RF transmitter fingerprinting. Then safeguard dynamic spectrum access network broadcasts, which may be vulnerable to PUE assaults. A generative adversarial network (GAN) based solution to primary user emulation (PUE) attacks is proposed. Finally, recurrent neural network models predict principal users' DSA network activities so secondary users may exploit the shared spectrum opportunistically. Researchers use the specified learning models on testbeds utilizing Universal Software Radio Peripherals (USRPs) and Software Defined Radios (SDRs). Substantial improvements in the accuracy of RF transmitter characterization demonstrate the practical deployment capabilities of our models.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".