QUICKEST CHANGE DETECTION IN MULTIPLE ON-OFF PROCESSES

A Bayesian formulation of quickest change detection in multiple on-off processes is obtained within a decision-theoretic framework. For geometrically distributed busy and idle times, we show that the optimal joint design of channel switching and change detection has a simple threshold structure under a mild condition. Extensions to arbitrarily distributed busy and idle times, in particular, heavy tail distributions, are discussed. We show that this problem presents a fresh twist to the classic problem of quickest change detection that considers only one stochastic process. We demonstrate that the key to quickest change detection in multiple processes is to abandon the current process when its state is unlikely to change in the near future (as indicated by the measurements obtained so far) and seek opportunities in a new process to avoid realizations of long busy periods. This problem arises in spectrum opportunity detection in cognitive radio networks where a secondary user searches for idle channels in the spectrum.