Broadcasting in dynamic radio networks
From MaRDI portal
Publication:1015809
DOI10.1016/J.JCSS.2008.10.004zbMATH Open1159.90327OpenAlexW2011898573WikidataQ58219158 ScholiaQ58219158MaRDI QIDQ1015809FDOQ1015809
Authors: Andrea Clementi, Angelo Monti, Francesco Pasquale, 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
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
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)
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Title not available (Why is that?)
- Paths in graphs
- Title not available (Why is that?)
- Probability and Computing
- Broadcasting algorithms in radio networks with unknown topology
- Feasibility and complexity of broadcasting with random transmission failures
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Distributed broadcast in radio networks of unknown topology.
- Fast broadcasting and gossiping in radio networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Round robin is optimal for fault-tolerant broadcasting on wireless networks
- Radio communication in random graphs
- Efficient communication strategies for ad hoc wireless networks
Cited In (63)
- Compact policy routing
- Braid Chain Radio Communication
- Parsimonious flooding in geometric random-walks (extended abstract)
- Sharp Thresholds in Random Simple Temporal Graphs
- Resilience of mutual exclusion algorithms to transient memory faults
- On linear-time data dissemination in dynamic rooted trees
- On selection problem in radio networks
- Byzantine agreement with homonyms
- Adaptively secure broadcast, revisited
- Shortest, fastest, and foremost broadcast in dynamic networks
- Broadcasting in geometric radio networks
- Distributed deterministic edge coloring using bounded neighborhood independence
- Brief announcement: Data dissemination in unified dynamic wireless networks
- Coordinated consensus in dynamic networks
- The space complexity of long-lived and one-shot timestamp implementations
- Title not available (Why is that?)
- The cost of global broadcast in dynamic radio networks
- MIS on trees
- Distributed graph coloring in a few rounds
- Time-efficient randomized multiple-message broadcast in radio networks
- From bounded to unbounded concurrency objects and back
- Xheal, localized self-healing using expanders
- Rumor spreading in random evolving graphs
- Toward more localized local algorithms, removing assumptions concerning global knowledge
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Markov random geometric graph, MRGG: a growth model for temporal dynamic networks
- Locally checkable proofs
- Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds
- Optimal-time adaptive strong renaming, with applications to counting
- 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
- A tight unconditional lower bound on distributed randomwalk computation
- Performing work in broadcast networks
- Scalable rational secret sharing
- Information spreading in dynamic networks: an analytical approach
- Parsimonious flooding in geometric random-walks
- Bounded-contention coding for the additive network model
- Structuring unreliable radio networks
- Error-free multi-valued consensus with Byzantine failures
- Information spreading in dynamic graphs
- Communication in dynamic radio networks
- Minimum congestion mapping in a cloud
- Conflict on a communication channel
- The round complexity of distributed sorting, extended abstract
- Fast broadcasting and gossiping in radio networks
- Spatial node distribution of Manhattan path based random waypoint mobility models with applications
- On reliable broadcast in a radio network
- Radio's Impact on Public Spending
- The cost of global broadcast in dynamic radio networks
- Structural Information and Communication Complexity
- Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
- Broadcasting in unreliable radio networks
- Order optimal information spreading using algebraic gossip
- Fast and compact self stabilizing verification, computation, and fault detection of an MST
- A complexity separation between the cache-coherent and distributed shared memory models
- Optimal gossiping in geometric radio networks in the presence of dynamical faults
- The complexity of robust atomic storage
- Parsimonious flooding in dynamic graphs
- Fault-tolerant spanners
- Title not available (Why is that?)
- Faster information dissemination in dynamic networks via network coding
- Tight bounds on information dissemination in sparse mobile networks
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)
