Distributed faulty node detection in DTNs in presence of Byzantine attack - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Distributed faulty node detection in DTNs in presence of Byzantine attack

(1) , (2, 1) , (1, 3, 4) , (5) , (5) , (5)
1
2
3
4
5

Abstract

This paper considers a delay tolerant network consisting of nodes equipped with sensors, some of them producing outliers. A distributed faulty node detection (DFD) algorithm, whose aim is to help each node in estimating the status of its sensors, has been proposed recently by the authors. The aim of this paper is to analyze the robustness of the DFD algorithm to the presence of misbehaving nodes performing Byzantine attacks. Two types of attacks are considered and analyzed, each trying to mislead the other nodes in the estimation of the status of their sensors. This provides insights on the way the parameters of the DFD algorithm should be adapted to minimize the impact of misbehaving nodes. Theoretical results are illustrated with simulations considering nodes with random displacements, as well as traces of node inter-contact times from real databases.
Fichier principal
Vignette du fichier
icc217_v3.pdf (1.96 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01576626 , version 1 (23-08-2017)

Identifiers

Cite

Wenjie Li, Francesca Bassi, Michel Kieffer, Alex Calisti, Gianni Pasolini, et al.. Distributed faulty node detection in DTNs in presence of Byzantine attack. IEEE International Conference on Communications (ICC), May 2017, Paris, France. pp.1 - 6, ⟨10.1109/ICC.2017.7996846⟩. ⟨hal-01576626⟩
250 View
194 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More