Faster broadcasting in unknown radio networks
From MaRDI portal
Publication:1603436
DOI10.1016/S0020-0190(00)00178-2zbMath0998.68222MaRDI QIDQ1603436
Andrzej Pelc, Gianluca De Marco
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
Improved lower bound for deterministic broadcasting in radio networks, Broadcasting in geometric radio networks, Collision-free path coloring with application to minimum-delay gathering in sensor networks, Deterministic broadcasting time with partial knowledge of the network., Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism, On adaptive deterministic gossiping in ad hoc radio networks., Radio communication in random graphs, Deterministic M2M multicast in radio networks, Time-Efficient Broadcast in Radio Networks, On Efficient Gossiping in Radio Networks, On Radio Broadcasting in Random Geometric Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Families of finite sets in which no set is covered by the union of \(r\) others
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Multiple Communication in Multihop Radio Networks
- Fast broadcasting and gossiping in radio networks
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- A perspective on multiaccess channels
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Lower bounds for the broadcast problem in mobile radio networks