Resource Allocation with Flexible Channel Cooperation in Cognitive Radio Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We study the resource allocation problem in an OFDMA-based cooperative cognitive radio network, where secondary users relay data for primary users in order to gain access to the spectrum. In light of user and channel diversity, we first propose FLEC, a novel flexible channel cooperation scheme. It allows secondary users to freely optimize the use of channels for transmitting primary data along with their own, in order to maximize performance. Further, we formulate a unifying optimization framework based on Nash bargaining solutions to fairly and efficiently allocate resources between primary and secondary networks, in both decentralized and centralized settings. We present an optimal distributed algorithm and a suboptimal centralized heuristic, and verify their effectiveness via realistic simulations. Under the same framework, we also study conventional identical channel cooperation as the performance benchmark, and propose algorithms to solve the corresponding optimization problems.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it