Faster communication in known topology radio networks

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

Qin Xin, Leszek Gąsieniec, David Peleg

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

gossipingbroadcastingradio networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Planar graphs; geometric and topological aspects of graph theory (05C10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (17)

Optimal gossiping in geometric radio networks in the presence of dynamical faults ⋮ Efficient broadcasting in radio networks with long-range interference ⋮ Fast message dissemination in random geometric networks ⋮ Broadcasting in UDG radio networks with missing and inaccurate information ⋮ Time efficient \(k\)-shot broadcasting in known topology radio networks ⋮ Finding the size and the diameter of a radio network using short labels ⋮ Labeling schemes for deterministic radio multi-broadcast ⋮ Deterministic size discovery and topology recognition in radio networks with short labels ⋮ Broadcast Transmission to Prioritizing Receivers ⋮ Dynamic multiple-message broadcast: bounding throughput in the affectance model ⋮ On Radio Broadcasting in Random Geometric Graphs ⋮ Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges ⋮ Short labeling schemes for topology recognition in wireless tree networks ⋮ On the effect of the deployment setting on broadcasting in Euclidean radio networks ⋮ Fault-Tolerant Consensus with an Abstract MAC Layer. ⋮ Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast ⋮ On Efficient Gossiping in Radio Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for radio broadcast
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• A Strahler bijection between Dyck paths and planar trees
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• Centralized broadcast in multihop radio networks
• Logarithmic inapproximability of the radio broadcast problem
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Structural Information and Communication Complexity
• Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks

This page was built for publication: Faster communication in known topology radio networks