DeepAir: Enabling Data-Driven Dynamic Spectrum Sharing via Scalable Forecasting
Bibliographic record
Abstract
The rapid uptake of wireless technologies over the past decade has resulted in an increasing pressure on the limited radio spectrum resources. To improve the efficiency of current allocation policies, regulators in many jurisdictions are considering dynamic spectrum sharing. The success, however, of an optimized system hinges on the ability to sense, characterize, and forecast spectrum usage behaviour. Since traditional methods prove unable to scale to a wide range of channels, we propose DeepAir, a robust and scalable model that is capable of learning and predicting complex temporal and spectral dependencies in multivariate spectrum data. Specifically, we design a Sequence-to-Sequence model that employs an encoder-decoder architecture with two Deep Temporal Convolutional Networks. Using a test set consisting of approximately 900 channels in the Land Mobile Radio bands, we obtain a median RMSE and median MAE of 6.51 and 5.15, respectively. We then apply transfer learning to demonstrate the effectiveness of this model in forecasting patterns from any sensor, regardless of the band, sensitivity, and geographical location. Furthermore, the model exhibits no performance degradation up to three years after training for both short and long forecast horizons. Finally, we use DeepAir to quantify spectrum availability to enhance existing spectrum sharing capabilities.
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.002 |
| 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.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".