DocumentCode
3355808
Title
Decentralized data-efficient quickest change detection
Author
Banerjee, Taposh ; Veeravalli, Venugopal V. ; Tartakovsky, Alexander
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Illinois, Urbana, IL, USA
fYear
2013
fDate
7-12 July 2013
Firstpage
2587
Lastpage
2591
Abstract
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.
Keywords
distributed algorithms; minimax techniques; sensor fusion; DE-All algorithm; decentralized quickest change de- tection; distributed algorithm; minimax problem formulation; on-off observation control; sensor; Algorithm design and analysis; Delays; Educational institutions; Information theory; Manganese; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location
Istanbul
ISSN
2157-8095
Type
conf
DOI
10.1109/ISIT.2013.6620694
Filename
6620694
Link To Document