TY - GEN
T1 - Decentralized data-efficient quickest change detection
AU - Banerjee, Taposh
AU - Veeravalli, Venugopal V.
AU - Tartakovsky, Alexander
PY - 2013
Y1 - 2013
N2 - The problem of decentralized quickest change detection is studied with an additional constraint on the cost of observations used at each sensor. Minimax problem formulations are proposed for the problem. A distributed algorithm called the DE-All algorithm is proposed in which on-off observation control is employed locally at each sensor. It is shown that the proposed algorithm is asymptotically optimal up to first order for the proposed formulations.
AB - The problem of decentralized quickest change detection is studied with an additional constraint on the cost of observations used at each sensor. Minimax problem formulations are proposed for the problem. A distributed algorithm called the DE-All algorithm is proposed in which on-off observation control is employed locally at each sensor. It is shown that the proposed algorithm is asymptotically optimal up to first order for the proposed formulations.
UR - http://www.scopus.com/inward/record.url?scp=84890365201&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84890365201&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2013.6620694
DO - 10.1109/ISIT.2013.6620694
M3 - Conference contribution
AN - SCOPUS:84890365201
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2587
EP - 2591
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -