Name
Abstract | ||
|---|---|---|
To guarantee its integrity, a wireless sensor network needs to efficiently detect faulty nodes producing erroneous measurements. This paper proposes a fully distributed fault detection algorithm. A node first collects the measurements of its neighborhood, processes them to decide whether they contain outliers, and broadcasts the result. Then, it decides autonomously about its functioning status. The detection algorithm is proposed in two variants, depending on the proportion of faulty nodes in the network. A theoretical analysis of the probability of error and of the convergence of the algorithm is provided. The tradeoff between false alarm probability and detection probability is characterized using simulation. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ICC.2015.7249395 | IEEE International Conference on Communications |
Field | DocType | ISSN |
Convergence (routing),Key distribution in wireless sensor networks,Fault detection algorithm,False alarm,Fault detection and isolation,Computer science,Computer network,Brooks–Iyengar algorithm,Outlier,Real-time computing,Wireless sensor network | Conference | 1550-3607 |
Citations | PageRank | References |
3 | 0.45 | 4 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenjie Li | 1 | 368 | 59.74 |
| Francesca Bassi | 2 | 24 | 8.34 |
| Davide Dardari | 3 | 1557 | 116.18 |
| Michel Kieffer | 4 | 35 | 13.00 |
| Gianni Pasolini | 5 | 137 | 22.42 |