2019
DOI: 10.1016/j.jnca.2018.11.009
|View full text |Cite
|
Sign up to set email alerts
|

A probabilistic multivariate copula-based technique for faulty node diagnosis in wireless sensor networks

Abstract: Wireless sensor networks (WSNs) find extensive applications in various sensitive domains such as tracking, monitoring, environmental data collection and border surveillance. In these cases, the collected data are considered as a critical resource and used to detect any anomalies or abnormal behavior, providing information about an occurring event or a node failure. An outlier detection process must be set up to ensure the proper functioning of the monitoring system.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
11
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 33 publications
0
11
0
Order By: Relevance
“…This choice is justified by the fact that this algorithm has shown its usefulness in this context of use, which has been proven in the recently conducted research. 35 After the neighbor selection phase, adaptive entropy and a greedy algorithm are applied to the data that have the same timestamp as their neighbors, and this in order to select the sensor that can collaborate more effectively with the considered sensor to globally detect noise in the considered network.…”
Section: Reading Sensory Datamentioning
confidence: 99%
“…This choice is justified by the fact that this algorithm has shown its usefulness in this context of use, which has been proven in the recently conducted research. 35 After the neighbor selection phase, adaptive entropy and a greedy algorithm are applied to the data that have the same timestamp as their neighbors, and this in order to select the sensor that can collaborate more effectively with the considered sensor to globally detect noise in the considered network.…”
Section: Reading Sensory Datamentioning
confidence: 99%
“…This calculation of density can be executed in an evenly distributed manner. In [35], a Local Outlier Factor (LOF) method is proposed. This method consists of drawing a circle around "k" measures, where depending on the density level obtained, it attributes an "outlier metric" parameter to each measure, which determines whether or not each such measure should be defined as an outlier.…”
Section: Related Workmentioning
confidence: 99%
“…Hence, for the neighbor selection, a simulation of the Monte Carlo algorithm is conducted. This choice is justified by the fact that this algorithm has shown its usefulness in this context of use, which has been proven in the recently conducted research [35]. After the neighbor selection phase, adaptive entropy and a greedy algorithm are applied to the data that have the same timestamp as their neighbors, and this in order to select the sensor that can collaborate more effectively with the considered sensor to globally detect noise in the considered network.…”
Section: Reading Sensory Datamentioning
confidence: 99%
“…In Reference , a technique, labeled as local outlier factor (LOF), is proposed. It first marks around at minimum k ‐measures called “outlier metric,” outlier metric dependent on the obtained level of density it adds to sensory data to identify if this measure is an outlier or possibly not.…”
Section: Outlier Detection In Wsnsmentioning
confidence: 99%
“…The value 10 is chosen as a starting point to calculate features after reading data from the sensor node. Computed features are represented by the matrix feaMatrix illustrated by Equation (31). This matrix will be used by the prediction algorithm function.…”
mentioning
confidence: 99%