Channel-aware distributed dynamic spectrum access via learning-based heterogeneous multi-channel auction
Bibliographic record
Abstract
We consider the design of a distributed online learning and access mechanism for dynamic spectrum access, where channel availability statistics are unknown to each secondary user (SU). Unlike existing distributed access policies, we explore the instantaneous channel gain of SUs' channels for multi-user multi-channel diversity gain. We consider an auction-based approach. For the primary channels with heterogeneous statistics, we apply the unit demand auction [1] to determine each SU's selection of a primary channel based on its instantaneous rate over each channel. We further propose a learning based unit demand (LBUD) auction, where each SU only bids for the M-best channels estimated by itself through distributed learning. The new mechanism not only reduces communication overhead, but also improves the throughput performance when the primary channels have dissimilar availability statistics. In addition, we show that the LBUD auction preserves the strong property of unit demand auction, i.e. it is dominant strategy incentive compatible. To improve the convergence speed of the iterative procedure of channel allocation in the auction, we also propose an adaptive price increment algorithm. Simulations show the effectiveness of our proposed auction mechanism in throughput gain by exploring instantaneous channel fade.
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
Direct model labels (unvalidated)
Per-model category and study-design labels from the labeling rounds. They are machine output, unvalidated, and the disagreement between models ships as data. No study design here is MEDLINE-validated yet.
| Model arm | Categories | Study design | Confidence |
|---|---|---|---|
| gemma | no category Domain: not available · Genre: Empirical About the Canadian research system: no · About a Canadian topic: no | Simulation or modeling | low |
| gpt | no category Domain: not available · Genre: Methods About the Canadian research system: no · About a Canadian topic: no | Simulation or modeling | low |
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| 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, unvalidatedLabeled directly by 2 models reading the full record.
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".