Optimal fault‐tolerant broadcasting in wireless mesh networks
Bibliographic record
Abstract
Abstract Wireless mesh networks (WMNs) is an emerging communication paradigm to enable resilient, cost‐efficient and reliable services for the future‐generation wireless networks. In this paper, we study the broadcasting (one‐to‐all communication) in WMNs with known topology, i.e. where for each primitive the schedule of transmissions is pre‐computed based on full knowledge about the size and the topology of the network. We show that broadcasting can complete in D + O(log n ) time units in the WMN with size n and diameter D . Moreover, we also propose an optimal O( D )‐time deterministic energy efficient broadcasting scheduling, under which each node in the WMN is only allowed to transmit at most once. Furthermore, we explore the fault‐tolerant broadcasting in the WMN. We show an O( n )‐time deterministic broadcasting schedule with large number of link failures. This is an optimal schedule in the sense that there exists a network topology in which the broadcasting cannot complete in less than Ω( n ) units of time. Copyright © 2009 John Wiley & Sons, Ltd.
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.001 | 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.003 | 0.002 |
| 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".