Time-Efficient Broadcast in Radio Networks
From MaRDI portal
Publication:3404475
DOI10.1007/978-3-642-02250-0_12zbMath1187.68047OpenAlexW2150348475MaRDI QIDQ3404475
Publication date: 9 February 2010
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02250-0_12
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Broadcasting with locally bounded byzantine faults
- Deterministic communication in radio networks with large labels
- Broadcasting in geometric radio networks
- A new distributed depth-first-search algorithm
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Minimum broadcast graphs
- Methods and problems of communication in usual networks
- Broadcasting on \([0,L\)]
- Distributed broadcast in radio networks of unknown topology.
- Faster broadcasting in unknown radio networks
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- The impact of information on broadcasting time in linear radio networks.
- Round robin is optimal for fault-tolerant broadcasting on wireless networks
- The time complexity of deterministic broadcast radio networks
- Optimal deterministic broadcasting in known topology radio networks
- Fast distributed algorithm for convergecast in ad hoc geometric radio networks
- The Wakeup Problem in Synchronous Broadcast Systems
- Fault-Tolerant Broadcasting in Radio Networks
- Efficient communication in unknown networks
- Multiple Communication in Multihop Radio Networks
- Fast broadcasting and gossiping in radio networks
- Randomized broadcast in networks
- Distributed network protocols
- A trade-off between information and communication in broadcast protocols
- Energy and Time Efficient Broadcasting in Known Topology Radio Networks
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- A survey of gossiping and broadcasting in communication networks
- Topology broadcast algorithms
- Minimal broadcast networks
- Single round simulation on radio networks
- Optimal Broadcast with Partial Knowledge
- Time and Cost Trade-Offs in Gossiping
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Centralized broadcast in multihop radio networks
- Distributed Computing: A Locality-Sensitive Approach
- Deterministic radio broadcasting at low cost
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks
- Logarithmic inapproximability of the radio broadcast problem
- Lower bounds for the broadcast problem in mobile radio networks
- Deterministic broadcasting in ad hoc radio networks
- Faster communication in known topology radio networks
- On reliable broadcast in a radio network
- Reliable broadcast in radio networks
- STACS 2004
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Structural Information and Communication Complexity
- Algorithm Theory - SWAT 2004
- Broadcasting in udg radio networks with unknown topology
- Faster Centralized Communication in Radio Networks
- Broadcasting algorithms in radio networks with unknown topology
- Fundamentals of Computation Theory
- A better wake-up in radio networks
- Broadcast in radio networks tolerating byzantine adversarial behavior
- Fault-tolerant broadcasting and gossiping in communication networks
- Automata, Languages and Programming
- On the effect of the deployment setting on broadcasting in Euclidean radio networks
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Time-Efficient Broadcast in Radio Networks
