Globally optimal computable didstributed decision fusion

The problem of distributed decision fusion in parallel sensor configuration is considered. It is shown that the optimal combining scheme is the Neyman-Pearson test at the sensors and the decision fusion. Computationally efficient algorithms that allow the determination of near-to-optimal solutions are developed. The algorithms are shown to perform very close to the optimal solution in all the examined cases.