Information dissemination in unknown radio networks with large labels
From MaRDI portal
Publication:391755
DOI10.1016/j.tcs.2013.08.009zbMath1358.68027arXiv1108.5904MaRDI QIDQ391755
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.5904
acknowledged broadcasting and gossiping; polynomially large labels; selecting-colliding families; unknown radio networks
Related Items
Deterministic Communication in Radio Networks, Token traversal in ad hoc wireless networks via implicit carrier sensing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acknowledged broadcasting and gossiping in ad hoc radio networks
- Acknowledged broadcasting in ad hoc radio networks
- Families of finite sets in which no set is covered by the union of \(r\) others
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
- Faster broadcasting in unknown radio networks
- On adaptive deterministic gossiping in ad hoc radio networks.
- Optimal deterministic broadcasting in known topology radio networks
- Distributed Broadcast in Unknown Radio Networks
- Fast broadcasting and gossiping in radio networks
- On Efficient Gossiping in Radio Networks
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
- Lower bounds for the broadcast problem in mobile radio networks
- Deterministic broadcasting in ad hoc radio networks
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Algorithm Theory - SWAT 2004
- Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
- Broadcasting algorithms in radio networks with unknown topology
