Theoretical Bounds in Minimax Decentralized Hypothesis Testing

DOI10.1109/TSP.2016.2613072MaRDI QIDQ4620503zbMATH OpenOpenAlexFDO

Authors Gökhan Gül, Abdelhak M. Zoubir

Publication date 8 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1306.3618

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Minimax decentralized detection is studied under two scenarios: with and without a fusion center when the source of uncertainty is the Bayesian prior. When there is no fusion center, the constraints in the network design are determined. Both for a single decision maker and multiple decision makers, the maximum loss in detection performance due to minimax decision making is obtained. In the presence of a fusion center, the maximum loss of detection performance between with- and without fusion center networks is derived assuming that both networks are minimax robust. The results are finally generalized.

Cited in

(3)

• Fundamental structures and asymptotic performance criteria in decentralized binary hypothesis testing
• Asymptotic Optimality Theory for Decentralized Sequential Hypothesis Testing in Sensor Networks
• Asymptotic optimality of likelihood ratio threshold tests in decentralized detection

This page was built for publication: Theoretical Bounds in Minimax Decentralized Hypothesis Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620503)