Robust Sequential Detection in Distributed Sensor Networks
Preprint
Abstract
We consider the problem of sequential binary hypothesis testing with a distributed sensor network in a non-Gaussian noise environment. To this end, we present a general formulation of the Consensus + Innovations Sequential Probability Ratio Test (CISPRT). Furthermore, we introduce two different concepts for robustifying the CISPRT and propose four different algorithms, namely, the Least-Favorable-Density-CISPRT, the Median-CISPRT, the M-CISPRT, and the Myriad-CISPRT. Subsequently, we analyze their suitability for different binary hypothesis tests before verifying and evaluating their performance in a shift-in-mean and a shift-in-variance scenario.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Multi-target tracking in distributed sensor networks using particle PHD filtersSignal Processing, 2019
- Robust and Distributed Hypothesis Testing2017
- A Linear Programming Approach to Sequential Hypothesis TestingSequential Analysis, 2015
- Principles of Signal Detection and Parameter Estimation2008
- Intuitive Probability and Random Processes Using MATLAB®2006
- Fast linear iterations for distributed averagingSystems & Control Letters, 2004
- Distributed detection with multiple sensors I. Advanced topicsProceedings of the IEEE, 1997
- Minimax robust decentralized detectionIEEE Transactions on Information Theory, 1994
- Minimax sequential tests of composite hypotheses on the drift of a Wiener processStatistische Hefte, 1987
- The decentralized wald problemInformation and Computation, 1987