Upper and lower bounds for deterministic broadcast in powerline communication networks

DOI10.1007/S00446-016-0263-1zbMATH Open1388.68012OpenAlexW2301884055MaRDI QIDQ324622FDOQ324622

Authors: Yvonne Anne Pignolet, Stefan Schmid, Gilles Tredan 

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

Recommendations

• Lower bounds for the broadcast problem in mobile radio networks
• STACS 2004
• Broadcasting in undirected ad hoc radio networks
• Broadcasting in undirected ad hoc radio networks
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Cites Work

• Unit disk graphs
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Optimal deterministic broadcasting in known topology radio networks
• Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
• Distributed computation in dynamic networks
• A new distributed depth-first-search algorithm
• A lower bound for radio broadcast
• Token dissemination in geometric 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
• Title not available (Why is that?)
• 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

Cited In (1)

• Local Fast Segment Rerouting on Hypercubes

This page was built for publication: Upper and lower bounds for deterministic broadcast in powerline communication networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324622)