Throughput-Optimal Dynamic Broadcast for SINR-Based Multi-Hop Wireless Networks With Time-Varying Topology
Bibliographic record
Abstract
The problem of disseminating continuous data flow from a given source node to all other network nodes is known as the dynamic broadcast problem, which is also a fundamental problem in multi-hop wireless networks (e.g., wireless ad hoc and sensor networks). Due to link unreliability and node mobility, the topology of a network typically changes with time. Little work has been conducted to address the dynamic broadcast problem in time-varying wireless multi-hop networks, especially under the popular Signal-to-Interference-plus-Noise-Ratio (SINR) interference model. In this paper, we study the dynamic broadcast problem in SINR-based time-varying directed acyclic multi-hop wireless networks formed by point-to-point wireless links. We consider the SINR-based link transmission rate model involved in the slot-based link scheduling. We first prove a tight upper bound for the broadcast capacity of the multi-hop wireless networks under study. We then propose an online max-weight Throughput-Optimal Dynamic Broadcast algorithm (TODB) which performs link weight allocation, link scheduling, and data forwarding for each time slot according to the current network connectivity and data reception rates of nodes. We derive the throughput-optimality of the TODB algorithm by proving that the broadcast throughput of TODB can achieve the aforementioned upper bound of the broadcast capacity. We evaluate the performance of TODB in terms of throughput and latency via simulations and the results validate its effectiveness.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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".