Skip to Main content Skip to Navigation

Reliable communication in multihop networks despite byzantine failures

Alexandre Maurer 1
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : As modern networks grow larger and larger, they become more likely to fail. Indeed, their nodes can be subject to attacks, failures, memory corruptions... In order to encompass all possible types of failures, we consider the most general model of failure: the Byzantine model, where the failing nodes have an arbitrary (and thus, potentially malicious) behavior. Such failures are extremely dangerous, as one single Byzantine node, if not neutralized, can potentially lie to the entire network. We consider the problem of reliably exchanging information in a multihop network despite such Byzantine failures. Solutions exist but require a dense network, where each node has a large number of neighbors. In this thesis, we propose solutions for sparse networks, such as the grid, where each node has at most 4 neighbors. In a first part, we accept that some correct nodes fail to communicate reliably. In exchange, we propose quantitative solutions that tolerate a large number of Byzantine failures, and significantly outperform previous solutions in sparse networks. In a second part, we propose algorithms that ensure reliable communication between all correct nodes, provided that the Byzantine nodes are sufficiently distant from each other. At last, we generalize existing results to new contexts: dynamic networks, and networks with an unbounded diameter.
Complete list of metadata

Cited literature [49 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Saturday, March 7, 2015 - 2:13:56 AM
Last modification on : Friday, January 8, 2021 - 5:38:04 PM
Long-term archiving on: : Monday, June 8, 2015 - 2:05:16 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01091009, version 2


Alexandre Maurer. Reliable communication in multihop networks despite byzantine failures. Data Structures and Algorithms [cs.DS]. Université Pierre et Marie Curie - Paris VI, 2014. English. ⟨NNT : 2014PA066347⟩. ⟨tel-01091009v2⟩



Record views


Files downloads