TY - GEN
T1 - Quickest detection in censoring sensor networks
AU - Mei, Yajun
PY - 2011
Y1 - 2011
N2 - The quickest change detection problem is studied in a general context of monitoring a large number of data streams in sensor networks when the trigger event may affect different sensors differently. In particular, the occurring event could have an immediate or delayed impact on some unknown, but not necessarily all, sensors. Motivated by censoring sensor networks, scalable detection schemes are developed based on the sum of those local CUSUM statistics that are large under either hard thresholding or top-r thresholding rules or both. The proposed schemes are shown to possess certain asymptotic optimality properties.
AB - The quickest change detection problem is studied in a general context of monitoring a large number of data streams in sensor networks when the trigger event may affect different sensors differently. In particular, the occurring event could have an immediate or delayed impact on some unknown, but not necessarily all, sensors. Motivated by censoring sensor networks, scalable detection schemes are developed based on the sum of those local CUSUM statistics that are large under either hard thresholding or top-r thresholding rules or both. The proposed schemes are shown to possess certain asymptotic optimality properties.
UR - http://www.scopus.com/inward/record.url?scp=80054800363&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80054800363&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2011.6034390
DO - 10.1109/ISIT.2011.6034390
M3 - Conference contribution
AN - SCOPUS:80054800363
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2148
EP - 2152
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -