arXiv (All)
open access
A Gossiping Protocol for Sparse Ad-Hoc Radio Networks
We study the problem of gossiping (all-to-all information exchange) in ad-hoc radio networks. Such a network is represented by a strongly-connected directed graph with \(n\) vertices, whose topology is initially unknown to the protocol. In 2004, Gasieniec, Radzik, and Xin gave a \(\tilde O(n^{4/3})\
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Roteamento baseado em caminhos de maior grau de conectividade aplicado ao OLSR#946368
- Probing for Better Age of Information in Energy-Harvesting Random Access Networks#141448
- Note on the capacity and geometric realizability of combinatorial mobile sensor networks#612674
- Note on the capacity and geometric realizability of combinatorial mobile sensor networks#611197
- Partitions of Planar (Oriented) Graphs into a Connected Acyclic and an Independent Set#333910
Record · ID 1232780
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive