Information gathering in ad-hoc radio networks
From MaRDI portal
Publication:2051793
DOI10.1016/j.ic.2021.104769MaRDI QIDQ2051793
Kevin P. Costello, Leszek Gąsieniec, Marek Chrobak
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.03636
68Qxx: Theory of computing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unbounded contention resolution in multiple-access channels
- A lower bound for radio broadcast
- Distributed broadcast in radio networks of unknown topology.
- An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
- Information gathering in ad-hoc radio networks with tree topology
- Faster information gathering in ad-hoc radio tree networks
- Contention resolution in a non-synchronized multiple access channel
- Distributed Broadcast in Unknown Radio Networks
- Fast broadcasting and gossiping in radio networks
- On Efficient Gossiping in Radio Networks
- Time-Efficient Broadcasting in Radio Networks
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- A randomized algorithm for gossiping in radio networks
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks
- Lower bounds for the broadcast problem in mobile radio networks
- Deterministic broadcasting in ad hoc radio networks
- Algorithm Theory - SWAT 2004
- Broadcasting algorithms in radio networks with unknown topology
- Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel
