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.
Liste complète des métadonnées
Contributeur : Alexandre Maurer <>
Soumis le : lundi 16 février 2015 - 13:04:12
Dernière modification le : jeudi 22 novembre 2018 - 14:32:57
Document(s) archivé(s) le : dimanche 16 avril 2017 - 08:46:15


Fichiers produits par l'(les) auteur(s)


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



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〉



Consultations de la notice


Téléchargements de fichiers