RF-based Energy Harvesting in Decode-and-Forward Relaying Systems: Ergodic and Outage Capacities
Bibliographic record
Abstract
Radio-frequency energy harvesting constitutes an effective way to prolong the lifetime of wireless networks, wean communication devices off the battery and power line, benefit the energy saving and lower the carbon footprint of wireless communications. In this paper, an interference aided energy harvesting scheme is proposed for cooperative relaying systems, where energy-constrained relays harvest energy from the received information signal and co-channel interference signals, and then use that harvested energy to forward the correctly decoded signal to the destination. The time-switching scheme (TS), in which the receiver switches between decoding information and harvesting energy, as well as the power-splitting scheme (PS), where a portion of the received power is used for energy harvesting and the remaining power is utilized for information processing, are adopted separately. Applying the proposed energy harvesting approach to a decode-and-forward relaying system with the three-terminal model, the analytical expressions of the ergodic capacity and the outage capacity are derived, and the corresponding achievable throughputs are determined. Comparative results are provided and show that PS is superior to TS at high signal-to-noise ratio (SNR) in terms of throughput, while at low SNR, TS outperforms PS. Furthermore, considering different interference power distributions with equal aggregate interference power at the relay, the corresponding system capacity relationship, i.e., the ordering of capacities, is obtained.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| 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 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".