Nonparametric Low Complexity Change Detection in Wireless Sensor Networks
碩士 === 國立交通大學 === 電信工程系所 === 95 === The problem of detecting changes in the distribution of alarmed sensors is considered. Under a nonparametric change detection framework, we present an algorithm based on the Rao test. We also partition sensors into small groups and estimate their mean to perform d...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/8cwds6 |
| Summary: | 碩士 === 國立交通大學 === 電信工程系所 === 95 === The problem of detecting changes in the distribution of alarmed sensors is considered. Under a nonparametric change detection framework, we present an algorithm based on the Rao test. We also partition sensors into small groups and estimate their mean to perform detection. Theoretical performance guarantees are obtained. Our approach has linear complexity, which is suitable to large number of sensors. We also enhance change detection performance for sensors-to-fusion links with interference.
|
|---|