The problem of optimum detection with n decentralized sensors selecting among m possible signals is considered from the decision theory point of view. The loss function is defined in terms of the decisions made by each observer and the transmitted signal. Then the average of this loss function is minimized. This leads to sets of coupled inequalities in terms of the likelihood ratio of each observer and the decisions made at the other sensors. This determines the structure of the optimum decentralized detection for an arbitrary number of sensors and an arbitrary number of possible signals. These results are valuable in numerous situations that may arise in large-scale and distributed systems.
Hypotheses Testing in a Distributed Environment
IEEE Transactions on Aerospace and Electronic Systems ; AES-22 , 2 ; 134-137
1986-03-01
798015 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Efficient Mobile Mesh Networking: Testing Scalability Hypotheses
British Library Conference Proceedings | 2005
|K-stage Procedures of Testing Statistical Hypotheses
British Library Online Contents | 1996
|K-Step Procedures of Testing Statistical Hypotheses
British Library Online Contents | 1996
|Modified K-Stage Procedures for Testing Statistical Hypotheses
British Library Online Contents | 1998
|