Sequential distributed detection for multisensor data

A sequential detection algorithm is formulated for a distributed detection scheme. The data are obtained from m distant sensors. The jth sensor produces a finite-valued output u/sub j/, which is transmitted to the central detector. Data are obtained until one of two thresholds is crossed and then a decision is made. The authors analyze the performance of this distributed sequential detection scheme, and they consider the optimization of the local processors, at the front end of the sensors.<<ETX>>

[1]  Nils Sandell,et al.  Detection with Distributed Sensors , 1980, IEEE Transactions on Aerospace and Electronic Systems.

[2]  Demosthenis Teneketzis.  The decentralized quickest detection problem , 1982, 1982 21st IEEE Conference on Decision and Control.

[3]  Z. Chair,et al.  Neyman-Pearson hypothesis testing in distributed networks , 1987, 26th IEEE Conference on Decision and Control.

[4]  Demosthenis Teneketzis.  The decentralized quickest detection problem , 1982, CDC 1982.

[5]  R. Srinivasan.  Distributed radar detection theory , 1986 .

[6]  L.W. Nolte,et al.  Design and Performance Comparison of Distributed Detection Networks , 1987, IEEE Transactions on Aerospace and Electronic Systems.

[7]  Ramanarayanan Viswanathan,et al.  Optimal Decision Fusion in Multiple Sensor Systems , 1987, IEEE Transactions on Aerospace and Electronic Systems.