Recommendations
- Communication in dynamic radio networks
- Broadcasting in noisy radio networks
- Time-Efficient Broadcasting in Radio Networks
- Broadcasting in unreliable radio networks
- Time-efficient broadcast in radio networks
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- Broadcasting in undirected ad hoc radio networks
- Broadcasting in undirected ad hoc radio networks
Cites work
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 1979528 (Why is no real title available?)
- scientific article; zbMATH DE number 2086372 (Why is no real title available?)
- scientific article; zbMATH DE number 1445388 (Why is no real title available?)
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Broadcasting algorithms in radio networks with unknown topology
- Distributed broadcast in radio networks of unknown topology.
- Efficient communication strategies for ad hoc wireless networks
- Fast broadcasting and gossiping in radio networks
- Feasibility and complexity of broadcasting with random transmission failures
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Paths in graphs
- Probability and Computing
- Radio communication in random graphs
- Round robin is optimal for fault-tolerant broadcasting on wireless networks
Cited in
(61)- Scalable rational secret sharing
- On reliable broadcast in a radio network
- Xheal, localized self-healing using expanders
- MIS on trees
- Fast broadcasting and gossiping in radio networks
- Conflict on a communication channel
- Information spreading in dynamic networks: an analytical approach
- Parsimonious flooding in geometric random-walks (extended abstract)
- Brief announcement: Data dissemination in unified dynamic wireless networks
- Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds
- Coordinated consensus in dynamic networks
- Radio's Impact on Public Spending
- Structural Information and Communication Complexity
- Optimal gossiping in geometric radio networks in the presence of dynamical faults
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
- Distributed deterministic edge coloring using bounded neighborhood independence
- Distributed graph coloring in a few rounds
- On linear-time data dissemination in dynamic rooted trees
- Spatial node distribution of Manhattan path based random waypoint mobility models with applications
- Analyzing consistency properties for fun and profit
- Stability of a peer-to-peer communication system
- The impact of memory models on software reliability in multiprocessors
- Markov random geometric graph, MRGG: a growth model for temporal dynamic networks
- A tight unconditional lower bound on distributed randomwalk computation
- Structuring unreliable radio networks
- Parsimonious flooding in geometric random-walks
- Order optimal information spreading using algebraic gossip
- Bounded-contention coding for the additive network model
- Rumor spreading in random evolving graphs
- Fault-tolerant spanners
- Time-efficient randomized multiple-message broadcast in radio networks
- Byzantine agreement with homonyms
- Broadcasting in unreliable radio networks
- Error-free multi-valued consensus with Byzantine failures
- Adaptively secure broadcast, revisited
- Communication in dynamic radio networks
- The round complexity of distributed sorting, extended abstract
- scientific article; zbMATH DE number 1670865 (Why is no real title available?)
- From bounded to unbounded concurrency objects and back
- Optimal-time adaptive strong renaming, with applications to counting
- scientific article; zbMATH DE number 2086372 (Why is no real title available?)
- Parsimonious flooding in dynamic graphs
- On selection problem in radio networks
- Toward more localized local algorithms, removing assumptions concerning global knowledge
- Shortest, fastest, and foremost broadcast in dynamic networks
- Locally checkable proofs
- Performing work in broadcast networks
- A complexity separation between the cache-coherent and distributed shared memory models
- Faster information dissemination in dynamic networks via network coding
- The complexity of robust atomic storage
- Tight bounds on information dissemination in sparse mobile networks
- Resilience of mutual exclusion algorithms to transient memory faults
- Broadcasting in geometric radio networks
- The cost of global broadcast in dynamic radio networks
- Minimum congestion mapping in a cloud
- The cost of global broadcast in dynamic radio networks
- Braid Chain Radio Communication
- Throughput and packet displacements of dynamic broadcasting algorithms
- Compact policy routing
- Sharp Thresholds in Random Simple Temporal Graphs
This page was built for publication: Broadcasting in dynamic radio networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015809)
