One Shot Schemes for Decentralized Quickest Change Detection

DOI10.1109/TIT.2009.2021311MaRDI QIDQ4975935zbMATH OpenFDO

Authors Olympia Hadjiliadis, Hongzhong Zhang, H. Vincent Poor

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2009.2021311

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Cited in

(9)

• Multi-sensor slope change detection
• Are there needles in a moving haystack? Adaptive sensing for detection of dynamically evolving signals
• Sequential sensor installation for Wiener disorder detection
• The decentralized quickest detection problem
• Bayesian quickest detection in sensor arrays
• Sequential algorithms for moving anomaly detection in networks
• Occupation times, drawdowns, and drawups for one-dimensional regular diffusions
• Byzantine Fault Tolerant Distributed Quickest Change Detection
• Robustness of the \(N\)-CUSUM stopping rule in a Wiener disorder problem

This page was built for publication: One Shot Schemes for Decentralized Quickest Change Detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975935)