Information Bounds and Quickest Change Detection in Decentralized Decision Systems
From MaRDI portal
Publication:3547338
DOI10.1109/TIT.2005.850159zbMath1310.94038MaRDI QIDQ3547338
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
94A13: Detection theory in information and communication theory
Related Items
Asymptotic statistical properties of communication-efficient quickest detection schemes in sensor networks, Byzantine Fault Tolerant Distributed Quickest Change Detection, Data-Efficient Minimax Quickest Change Detection in a Decentralized System, Data-Efficient Quickest Change Detection with On–Off Observation Control, A discussion on ``Detection of intrusions in information systems by sequential change-point methods by Tartakovsky, Rozovskii, Blažek, and Kim, Consensus-based page's test in sensor networks, Asymptotically Pointwise Optimal Change Detection in Multiple Channels, Sequential Sensor Installation for Wiener Disorder Detection, Asymptotically Optimal Quickest Change Detection in Distributed Sensor Systems