Improved lower bound for deterministic broadcasting in radio networks
From MaRDI portal
Recommendations
- STACS 2004
- Time efficient k-shot broadcasting in known topology radio networks
- Broadcasting in undirected ad hoc radio networks
- Broadcasting in undirected ad hoc radio networks
- Energy and Time Efficient Broadcasting in Known Topology Radio Networks
- Deterministic radio broadcasting at low cost
- Lower bounds for the broadcast problem in mobile radio networks
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks
- Fast broadcasting and gossiping in radio networks
- Deterministic radio broadcasting at low cost
Cites work
- A better wake-up in radio networks
- A lower bound for radio broadcast
- An \Omega(D\log (N/D)) Lower Bound for Broadcast in Radio Networks
- Asynchronous broadcast in radio networks
- Broadcasting algorithms in radio networks with unknown topology
- Broadcasting in undirected ad hoc radio networks
- Centralized deterministic broadcasting in undirected multi-hop radio networks
- Deterministic radio braodcasting
- Distributed broadcast in unknown radio networks
- Fast broadcasting and gossiping in radio networks
- Faster broadcasting in unknown radio networks
- Faster deterministic broadcasting in ad hoc radio networks
- scientific article; zbMATH DE number 910916 (Why is no real title available?)
- scientific article; zbMATH DE number 1445388 (Why is no real title available?)
- Improved schedule for radio broadcast
- Lower bounds for the broadcast problem in mobile radio networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- On the wake-up problem in radio networks
- Optimal deterministic broadcasting in known topology radio networks
- Probabilistic algorithms for the wakeup problem in single-hop radio networks
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- STACS 2004
- The wakeup problem in synchronous broadcast systems
- The Wake‐Up Problem in MultiHop Radio Networks
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
Cited in
(9)- A lower bound for radio broadcast
- Round complexity of leader election and gossiping in bidirectional radio networks
- Lower Bounds for Clear Transmissions in Radio Networks
- Lower Bounds for the Noisy Broadcast Problem
- scientific article; zbMATH DE number 7378397 (Why is no real title available?)
- Lower bounds for the broadcast problem in mobile radio networks
- Reliable broadcast in radio networks
- STACS 2004
- Radio Network Lower Bounds Made Easy
This page was built for publication: Improved lower bound for deterministic broadcasting in radio networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551181)