Faster broadcasting in unknown radio networks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1670865 (Why is no real title available?)
- scientific article; zbMATH DE number 4043100 (Why is no real title available?)
- scientific article; zbMATH DE number 823957 (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?)
- A lower bound for radio broadcast
- A perspective on multiaccess channels
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- Families of finite sets in which no set is covered by the union of \(r\) others
- Fast broadcasting and gossiping in radio networks
- Lower bounds for the broadcast problem in mobile radio networks
- Multiple Communication in Multihop Radio Networks
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
Cited in
(39)- Broadcasting algorithms in radio networks with unknown topology
- Fast broadcasting and gossiping in radio networks
- Faster communication in known topology radio networks
- Optimal deterministic broadcasting in known topology radio networks
- Information dissemination in unknown radio networks with large labels
- Deterministic communication in radio networks
- On Radio Broadcasting in Random Geometric Graphs
- Asynchronous broadcasting with bivalent beeps
- Improved lower bound for deterministic broadcasting in radio networks
- Distributed broadcast in unknown radio networks
- Fast message dissemination in random geometric networks
- Deterministic M2M multicast in radio networks
- Deterministic broadcasting time with partial knowledge of the network.
- scientific article; zbMATH DE number 7378397 (Why is no real title available?)
- On Efficient Gossiping in Radio Networks
- Faster deterministic communication in radio networks
- scientific article; zbMATH DE number 2080261 (Why is no real title available?)
- Deterministic blind radio networks
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- scientific article; zbMATH DE number 1445388 (Why is no real title available?)
- scientific article; zbMATH DE number 1688360 (Why is no real title available?)
- A Faster Distributed Radio Broadcast Primitive
- Time-efficient broadcast in radio networks
- Collision-free path coloring with application to minimum-delay gathering in sensor networks
- Radio communication in random graphs
- On the effect of the deployment setting on broadcasting in Euclidean radio networks
- Deterministic broadcasting in ad hoc radio networks
- Round complexity of leader election and gossiping in bidirectional radio networks
- The impact of information on broadcasting time in linear radio networks.
- scientific article; zbMATH DE number 1405786 (Why is no real title available?)
- On adaptive deterministic gossiping in ad hoc radio networks.
- Energy-efficient broadcasting in ad hoc wireless networks
- scientific article; zbMATH DE number 1696532 (Why is no real title available?)
- Broadcasting in geometric radio networks
- Fast Radio Broadcasting with Advice
- Radio Network Lower Bounds Made Easy
- Messy broadcasting - decentralized broadcast schemes with limited knowledge
- Distributed broadcast in radio networks of unknown topology.
- Fast radio broadcasting with advice
This page was built for publication: Faster broadcasting in unknown radio networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603436)
