Dependable Information Broadcast in Sparsely Connected Networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Dependable Information Broadcast in Sparsely Connected Networks

Alexandre Maurer
  • Function : Author
  • PersonId : 918732
Sébastien Tixeuil


We consider the problem of reliably broadcasting informations in a multihop network where some nodes are likely to fail. We consider the most general failure model: the Byzantine model, where the failing nodes can exhibit arbitrary malicious behavior, and may actively try to destabilize the network. We focus on totally decentralized solutions. Most existing solutions require strong network connectivity. This requirement becomes difficult to satisfy when the networks grows larger. In this paper, we review recent solutions that are tailored to sparsely connected networks. A typical example is the grid, where each node has at most four neighbors. We first present the Control Zones method, where the nodes are assumed to know the global network topology. Then, we introduce the Trigger method, which relaxes this requirement given that some performance cost is acceptable. Last, we present the Fractal method, which enables to preserve performances when the size of the network increases.
No file

Dates and versions

hal-01219722 , version 1 (23-10-2015)


  • HAL Id : hal-01219722 , version 1


Alexandre Maurer, Sébastien Tixeuil. Dependable Information Broadcast in Sparsely Connected Networks. International Conference on Latin American Dependable Computing, LADC 2013, Apr 2013, Rio de Janeiro, Brazil. pp.31-39. ⟨hal-01219722⟩
63 View
0 Download


Gmail Facebook X LinkedIn More