Abstract
Event detection is a critical task in sensor networks, especially for environmental monitoring applications. Traditional solutions to event detection are based on analyzing one-shot data points, which might incur a high false alarm rate because sensor data is inherently unreliable and noisy. To address this issue, we propose a novel Distributed Single-pass Incremental Clustering (DSIC) technique to cluster the time series obtained at sensor nodes based on their underlying trends. In order to achieve scalability and energy-efficiency, our DSIC technique uses a hierarchical structure of sensor networks as the underlying infrastructure. The algorithm first compresses the time series produced at individual sensor nodes into a compact representation using Haar wavelet transform, and then, based on dynamic time warping distances, hierarchically groups the approximate time series into a global clustering model in an incremental manner. Experimental results on both real data and synthetic data demonstrate that our DSIC algorithm is accurate, energy-efficient and robust with respect to network topology changes.
Original language | English |
---|---|
Pages | 678-687 |
Number of pages | 10 |
Publication status | Published - 2008 |
Event | Proceedings of the 2008 Eighth IEEE International Conference on Data Mining - Washington, DC Duration: 15 Dec 2008 → 19 Dec 2008 |
Conference
Conference | Proceedings of the 2008 Eighth IEEE International Conference on Data Mining |
---|---|
City | Washington, DC |
Period | 15/12/08 → 19/12/08 |
Keywords
- Distributed Clustering
- Time Series
- Sensor Networks