Throughput-Optimal Broadcast for Time-Varying Directed Acyclic Wireless Multi-Hop Networks With Energy Harvesting Constraints
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
In wireless multi-hop networks, a fundamental problem is to disseminate continuous data traffic from a source node to all other network nodes, which is known as the broadcast problem. Such a problem becomes even more complicated in wireless multi-hop networks with energy-harvesting capabilities at nodes when facing the interaction between stochastics of traffic arrivals at the source and randomness of energy-harvesting process at nodes. In such networks, the energy consumable at a node cannot exceed the amount of the energy harvested at the node. In this paper, we investigate the throughput-optimal broadcast problem in time-varying directed acyclic wireless multi-hop networks with such energy harvesting constraints. The topologies of such networks change dynamically with time while satisfying the directed acyclic property and the energy arrival time and harvested amount at a node are random, which causes the consumable energy in each time slot to fluctuate with time. Existing throughput-optimal broadcast algorithms did not consider such energy-harvesting constraints in their designs and therefore their throughput-optimal properties do not hold anymore in such a network. In this paper, we characterize the energy-harvesting uncertainties at nodes by using time-varying per-slot-based supportable transmission rates of wireless links. We consider the time-varying property of supportable link transmission rates caused by energy-harvesting dynamics in the per-slot transmission scheduling and propose an online max-weight broadcast algorithm. We derive a tight upper bound of broadcast capacity of the wireless networks under study in this paper and further prove that our proposed algorithm is throughput-optimal. We evaluate the throughput and latency performance of the proposed algorithm by simulations and the simulation results affirm our theoretical analysis.
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.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.001 | 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 it