Improved lower bound for deterministic broadcasting in radio networks
From MaRDI portal
Publication:551181
DOI10.1016/j.tcs.2011.03.003zbMath1235.68041OpenAlexW2053327240MaRDI QIDQ551181
Shailesh Vaya, Carlos Fisch Brito
Publication date: 14 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.003
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Faster broadcasting in unknown radio networks
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- Optimal deterministic broadcasting in known topology radio networks
- The Wakeup Problem in Synchronous Broadcast Systems
- Distributed Broadcast in Unknown Radio Networks
- Fast broadcasting and gossiping in radio networks
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
- Lower bounds for the broadcast problem in mobile radio networks
- STACS 2004
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Structural Information and Communication Complexity
- The Wake‐Up Problem in MultiHop Radio Networks
- Broadcasting algorithms in radio networks with unknown topology
- A better wake-up in radio networks
- Automata, Languages and Programming
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Improved lower bound for deterministic broadcasting in radio networks
