One shot schemes for decentralized quickest change detection

Abstract—This work considers the problem of quickest detection with distributed sensors that receive sequential observations ei-ther in discrete or in continuous time from the environment. These sensors employ cumulative sum (CUSUM) strategies and commu-nicate to a central fusion center by one shot schemes. One shot schemes are schemes in which the sensors communicate with the fusion center only once, via which they signal a detection. The com-munication is clearly asynchronous and the case is considered in which the fusion center employs a minimal strategy, which means that it declares an alarm when the first communication takes place. It is assumed that the observations received at the sensors are in-dependent and that the time points at which the appearance of a signal can take place are different. Both the cases of the same and different signal distributions across sensors are considered. It is shown that there is no loss of performance of one shot schemes as compared to the centralized case in an extended Lorden min-max sense, since the minimum of CUSUMs is asymptotically optimal as the mean time between false alarms increases without bound. In the case of different signal distributions the optimal threshold parameters are explicitly computed. Index Terms—Cumulative sum (CUSUM), one shot schemes, op-timal sensor threshold selection, quickest detection. I.