Worst-case drift detection of sensor networks: performances and algorithms

The goal of this paper is to derive algorithms that are able to detect unreliable/drifted sensors, in a sensor network. To recover the state of each sensor, we restrict ourselves to a particular decoder, inspired by graph partitioning problems. We provide necessary and sufficient conditions over the measurements such that the decoder perfectly recovers each sensor binary state. The outputs of the decoder can be computed using a dynamic programming approach. One challenging part of this approach is the complexity of the dynamic programming equation. Indeed, the resolution time will increase exponentially with the number of sensors. Therefore, we propose an efficient heuristic method that approximately solves the problem. We study the performance of our algorithm using simulations.