2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information

2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information

Technical Program

Paper Detail

Paper IDSPTM-3.4
Paper Title ON DISTRIBUTED COMPOSITE TESTS WITH DEPENDENT OBSERVATIONS IN WSN
Authors Juan Augusto Maya, Leonardo Rey Vega, University of Buenos Aires/ CSC-Conicet, Argentina
SessionSPTM-3: Estimation, Detection and Learning over Networks 1
LocationGather.Town
Session Time:Tuesday, 08 June, 14:00 - 14:45
Presentation Time:Tuesday, 08 June, 14:00 - 14:45
Presentation Poster
Topic Signal Processing Theory and Methods: Signal Processing over Networks
IEEE Xplore Open Preview  Click here to view in IEEE Xplore
Virtual Presentation  Click here to watch in the Virtual Conference
Abstract We consider a distributed detection problem with statistically spatial dependent measurements in a sensor network, when there is not a fusion center. Thus, each node takes some measurements, does some processing, exchanges messages with its neighbors and finally makes a decision (typically the same for all nodes) about the phenomenon of interest. A cooperative algorithm is proposed for reducing the number of communications between sensors and thus make an efficient use of the energy budget of a wireless sensor network (WSN). The problem is formulated as a composite hypothesis test using a general probability density function with unknown parameters leading naturally to the use of the generalized likelihood ratio (GLR) test. As the sensors observe statistically spatial dependent samples, which makes difficult the implementation of fully distributed detection procedures, we propose a simpler algorithm for making a decision about the true hypothesis. We also compute its asymptotic distribution to characterize its performance. Interestingly, despite the fact that our proposal is more simple and efficient to implement than the GLR test, we find relevant scenarios for which it outperforms the latter, even in finite length regimes.