TY - GEN
T1 - Energy-efficient quickest change detection in sensor networks
AU - Banerjee, Taposh
AU - Veeravalli, Venugopal Varadachari
PY - 2012/11/6
Y1 - 2012/11/6
N2 - We propose a minimax formulation for quickest change detection in sensor networks, where there is a cost associated with taking observations at each sensor. We present two energy efficient algorithms, centralized and distributed, in which on-off observation control is employed and the change is detected under a constraint on the false alarm rate. We show that these algorithms are asymptotically optimal as the false alarm rate goes to zero and have good performance compared to the straightforward approach of fractional sampling in which the observations are selected randomly.
AB - We propose a minimax formulation for quickest change detection in sensor networks, where there is a cost associated with taking observations at each sensor. We present two energy efficient algorithms, centralized and distributed, in which on-off observation control is employed and the change is detected under a constraint on the false alarm rate. We show that these algorithms are asymptotically optimal as the false alarm rate goes to zero and have good performance compared to the straightforward approach of fractional sampling in which the observations are selected randomly.
KW - Asymptotic Optimality
KW - Minimax
KW - Observation Control
KW - Quickest Change Detection
UR - http://www.scopus.com/inward/record.url?scp=84868241333&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84868241333&partnerID=8YFLogxK
U2 - 10.1109/SSP.2012.6319781
DO - 10.1109/SSP.2012.6319781
M3 - Conference contribution
AN - SCOPUS:84868241333
SN - 9781467301831
T3 - 2012 IEEE Statistical Signal Processing Workshop, SSP 2012
SP - 636
EP - 639
BT - 2012 IEEE Statistical Signal Processing Workshop, SSP 2012
T2 - 2012 IEEE Statistical Signal Processing Workshop, SSP 2012
Y2 - 5 August 2012 through 8 August 2012
ER -