Distributed Learning-Based Multi-Band Multi-User Cooperative Sensing in Cognitive Radio Networks
Bibliographic record
Abstract
Multi-band cooperative spectrum sensing can provide access to a wide range of spectrum in cognitive radio networks (CRNs). The design of multi-band spectrum sensing is very challenging mainly due to scheduling of secondary users (SUs) to sense a subset of channels. In this paper, we propose a distributed learning-based multi-band multi-user cooperative spectrum sensing (M2CSS) scheme to select most appropriate SUs to sense channels. The proposed scheme allows SUs to sense multiple channels, and consists of two stages: 1) leader selection for each channel, and 2) selection of corresponding cooperative SUs to sense these channels. We formulate an optimization problem to select leaders that can effectively communicate with other SUs subject to the constraint that each SU can act as a leader for only one channel, and there will be only one leader for each channel. We then formulate another optimization problem to select corresponding cooperative SUs for each channel. After this stage, selected cooperative SUs sense channels, and use consensus learning to determine the availability of channels in a distributed manner. Simulation results show that the proposed M2CSS scheme can enhance detection performance, avoid the choice of redundant cooperative SUs, owning similar sensed information, and provide fair energy consumption for all channels compared to the existing schemes.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| 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.000 | 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".