Efficient \(k\)-shot broadcasting in radio networks
From MaRDI portal
Publication:5962518
DOI10.1016/j.dam.2015.08.021zbMath1348.68016OpenAlexW2191798033MaRDI QIDQ5962518
Publication date: 12 February 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.08.021
Related Items (3)
Unnamed Item ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Efficient and competitive broadcast in multi-channel radio networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Time efficient \(k\)-shot broadcasting in known topology radio 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
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Optimal deterministic broadcasting in known topology radio networks
- 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 communication in known topology radio networks
- On selection problem in radio networks
- Probability and Computing
- Automata, Languages and Programming
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Efficient \(k\)-shot broadcasting in radio networks