Distributed Detection in Sensor Networks with Limited Range Sensors
Erhan B. Ermis, Venkatesh Saligrama

TL;DR
This paper develops a scalable, robust distributed detection method for sensor networks with limited-range sensors, extending false discovery rate techniques to multi-dimensional and uncertain distribution scenarios.
Contribution
It introduces a novel FDR-based distributed detection approach tailored for limited-range sensors, including extensions for multi-dimensional data and distribution uncertainties.
Findings
Scalable detection algorithm with linear communication complexity.
Extension of FDR to multi-dimensional and uncertain distributions.
Robustness of the method to sensing model uncertainties.
Abstract
We consider a multi-object detection problem over a sensor network (SNET) with limited range sensors. This problem complements the widely considered decentralized detection problem where all sensors observe the same object. While the necessity for global collaboration is clear in the decentralized detection problem, the benefits of collaboration with limited range sensors is unclear and has not been widely explored. In this paper we develop a distributed detection approach based on recent development of the false discovery rate (FDR). We first extend the FDR procedure and develop a transformation that exploits complete or partial knowledge of either the observed distributions at each sensor or the ensemble (mixture) distribution across all sensors. We then show that this transformation applies to multi-dimensional observations, thus extending FDR to multi-dimensional settings. We also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
