On the Sequential Test and Distributed Detection

We present a simple definition of stopping time and its role in the formulation of sequential tests for both centralized and distributed detection, providing a straightforward procedure for obtaining optimal decision rules. Upper bounds for optimal stopping time are derived and numerically shown to possess certain qualitative features expected of the optimal stopping time. The results are extended to any distributed detection network in the form of an acyclic directed graph.