Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
From MaRDI portal
Publication:3588315
DOI10.1007/978-3-642-15763-9_34zbMath1290.68014OpenAlexW2097993752MaRDI QIDQ3588315
Antonio Fernández Anta, Miguel A. Mosteiro, Alessia Milani, Shmuel Zaks
Publication date: 10 September 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00992699/file/11.pdf
Related Items (34)
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 ⋮ Order optimal information spreading using algebraic gossip ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ Structuring unreliable radio networks ⋮ Byzantine agreement with homonyms ⋮ Distributed deterministic edge coloring using bounded neighborhood independence ⋮ Compact policy routing ⋮ Xheal
This page was built for publication: Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
