Information Gathering in Ad-Hoc Radio Networks
Marek Chrobak, Kevin Costello, Leszek Gasieniec

TL;DR
This paper presents a new deterministic protocol for efficient information gathering in ad-hoc radio networks, significantly reducing the communication complexity from quadratic to sub-quadratic time.
Contribution
It introduces an O(n^1.5*polylog(n)) deterministic protocol that improves upon previous bounds for rumor collection in ad-hoc radio networks.
Findings
Achieved a sub-quadratic time complexity for information gathering.
Provided a deterministic protocol applicable to unknown network topologies.
Abstract
In the ad-hoc radio network model, nodes communicate with their neighbors via radio signals, without knowing the topology of the graph. We study the information gathering problem, where each node has a piece of information called a rumor, and the objective is to transmit all rumors to a designated target node. We provide an O(n^1.5*polylog(n)) deteministic protocol for information gathering in ad-hoc radio networks, significantly improving the trivial bound of O(n^2).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
