Information Bounds and Quickest Change Detection in Decentralized Decision Systems

DOI10.1109/TIT.2005.850159zbMath1310.94038MaRDI QIDQ3547338

Yongguo Mei

Publication date: 21 December 2008

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

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Related Items (9)

Sequential Sensor Installation for Wiener Disorder Detection ⋮ Asymptotically Pointwise Optimal Change Detection in Multiple Channels ⋮ Asymptotically Optimal Quickest Change Detection in Distributed Sensor Systems ⋮ Data-Efficient Quickest Change Detection with On–Off Observation Control ⋮ Asymptotic statistical properties of communication-efficient quickest detection schemes in sensor networks ⋮ Consensus-based page's test in sensor networks ⋮ A discussion on ``Detection of intrusions in information systems by sequential change-point methods by Tartakovsky, Rozovskii, Blažek, and Kim ⋮ Byzantine Fault Tolerant Distributed Quickest Change Detection ⋮ Data-Efficient Minimax Quickest Change Detection in a Decentralized System

This page was built for publication: Information Bounds and Quickest Change Detection in Decentralized Decision Systems