Centralized asynchronous broadcast in radio networks
Publication:2383598
DOI10.1016/J.TCS.2007.03.057zbMath1124.68004OpenAlexW1998047754MaRDI QIDQ2383598
Mariusz A. Rokicki, Bogdan S. Chlebus
Publication date: 19 September 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.057
completenesslower boundradio networkcentralized algorithmasynchronycomplexity classbroadcast protocol
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Network protocols (68M12)
Related Items (5)
Cites Work
- 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
- Distributed broadcast in radio networks of unknown topology.
- Domino-tiling games
- Fault-Tolerant Broadcasting in Radio Networks
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Centralized broadcast in multihop radio networks
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
- Deterministic broadcasting in ad hoc radio networks
- Faster communication in known topology radio networks
- Computation in Noisy Radio Networks
- Broadcasting algorithms in radio networks with unknown topology
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Centralized asynchronous broadcast in radio networks