OPTIMAL SERIAL DISTRIBUTED DECISION FUSION

The problem of distributed detection involving N sensors is considered. The configuration of sensors is serial in the sense that the jth sensor decides using the decision it receives along with its own observation. When each sensor uses the Neyman-Pearson test, the probability of detection is maximized for a given probability of false alarm, at the Nth stage. With two sensors, the serial scheme has a performance better than or equal to the parallel fusion scheme analyzed in the literature. Numerical examples illustrate the global optimization by the selection of operating thresholds at the sensors.