Faster communication in known topology radio networks

DOI10.1007/s00446-006-0011-zzbMath1266.68026MaRDI QIDQ1954206

David Peleg, Leszek Gąsieniec, Qin Xin

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-006-0011-z

zbMATH Keywords

gossiping; broadcasting; radio networks

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

05C10: Planar graphs; geometric and topological aspects of graph theory

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms

Related Items

On Efficient Gossiping in Radio Networks, On Radio Broadcasting in Random Geometric Graphs, Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges