Name
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. |
Year | Venue | Field |
|---|---|---|
2017 | 2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | Byzantine attack,Delay-tolerant networking,Computer science,Outlier,Brooks–Iyengar algorithm,Computer network,Robustness (computer science),Network topology,Wireless ad hoc network,Wireless sensor network |
DocType | ISSN | Citations |
Conference | 1550-3607 | 2 |
PageRank | References | Authors |
0.35 | 7 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenjie Li | 1 | 368 | 59.74 |
| Francesca Bassi | 2 | 24 | 8.34 |
| Michel Kieffer | 3 | 35 | 13.00 |
| Alex Calisti | 4 | 4 | 1.04 |
| Gianni Pasolini | 5 | 137 | 22.42 |
| Davide Dardari | 6 | 1557 | 116.18 |