Metraipolis › archive › dc_de81d71cd4d5
Quantifying the Relay-Coverage Trade-off in Mobile Multihop Flooding — arXiv:2610.39561
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.39561
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:27:12.651Z
- SHA-256 of the archived text
d75147b824028e047966946e636ce1e5e90115dba8d0572f0a448425b34a48f0- Stable URL of this page
https://metraipolis.com/documento/dc_de81d71cd4d5
How to cite
Quantifying the Relay-Coverage Trade-off in Mobile Multihop Flooding — arXiv:2610.39561 — arXiv (en), https://arxiv.org/abs/2610.39561 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_de81d71cd4d5 (Metraipolis archive dc_de81d71cd4d5, sha256 d75147b824028e047966946e636ce1e5e90115dba8d0572f0a448425b34a48f0)
BibTeX
@misc{dcde81d71cd4d5,
title = {Quantifying the Relay-Coverage Trade-off in Mobile Multihop Flooding — arXiv:2610.39561},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.39561},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_de81d71cd4d5; sha256 d75147b824028e047966946e636ce1e5e90115dba8d0572f0a448425b34a48f0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39561. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Network-wide flooding in mobile multihop networks selects relays from locally maintained topology information. Mobility makes this information outdated, leaving two basic responses: add redundant relays or refresh the topology and re-select relays more frequently. How these mechanisms trade reliability for overhead, however, is not well quantified. We quantify this trade-off on a public trace of 157 vehicles using Optimized Link State Routing version 2 (OLSRv2) and exact minimum-cost relay sets. Twofold coverage increases median relay-cover lifetime by only 2.3x, rather than about an order of magnitude as predicted by an independent-hazard model. The limitation is structural: 43.6 % of two-hop neighbours have only one possible relay, and newly appearing neighbours invalidate existing covers. Moreover, the delivery gain of a second relay falls from 0.061 to 0.016 when relay selection uses instantaneous link state, showing that redundancy mainly compensates for outdated topology information. Relay coverage and topology refresh therefore form a measurable redundancy-freshness trade-off rather than independent robustness mechanisms. In our trace, twofold coverage has lower overhead below about 100 bit/s of application flooding per node, whereas fresher topology information has lower overhead above it. This makes relay redundancy a load-dependent design choice rather than a fixed heuristic robustness setting. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Networking and Internet Architecture (cs.NI) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.39561 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-01T02:12:44.303Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).