Change Detection and Estimation in Large Scale Sensor Networks: Linear Complexity Algorithms
Abstract
We propose algorithms for nonparametric sample-based spacial change detection and estimation in large scale sensor networks. We collect random samples containing the location of sensors and their local decisions, and assume that the local decisions can be stimulated or normal , reflecting the local strength of some stimulating agent. Then change in the location of the agent manifests itself by a change in the distribution of stimulated sensors. In this paper, we are aiming at developing a test that, given two collections of samples, can decide whether the distribution generating the samples has changed or not, and give an estimated changed area if a change is indeed detected. The focus of this paper is to reduce the complexity of the detection and estimation algorithm. We propose two fast algorithms with almost linear complexity and analyze their completeness, flexibility and robustness.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 2004
- Accession Number
- ADA431591
Entities
People
- Lang Tong
- Shai Ben-david
- Ting He
Organizations
- Cornell University College of Engineering