Binary parallel distributed-detection architectures employ a bank of local detectors to observe a common volume of surveillance, and form binary local decisions about the existence or nonexistence of a target in that volume. The local decisions are transmitted to a central detector, the data fusion center (DFC), which integrates them to a global target or no target decision. Most studies of distributed-detection systems assume that the local detectors are synchronized. In practice local decisions are made asynchronously, and the DFC has to update its global decision continually. In this study the number of local decisions observed by the central detector within any observation period Is Poisson distributed. An optimal fusion rule is developed, and the sufficient statistic is shown to be a weighted sum of the local decisions collected by the DFC within the observation interval. The weights are functions of the individual local detector performance probabilities (Le., probabilities of false alarm and detection). In this respect the decision rule is similar to the one developed by Chair and Varshney for the synchronized system. Unlike the Chair—Varshney rule, however, the DFC's decision threshold in the asynchronous system is time varying. Exact expressions and asymptotic approximations are developed for the detection performance with the optimal rule. These expressions allow performance prediction and assessment of tradeoffs in realistic decision fusion architectures which operate over modern communication networks.
|Original language||English (US)|
|Number of pages||9|
|Journal||IEEE Transactions on Aerospace and Electronic Systems|
|State||Published - Jul 1994|
All Science Journal Classification (ASJC) codes
- Aerospace Engineering
- Electrical and Electronic Engineering