Upper and lower bounds for deterministic broadcast in powerline communication networks
From MaRDI portal
Publication:324622
DOI10.1007/s00446-016-0263-1zbMath1388.68012OpenAlexW2301884055MaRDI QIDQ324622
Gilles Tredan, Stefan Schmid, Yvonne Anne Pignolet
Publication date: 17 October 2016
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-016-0263-1
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A new distributed depth-first-search algorithm
- Unit disk graphs
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Token dissemination in geometric dynamic networks
- Optimal deterministic broadcasting in known topology radio networks
- Distributed computation in dynamic networks
- Multi-message broadcast with abstract MAC layers and unreliable links
- The Complexity of Data Aggregation in Directed Networks
- Time-Efficient Broadcasting in Radio Networks
- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
- The cost of radio network broadcast for different models of unreliable links
- Faster communication in known topology radio networks
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- An Ω(D log(N/D)) lower bound for broadcast in radio networks
- Faster Centralized Communication in Radio Networks
- Broadcasting algorithms in radio networks with unknown topology
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Upper and lower bounds for deterministic broadcast in powerline communication networks
