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. 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.