Information Bounds and Quickest Change Detection in Decentralized Decision Systems
Information Bounds and Quickest Change Detection in Decentralized Decision Systems
The quickest change detection problem is studied in decentralized decision systems, where a set of sensors receive independent observations and send summary messages to the fusion center, which makes a final decision. In the system where the sensors do not have access to their past observations, the previously conjectured asymptotic …