Information bounds and quickest change detection in decentralized decision systems

The quickest change detection problem is studied in decentralized decision systems, where a set of sensors receive independent observations and send summary messages to the fusion center, which makes a final decision. In the system where the sensors do not have access to their past observations, the previously conjectured asymptotic optimality of a procedure with a monotone likelihood ratio quantizer (MLRQ) is proved. In the case of additive Gaussian sensor noise, if the signal-to-noise ratios (SNR) at some sensors are sufficiently high, this procedure can perform as well as the optimal centralized procedure that has access to all the sensor observations. Even if all SNRs are low, its detection delay will be at most pi/2-1ap 57% larger than that of the optimal centralized procedure. Next, in the system where the sensors have full access to their past observations, the first asymptotically optimal procedure in the literature is developed. Surprisingly, the procedure has the same asymptotic performance as the optimal centralized procedure, although it may perform poorly in some practical situations because of slow asymptotic convergence. Finally, it is shown that neither past message information nor the feedback from the fusion center improves the asymptotic performance in the simplest model

[1]  Alʹbert Nikolaevich Shiri︠a︡ev,et al.  Optimal stopping rules , 1977 .

[2]  M. Pollak.  Optimal Detection of a Change in Distribution , 1985 .

[3]  S. Schwartz,et al.  Quickest detection for sequential decentralized decision systems , 1996, IEEE Transactions on Aerospace and Electronic Systems.

[4]  Venugopal V. Veeravalli.  Decentralized quickest change detection , 2001, IEEE Trans. Inf. Theory.

[5]  E. S. Page.  CONTINUOUS INSPECTION SCHEMES , 1954 .

[6]  Venugopal V. Veeravalli,et al.  An efficient sequential procedure for detecting changes in multichannel and distributed systems , 2002, Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997).

[7]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[8]  Michèle Basseville,et al.  Detection of Abrupt Changes: Theory and Applications. , 1995 .

[9]  W. Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[10]  A. Shiryaev.  On Optimum Methods in Quickest Detection Problems , 1963 .

[11]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[12]  John N. Tsitsiklis,et al.  Extremal properties of likelihood-ratio quantizers , 1993, IEEE Trans. Commun..

[13]  G. Lorden.  PROCEDURES FOR REACTING TO A CHANGE IN DISTRIBUTION , 1971 .

[14]  Tze Leung Lai,et al.  Information Bounds and Quick Detection of Parameter Changes in Stochastic Systems , 1998, IEEE Trans. Inf. Theory.

[15]  D. Siegmund.  Sequential Analysis: Tests and Confidence Intervals , 1985 .

[16]  G. Moustakides.  Optimal stopping times for detecting changes in distributions , 1986 .

[17]  Venugopal V. Veeravalli,et al.  Multihypothesis sequential probability ratio tests - Part II: Accurate asymptotic expansions for the expected sample size , 2000, IEEE Trans. Inf. Theory.

[18]  J. Kiefer,et al.  Asymptotically Optimum Sequential Inference and Design , 1963 .

[19]  Venugopal V. Veeravalli,et al.  Sequential decision fusion: theory and applications , 1999 .

[20]  D. Siegmund.  THE VARIANCE OF ONE-SIDED STOPPING RULES , 1969 .

[21]  T. Lai.  Sequential changepoint detection in quality control and dynamical systems , 1995 .

[22]  H. Vincent Poor,et al.  Decentralized Sequential Detection with a Fusion Center Performing the Sequential Test , 1992, 1992 American Control Conference.

[23]  D. Siegmund,et al.  Using the Generalized Likelihood Ratio Statistic for Sequential Detection of a Change-Point , 1995 .

[24]  Y. Mei.  Asymptotically optimal methods for sequential change-point detection , 2003 .

[25]  George Cybenko,et al.  Efficient computation of the hidden Markov model entropy for a given observation sequence , 2005, IEEE Transactions on Information Theory.

[26]  E. Lehmann,et al.  Testing Statistical Hypothesis. , 1960 .

[27]  Tze Leung Lai.  Sequential multiple hypothesis testing and efficient fault detection-isolation in stochastic systems , 2000, IEEE Trans. Inf. Theory.