Collaborative Quickest Detection in Adhoc Networks With Delay Constraint - Part I: Two-Node Network

Collaborative quickest detection is used to detect a certain distribution change in an adhoc network, in which there is no data fusion center and local decisions need to be made at all nodes. In this part of the authors' two-part paper, a two-thread CUmulative SUM (CUSUM) algorithm is proposed for a simple two-node network. The corresponding performance, particularly the performance gain induced by collaboration, is analyzed. Numerical results are provided to verify the theoretical analysis. In the sequel, they extend their study to the general multi-node case, and further consider block transmission mode and correlated observations.