Abstract
In wireless sensor networks (WSNs), it has been observed that most abnormal events persist over a considerable period of time instead of being transient. As existing anomaly detection techniques usually operate in a point-based manner that handles each observation individually, they are unable to reliably and efficiently report such long-term anomalies appeared in an individual sensor node. Therefore, in this paper, we focus on a new technique for handling data in a segment-based manner. Considering a collection of neighbouring data segments as random variables, we determine those behaving abnormally by exploiting their spatial predictabilities and, motivated by spatial analysis, specifically investigate how to implement a prediction variance detector in a WSN. As the communication cost incurred in aggregating a covariance matrix is finally optimised using the Spearman's rank correlation coefficient and differential compression, the proposed scheme is able to efficiently detect a wide range of long-term anomalies. In theory, comparing to the regular centralised approach, it can reduce the communication cost by approximately 80 percent. Moreover, its effectiveness is demonstrated by the numerical experiments, with a real world data set collected by the Intel Berkeley ResearchLab (IBRL).
Original language | English |
---|---|
Article number | 6748064 |
Pages (from-to) | 574-583 |
Number of pages | 10 |
Journal | IEEE Transactions on Parallel and Distributed Systems |
Volume | 26 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 Feb 2015 |
Externally published | Yes |
Keywords
- anomaly detection
- differential compression
- distributed computing
- spatial analysis
- Spearman's rank correlation coefficient
- Wireless sensor network
ASJC Scopus subject areas
- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics