Reliable Communication in a Dynamic Network in the Presence of Byzantine Faults

Abstract : We consider the following problem: two nodes want to reliably communicate in a dynamic multihop network where some nodes have been compromised, and may have a totally arbitrary and unpredictable behavior. These nodes are called Byzantine. We consider the two cases where cryptography is available and not available. We prove the necessary and sufficient condition (that is, the weakest possible condition) to ensure reliable communication in this context. Our proof is constructive, as we provide Byzantine-resilient algorithms for reliable communication that are optimal with respect to our impossibility results. In a second part, we investigate the impact of our conditions in three case studies: participants interacting in a conference, robots moving on a grid and agents in the subway. Our simulations indicate a clear benefit of using our algorithms for reliable communication in those contexts.
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-00940569
Contributor : Alexandre Maurer <>
Submitted on : Monday, February 16, 2015 - 1:04:12 PM
Last modification on : Tuesday, May 14, 2019 - 10:14:25 AM
Long-term archiving on : Sunday, April 16, 2017 - 8:46:15 AM

Files

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00940569, version 4
  • ARXIV : 1402.0121

Citation

Alexandre Maurer, Sébastien Tixeuil, Xavier Défago. Reliable Communication in a Dynamic Network in the Presence of Byzantine Faults. [Research Report] _. 2014. ⟨hal-00940569v4⟩

Share

Metrics

Record views

522

Files downloads

365