Resource Allocation for Wireless Networks with Energy Harvesting Constraints Over Fading Channels
Bibliographic record
Abstract
This research work considers the utilize of energy harvesters, instead of conventional time-invariant energy sources, in wireless communication. For the purpose of exposition, we study the traditional two-hop communication system for delay limited (DL) and delay tolerant (DT) relaying networks over fading channels, in which the source node transmits with power drawn from energy harvesting (EH) sources and the relay transmits with conventional non-EH sources. We address the throughput maximization problem for the proposed system model for DL and DT cases. We find that the optimal power allocation algorithm for the single-hop communication system with EH constraints, namely, recursive geometric water-filling(RGWF), can be utilized as a guideline for the design of the two-hop system. We first introduce RGWF algorithm and we show the advantages of the geometric approach in eliminating the complexity of the Karush-Kuhn-Tucker (KKT) condition as well as providing a closed-form and exact solutions to the proposed problem. Based on the RGWF algorithm, we propose offline joint power allocation and transmission time scheduling schemes for DL relaying network and DT relaying network. We also propose efficient online resource allocation schemes for both relays’ cases. The performance of the proposed schemes is evaluated via simulation and the results demonstrate that a network with delay tolerant ability provides better performance in term of throughput.
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.000 | 0.002 |
| Scholarly communication | 0.000 | 0.000 |
| 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 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".