Time efficient \(k\)-shot broadcasting in known topology radio networks

DOI10.1007/s00446-008-0058-0zbMath1267.68050OpenAlexW2026246682MaRDI QIDQ352244

Dariusz R. Kowalski, Erez Kantor, Chang Su, David Peleg, Leszek Gąsieniec

Publication date: 4 July 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-008-0058-0

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) Network protocols (68M12)

Related Items (9)

Efficient broadcasting in radio networks with long-range interference ⋮ Unnamed Item ⋮ Sleeping on the job: energy-efficient and robust broadcast for radio networks ⋮ Energy-efficient broadcasting in ad hoc wireless networks ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Efficient \(k\)-shot broadcasting in radio networks ⋮ Message and time efficient multi-broadcast schemes ⋮ On Efficient Gossiping in Radio Networks ⋮ Efficient and competitive broadcast in multi-channel radio networks

Cites Work

• Unnamed Item
• Unnamed Item
• Energy efficient randomised communication in unknown AdHoc networks
• A lower bound for radio broadcast
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Approximation algorithms for connected dominating sets
• Optimal deterministic broadcasting in known topology radio networks
• Faster communication in known topology radio networks
• Time efficient centralized gossiping in radio networks
• Improved approximation results for the minimum energy broadcasting problem
• An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size
• Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
• Centralized broadcast in multihop radio networks
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Faster Centralized Communication in Radio Networks
• Probability and Computing
• Automata, Languages and Programming

This page was built for publication: Time efficient \(k\)-shot broadcasting in known topology radio networks