Optimal power allocation for relay‐based cooperative communication systems with energy harvesting
Bibliographic record
Abstract
Abstract In this paper, the problem of throughput maximization in cooperative communication systems is considered, in which the nodes use energy harvesters instead of conventional energy sources. The 3‐node Gaussian relay channel with decode‐and‐forward relaying scheme is investigated, where the source and relay harvest energy from the environment. In this work, optimal power levels for 2 cases are obtained. First, a deterministic model is considered, where the noncausal (offline) knowledge of the harvested energy and channel states is available. The problem is shown to be a convex optimization problem, where the solutions to which are derived using convex optimization techniques. Then, the online case is investigated, in which only the casual knowledge of the harvested energy and channel states are used. In the online setting, the problem is formulated as a Markov decision process. The performance of the system in both offline and online cases, along with a few suboptimal schemes introduced in the literature, is evaluated using computer simulations.
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.000 |
| Science and technology studies | 0.003 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 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".