Time-efficient broadcast in radio networks
From MaRDI portal
Publication:3404475
Recommendations
Cites work
- scientific article; zbMATH DE number 1670865 (Why is no real title available?)
- scientific article; zbMATH DE number 1688358 (Why is no real title available?)
- scientific article; zbMATH DE number 1979528 (Why is no real title available?)
- scientific article; zbMATH DE number 1848288 (Why is no real title available?)
- scientific article; zbMATH DE number 2119730 (Why is no real title available?)
- A better wake-up in radio networks
- A lower bound for radio broadcast
- A new distributed depth-first-search algorithm
- A survey of gossiping and broadcasting in communication networks
- A trade-off between information and communication in broadcast protocols
- Algorithm Theory - SWAT 2004
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Automata, Languages and Programming
- Broadcast in radio networks tolerating Byzantine adversarial behavior
- Broadcasting algorithms in radio networks with unknown topology
- Broadcasting in UDG radio networks with unknown topology
- Broadcasting in geometric radio networks
- Broadcasting in undirected ad hoc radio networks
- Broadcasting on \([0,L]\)
- Broadcasting with locally bounded byzantine faults
- Centralized broadcast in multihop radio networks
- Deterministic broadcasting in ad hoc radio networks
- Deterministic communication in radio networks with large labels
- Deterministic radio broadcasting at low cost
- Distributed Computing: A Locality-Sensitive Approach
- Distributed broadcast in radio networks of unknown topology.
- Distributed network protocols
- Efficient communication in unknown networks
- Energy and Time Efficient Broadcasting in Known Topology Radio Networks
- Fast broadcasting and gossiping in radio networks
- Fast distributed algorithm for convergecast in ad hoc geometric radio networks
- Faster Centralized Communication in Radio Networks
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks
- Faster broadcasting in unknown radio networks
- Faster communication in known topology radio networks
- Fault-tolerant broadcasting and gossiping in communication networks
- Fault-tolerant broadcasting in radio networks
- Fundamentals of Computation Theory
- Improved schedule for radio broadcast
- Logarithmic inapproximability of the radio broadcast problem
- Lower bounds for the broadcast problem in mobile radio networks
- Methods and problems of communication in usual networks
- Minimal broadcast networks
- Minimum broadcast graphs
- Multiple Communication in Multihop Radio Networks
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- On reliable broadcast in a radio network
- On the effect of the deployment setting on broadcasting in Euclidean radio networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Optimal Broadcast with Partial Knowledge
- Optimal deterministic broadcasting in known topology radio networks
- Randomized broadcast in networks
- Reliable broadcast in radio networks
- Round robin is optimal for fault-tolerant broadcasting on wireless networks
- STACS 2004
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- Single round simulation on radio networks
- Structural Information and Communication Complexity
- The impact of information on broadcasting time in linear radio networks.
- The time complexity of deterministic broadcast radio networks
- The wakeup problem in synchronous broadcast systems
- Time and Cost Trade-Offs in Gossiping
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
- Topology broadcast algorithms
Cited in
(9)- Time-Efficient Broadcasting in Radio Networks
- Broadcasting in dynamic radio networks
- Message and time efficient multi-broadcast schemes
- Structural Information and Communication Complexity
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- On the scalability and message count of trickle-based broadcasting schemes
- Network information broadcasting in narrow band self-organizing networks
- Broadcasting in conflict-aware multi-channel networks
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
This page was built for publication: Time-efficient broadcast in radio networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404475)
