On counting rules in distributed detection

1 May 1989

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing

Vol. 37 (5) , 772-775
https://doi.org/10.1109/29.17574

Abstract

A distributed network of n identical sensors sending their binary decisions to a fusion center is studied. The asymptotic performance of k out of n rules at the fusion center for finite k (finite (n-k)) is evaluated. For these rules, the error probability of making a wrong decision does not tend to zero as n to infinity , unless the probability distributions under the hypothesis satisfy certain conditions. For a specific detection example, the asymptotic performances of the OR (k=1) rule and the AND (k=n) rule are worse than that of a single sensor.

Keywords

This publication has 9 references indexed in Scilit:

Optimal serial distributed decision fusion
IEEE Transactions on Aerospace and Electronic Systems, 1988
Decentralized detection by a large number of sensors
Mathematics of Control, Signals, and Systems, 1988
Optimal Decision Fusion in Multiple Sensor Systems
IEEE Transactions on Aerospace and Electronic Systems, 1987
Optimal Detection and Performance of Distributed Sensor Systems
IEEE Transactions on Aerospace and Electronic Systems, 1987
On threshold rules in decentralized detection
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
Distributed radar detection theory
IEE Proceedings F Communications, Radar and Signal Processing, 1986
On the complexity of decentralized decision making and detection problems
IEEE Transactions on Automatic Control, 1985
Detection with Distributed Sensors
IEEE Transactions on Aerospace and Electronic Systems, 1981
Detectors for discrete-time signals in non-Gaussian noise
IEEE Transactions on Information Theory, 1972