Optimal Resource Allocation for RF-Powered Underlay Cognitive Radio Networks With Ambient Backscatter Communication
Bibliographic record
Abstract
In this paper, we study radio frequency (RF)-powered underlay cognitive radio networks (CRNs) with power-domain non-orthogonal multiple access (NOMA). In these networks, by using the harvest-then-transmit (HTT) mode, secondary transmitters (STs) can use the harvested energy to simultaneously transmit data based on power-domain NOMA. However, in this mode, the throughput of the secondary system heavily depends not only on the harvested energy, but also on the stringent interference threshold imposed by the primary users. Furthermore, ambient backscatter communication (ABC) has been introduced as a promising technique which enables STs to transmit information by modulating and reflecting ambient RF signals. Therefore, it has the potentiality to be integrated into the RF-powered underlay CR-NOMA networks to improve the throughput of the secondary system. In these networks, each ST works on either the HTT mode or the ABC mode, but not simultaneously. In order to meet the interference constraint of the primary users, STs control their transmit power by finding the appropriate tradeoff between the HTT mode and the ABC mode. We formulate an optimization problem with the goal of achieving the maximum throughput by finding the optimal time resource allocation between the HTT mode and the ABC mode under the strict transmit power constraint at STs. Then the Lagrangian multiplier iterative algorithm is adopted to solve this optimization problem. Simulation results demonstrate that our proposed scheme can significantly improve the performance of the secondary system by comparing it with the other two baseline 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 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.000 | 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.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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 teacher head, 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".