Spectrum Prediction for Mobile Internet of Things Based on a DB-LSTM Algorithm
Bibliographic record
Abstract
The fast advancement of 5G mobile communications, artificial intelligence and big data technology has driven the development of the Internet of Things (IoT), while at the same time putting great pressure on existing spectrum resources. Spectrum prediction, as a technology to improve spectrum utilization, faces problems such as poor modeling and ineffective use of historical spectrum sensing data. In addition, the different transmission environments and geographical locations of IoT devices lead to complex and variable wireless mobile channels, which are susceptible to interference from noise and external environments. They lead to inaccurate spectrum sensing results, which can affect the accuracy of spectrum prediction. Therefore, employing long short term memory (LSTM) and bidirectional LSTM (Bi-LSTM) neural networks proposes a dual branch neural network mobile spectrum prediction model (DB-LSTM). The historical sensing data under variable channels are fully utilized to extract forward and backward temporal feature information to overcome the effect of variable environment. First, spectrum sensing using a residual network (ResNet) module and convolutional neural network (CNN) is proposed to extract intrinsic features of signal data and improve the accuracy of spectrum sensing results. This data is employed to train the DB-LSTM model and make for spectrum prediction. TheM/G/1 queuing-based model underN-Nakagami channel is used to simulate and generate the signal data set under 2FSK and QPSK modulation methods. The proposed DB-LSTM method is evaluated from three perspectives of accuracy, Error and mean square error (MSE). The results obtained show that compared to the Temporal Convolutional Networks (TCN), Transformer, and Bidirectional Encoder Representations from Transformer (BERT) models, the spectrum prediction accuracy is improved by 2%, 10%, and 1% respectively, the Error is reduced by 29%, 53%, and 4%, respectively, and the MSE is reduced by 23%, 65%, and 4%, respectively.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".