Optimal deterministic broadcasting in known topology radio networks
From MaRDI portal
Publication:1954200
DOI10.1007/s00446-006-0007-8zbMath1266.68231OpenAlexW2051628581MaRDI QIDQ1954200
Dariusz R. Kowalski, Andrzej Pelc
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-0007-8
Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (36)
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 ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Upper and lower bounds for deterministic broadcast in powerline communication networks ⋮ Time efficient \(k\)-shot broadcasting in known topology radio networks ⋮ Information dissemination in unknown radio networks with large labels ⋮ Labeling schemes for deterministic radio multi-broadcast ⋮ Deterministic size discovery and topology recognition in radio networks with short labels ⋮ Centralized Communication in Radio Networks with Strong Interference ⋮ Fast Radio Broadcasting with Advice ⋮ Randomized broadcast in radio networks with collision detection ⋮ Dynamic multiple-message broadcast: bounding throughput in the affectance model ⋮ Radio aggregation scheduling ⋮ Almost optimal distributed M2M multicasting in wireless mesh networks ⋮ Latency-optimal communication in wireless mesh networks ⋮ Activating anonymous ad hoc radio networks ⋮ Broadcasting in geometric radio networks ⋮ 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 ⋮ Tree exploration with advice ⋮ Fast radio broadcasting with advice ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Communication algorithms with advice ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Acknowledged broadcasting in ad hoc radio networks ⋮ Efficient \(k\)-shot broadcasting in radio networks ⋮ Message and time efficient multi-broadcast schemes ⋮ On the effect of the deployment setting on broadcasting in Euclidean radio networks ⋮ Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast ⋮ A note on the lower bound of centralized radio broadcasting for planar reachability graphs ⋮ Time-Efficient Broadcast in Radio Networks ⋮ On Efficient Gossiping in Radio Networks ⋮ Exactly optimal deterministic radio broadcasting with collision detection
Cites Work
- Unnamed Item
- 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
- Faster broadcasting in unknown radio networks
- Fast broadcasting and gossiping in radio networks
- Combination Can Be Hard: Approximability of the Unique Coverage Problem
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Centralized broadcast in multihop radio networks
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks
- Logarithmic inapproximability of the radio broadcast problem
- Faster communication in known topology radio networks
- 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: Optimal deterministic broadcasting in known topology radio networks
