Improved lower bound for deterministic broadcasting in radio networks

DOI10.1016/J.TCS.2011.03.003MaRDI QIDQ551181zbMATH OpenOpenAlexFDO

Authors Carlos Fisch Brito, Shailesh Vaya

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

zbMATH Keywords

broadcastdeterministic algorithmsradio networkssimulations

Mathematics Subject Classification ID

Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

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
• scientific article; zbMATH DE number 1688360
• 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
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Automata, Languages and Programming
• Broadcasting algorithms in radio networks with unknown topology
• Broadcasting in undirected ad hoc radio networks
• Distributed broadcast in unknown radio networks
• Fast broadcasting and gossiping in radio networks
• Faster broadcasting in unknown radio networks
• scientific article; zbMATH DE number 1670865 (Why is no real title available?)
• scientific article; zbMATH DE number 1962806 (Why is no real title available?)
• scientific article; zbMATH DE number 1979528 (Why is no real title available?)
• 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
• Optimal deterministic broadcasting in known topology radio networks
• Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
• STACS 2004
• Structural Information and Communication Complexity
• 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)