Fast message dissemination in random geometric networks
DOI10.1007/s00446-011-0154-4zbMath1267.68030OpenAlexW2093465424MaRDI QIDQ2375822
Thomas Sauerwald, Xin Wang, Robert Elsässer, Artur Czumaj, Leszek Gąsieniec
Publication date: 25 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-011-0154-4
networkspower law distributioninformation disseminationrandom geometric graphsmessage disseminationrandom geometric networkstransmission radius
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Online algorithms; streaming algorithms (68W27) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic communication in radio networks with large labels
- A guided tour of Chernoff bounds
- Broadcasting in geometric radio networks
- Energy efficient randomised communication in unknown AdHoc networks
- 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.
- Faster broadcasting in unknown radio networks
- Optimal deterministic broadcasting in known topology radio networks
- Faster communication in known topology radio networks
- Radio communication in random graphs
- Fast broadcasting and gossiping in radio networks
- Critical Density Thresholds in Distributed Wireless Networks
- On Radio Broadcasting in Random Geometric Graphs
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- Centralized broadcast in multihop radio networks
- Random Geometric Graphs
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
- Algorithm Theory - SWAT 2004
- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks
- Broadcasting in udg radio networks with unknown topology
- Faster Centralized Communication in Radio Networks
- Broadcasting algorithms in radio networks with unknown topology
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- On the effect of the deployment setting on broadcasting in Euclidean radio networks
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Fast message dissemination in random geometric networks
