Broadcasting in dynamic radio networks
From MaRDI portal
Publication:1015809
DOI10.1016/j.jcss.2008.10.004zbMath1159.90327OpenAlexW2011898573WikidataQ58219158 ScholiaQ58219158MaRDI QIDQ1015809
Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri
Publication date: 30 April 2009
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2108/18909
Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items (48)
Optimal gossiping in geometric radio networks in the presence of dynamical faults ⋮ Markov random geometric graph, MRGG: a growth model for temporal dynamic networks ⋮ Coordinated consensus in dynamic networks ⋮ Error-free multi-valued consensus with byzantine failures ⋮ Distributed graph coloring in a few rounds ⋮ MIS on trees ⋮ Toward more localized local algorithms ⋮ The complexity of robust atomic storage ⋮ Resilience of mutual exclusion algorithms to transient memory faults ⋮ The impact of memory models on software reliability in multiprocessors ⋮ A complexity separation between the cache-coherent and distributed shared memory models ⋮ From bounded to unbounded concurrency objects and back ⋮ The space complexity of long-lived and one-shot timestamp implementations ⋮ Locally checkable proofs ⋮ Fault-tolerant spanners ⋮ Adaptively secure broadcast, revisited ⋮ Scalable rational secret sharing ⋮ Analyzing consistency properties for fun and profit ⋮ Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions ⋮ Optimal-time adaptive strong renaming, with applications to counting ⋮ The round complexity of distributed sorting ⋮ A tight unconditional lower bound on distributed randomwalk computation ⋮ Minimum congestion mapping in a cloud ⋮ Conflict on a communication channel ⋮ Stability of a peer-to-peer communication system ⋮ Tight bounds on information dissemination in sparse mobile networks ⋮ Time-efficient randomized multiple-message broadcast in radio networks ⋮ Faster information dissemination in dynamic networks via network coding ⋮ Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony ⋮ Sharp Thresholds in Random Simple Temporal Graphs ⋮ Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds ⋮ Order optimal information spreading using algebraic gossip ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ Parsimonious flooding in dynamic graphs ⋮ Information Spreading in Dynamic Networks: An Analytical Approach ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ Information spreading in dynamic graphs ⋮ Structuring unreliable radio networks ⋮ Byzantine agreement with homonyms ⋮ Distributed deterministic edge coloring using bounded neighborhood independence ⋮ Compact policy routing ⋮ Rumor spreading in random evolving graphs ⋮ The cost of global broadcast in dynamic radio networks ⋮ Parsimonious flooding in geometric random-walks ⋮ Bounded-contention coding for the additive network model ⋮ Parsimonious Flooding in Geometric Random-Walks ⋮ Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications ⋮ Xheal
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Distributed broadcast in radio networks of unknown topology.
- Round robin is optimal for fault-tolerant broadcasting on wireless networks
- Radio communication in random graphs
- Fast broadcasting and gossiping in radio networks
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Paths in graphs
- Feasibility and complexity of broadcasting with random transmission failures
- Probability and Computing
- Broadcasting algorithms in radio networks with unknown topology
- Efficient communication strategies for ad hoc wireless networks
This page was built for publication: Broadcasting in dynamic radio networks
