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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Hypotheses Testing in a Distributed Environment


    Contributors:

    Published in:

    Publication date :

    1986-03-01


    Size :

    798015 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Efficient Mobile Mesh Networking: Testing Scalability Hypotheses

    Methley, S. / Crisp, M. / Newman, J. et al. | British Library Conference Proceedings | 2005


    K-stage Procedures of Testing Statistical Hypotheses

    Sosulin, Y. G. / Gavrilov, K. Y. | British Library Online Contents | 1996


    K-Step Procedures of Testing Statistical Hypotheses

    Sosulin, Y. G. / Gavrilov, K. Y. | British Library Online Contents | 1996


    Modified K-Stage Procedures for Testing Statistical Hypotheses

    Sosulin, Y. G. / Gavrilov, K. Y. | British Library Online Contents | 1998


    Optimal Distributed Detection of Multiple Hypotheses using Blind Algorithm

    Bin Liu, / Jeremić, Aleksandar / Wong, Kon Max | IEEE | 2011