Broadcasting in geometric radio networks

DOI10.1016/j.jda.2006.07.001zbMath1134.94301OpenAlexW2061572891MaRDI QIDQ924558

Anders Dessmark, Andrzej Pelc

Publication date: 16 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.07.001

zbMATH Keywords

broadcastingradio networkknowledge radius

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20) Communication theory (94A05)

Related Items (19)

Optimal gossiping in geometric radio networks in the presence of dynamical faults ⋮ Fast message dissemination in random geometric networks ⋮ Broadcasting in UDG radio networks with missing and inaccurate information ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Leader election in ad hoc radio networks: a keen ear helps ⋮ Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony ⋮ Fast Radio Broadcasting with Advice ⋮ Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization ⋮ Deterministic protocols in the SINR model without knowledge of coordinates ⋮ On Radio Broadcasting in Random Geometric Graphs ⋮ Broadcasting in UDG Radio Networks with Missing and Inaccurate Information ⋮ Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges ⋮ Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks ⋮ Fast radio broadcasting with advice ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Acknowledged broadcasting in ad hoc radio networks ⋮ Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes ⋮ On the effect of the deployment setting on broadcasting in Euclidean radio networks ⋮ Time-Efficient Broadcast in Radio Networks

Cites Work

• Unnamed Item
• 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
• Broadcasting on \([0,L\)]
• Faster broadcasting in unknown radio networks
• The impact of information on broadcasting time in linear radio networks.
• Optimal deterministic broadcasting in known topology radio networks
• Fault-Tolerant Broadcasting in Radio Networks
• Fast broadcasting and gossiping in radio networks
• A trade-off between information and communication in broadcast protocols
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• A perspective on multiaccess channels
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
• Faster Deterministic Broadcasting in Ad Hoc Radio Networks
• Lower bounds for the broadcast problem in mobile radio networks
• Deterministic broadcasting in ad hoc radio networks
• Faster communication in known topology radio networks
• Feasibility and complexity of broadcasting with random transmission failures
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Broadcasting algorithms in radio networks with unknown topology
• Broadcasting in undirected ad hoc radio networks

This page was built for publication: Broadcasting in geometric radio networks