Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks

DOI10.1007/978-3-540-77120-3_21zbMath1193.68026OpenAlexW1598398029MaRDI QIDQ5387759

Xin Wang, Artur Czumaj

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_21

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Related Items (3)

Fast message dissemination in random geometric networks ⋮ On Radio Broadcasting in Random Geometric Graphs ⋮ On Efficient Gossiping in Radio Networks

Cites Work

• Unnamed Item
• Broadcasting in geometric radio 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.
• Optimal deterministic broadcasting in known topology radio networks
• Radio communication in random graphs
• Fast broadcasting and gossiping in radio networks
• Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
• Average-Time Complexity of Gossiping in Radio Networks
• Random Geometric Graphs
• The capacity of wireless networks
• Deterministic broadcasting in ad hoc radio networks
• Faster communication in known topology radio networks
• Algorithm Theory - SWAT 2004
• Broadcasting algorithms in radio networks with unknown topology
• Broadcasting in undirected ad hoc radio networks

This page was built for publication: Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks