On Radio Broadcasting in Random Geometric Graphs
From MaRDI portal
Publication:3540232
DOI10.1007/978-3-540-87779-0_15zbMATH Open1161.68307OpenAlexW1756960469MaRDI QIDQ3540232FDOQ3540232
Leszek Gąsieniec, Robert Elsässer, Thomas Sauerwald
Publication date: 20 November 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87779-0_15
Recommendations
- Radio communication in random graphs
- Broadcasting in geometric radio networks
- Broadcasting in random graphs
- Broadcasting in random graphs
- scientific article; zbMATH DE number 2089989
- scientific article; zbMATH DE number 6297797
- Broadcasting on Random Directed Acyclic Graphs
- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- Random Geometric Graphs
- Optimal deterministic broadcasting in known topology radio networks
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A guided tour of Chernoff bounds
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- Faster Centralized Communication in Radio Networks
- Broadcasting algorithms in radio networks with unknown topology
- Broadcasting in undirected ad hoc radio networks
- Energy efficient randomised communication in unknown AdHoc networks
- Faster communication in known topology radio networks
- Centralized broadcast in multihop radio networks
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
- The bin-covering technique for thresholding random geometric graph properties
- Critical Density Thresholds in Distributed Wireless Networks
- Distributed broadcast in radio networks of unknown topology.
- Faster broadcasting in unknown radio networks
- Fast broadcasting and gossiping in radio networks
- Lower bounds for the broadcast problem in mobile radio networks
- Deterministic broadcasting in ad hoc radio networks
- Broadcasting in geometric radio networks
- Deterministic communication in radio networks with large labels
- Broadcasting in udg radio networks with unknown topology
- Radio communication in random graphs
- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks
- An improved algorithm for radio broadcast
Cited In (8)
- On linear-time data dissemination in dynamic rooted trees
- Central limit theorem for time to broadcast in radio networks
- Broadcasting in geometric radio networks
- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
- Radio fuzzy graphs and assignment of frequency in radio stations
- Fast message dissemination in random geometric networks
- Radio communication in random graphs
- On Randomized Broadcasting in Power Law Networks
This page was built for publication: On Radio Broadcasting in Random Geometric Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540232)
