On Radio Broadcasting in Random Geometric Graphs

DOI10.1007/978-3-540-87779-0_15MaRDI QIDQ3540232zbMATH OpenOpenAlexFDO

Authors Robert Elsässer, Thomas Sauerwald, Leszek Gąsieniec

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

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

Cites work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A guided tour of Chernoff bounds
• An improved algorithm for radio broadcast
• Broadcasting algorithms in radio networks with unknown topology
• Broadcasting in UDG radio networks with unknown topology
• Broadcasting in geometric radio networks
• Broadcasting in undirected ad hoc radio networks
• Centralized broadcast in multihop radio networks
• Critical density thresholds in distributed wireless networks
• Deterministic broadcasting in ad hoc radio networks
• Deterministic communication in radio networks with large labels
• Distributed broadcast in radio networks of unknown topology.
• Energy efficient randomised communication in unknown AdHoc networks
• Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks
• Fast broadcasting and gossiping in radio networks
• Faster Centralized Communication in Radio Networks
• Faster broadcasting in unknown radio networks
• Faster communication in known topology radio networks
• Lower bounds for the broadcast problem in mobile radio networks
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• Optimal deterministic broadcasting in known topology radio networks
• Radio communication in random graphs
• Random Geometric Graphs
• The bin-covering technique for thresholding random geometric graph properties
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge

Cited in

(12)

• 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
• Efficient broadcasting in random power law networks
• Radio fuzzy graphs and assignment of frequency in radio stations
• Fast message dissemination in random geometric networks
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• Radio communication in random graphs
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• Collaborative broadcast in \(\mathcal{O}(\log \log n)\) rounds
• 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)