Parallel Distributed Neyman-Pearson Detection with Privacy Constraints
2014 (English)In: Proceedings of the IEEE International Conference on Communications (ICC) 2014 Workshop, 2014, 765-770 p.Conference paper (Refereed)
In this paper, the privacy problem of a parallel distributed detection system vulnerable to an eavesdropper is proposed and studied in the Neyman-Pearson formulation. The privacy leakage is evaluated by a metric related to the Neyman-Pearson criterion. We will show that it is sufficient to consider a deterministic likelihood-ratio test for the optimal detection strategy at the eavesdropped sensor. This fundamental insight helps to simplify the problem to find the optimal privacy-constrained distributed detection system design. The trade-off between the detection performance and privacy leakage is illustrated in a numerical example.
Place, publisher, year, edition, pages
2014. 765-770 p.
Detection performance, Distributed detection system, Likelihood-ratio test, Neyman - Pearson criterion, Neyman pearson detection, Optimal detection, Privacy constraints, Privacy problems
Communication Systems Signal Processing
IdentifiersURN: urn:nbn:se:kth:diva-142040DOI: 10.1109/ICCW.2014.6881292ISI: 000346123100129ScopusID: 2-s2.0-84906767126ISBN: 978-1-4799-4640-2OAI: oai:DiVA.org:kth-142040DiVA: diva2:699677
IEEE International Conference on Communications (ICC) Workshop, Sydney, Australia, Jun. 10-14, 2014
QC 20150122. QC 201603142014-02-282014-02-282016-03-14Bibliographically approved