By Topic

On the asymptotic relative efficiency of distributed detection schemes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Blum, R.S. ; Dept. of Comput. Sci. & Electr. Eng., Lehigh Univ., Bethlehem, PA, USA ; Kassam, S.A.

The asymptotic relative efficiency (ARE) of two centralized detection schemes has proved useful in large-sample-size and weak-signal performance analysis. In the present paper ARE is applied to some distributed detection cases which use counting fusion rules. In such cases one finds that ARE generally depends on the power of the tests which can make its application difficult. This dependence turns out to be relatively weak in the cases considered and the ARE is reasonably well approximated by the limit of the ARE as the detection probability approaches the false alarm probability. This approximation should be useful for distributed cases. Some specific results provide the best counting (k-out-of-N) fusion rules for cases with identical sensor detectors if one uses asymptotically large observation sample sizes at each sensor. These results indicate that for false alarm probabilities of less than 0.5, OR rules are generally never optimum

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 2 )