Byzantine Fault Tolerant Distributed Quickest Change Detection
From MaRDI portal
Publication:5252501
DOI10.1137/130924445zbMath1314.62187arXiv1306.2086OpenAlexW2963766209MaRDI QIDQ5252501
Publication date: 2 June 2015
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2086
Byzantine fault tolerancedistributed sensor network(non-Bayesian) quickest change detectionrobust optimal stopping in continuous and discrete time
Decentralized systems (93A14) Fault detection; testing in circuits and networks (94C12) Sequential statistical analysis (62L10)
Related Items (3)
Adversarially robust sequential hypothesis testing ⋮ Resilient Distributed Field Estimation ⋮ Are there needles in a moving haystack? Adaptive sensing for detection of dynamically evolving signals
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal stopping times for detecting changes in distributions
- A note on Ritov's Bayes approach to the minimax property of the cusum procedure
- Optimality of the CUSUM procedure in continuous time.
- The decentralized quickest detection problem
- Asymptotically Optimal Quickest Change Detection in Distributed Sensor Systems
- Quickest Detection
- Information Bounds and Quickest Change Detection in Decentralized Decision Systems
- The Byzantine Generals Problem
- Minimax optimality of the method of cumulative sums (cusum) in the case of continuous time
- Order Statistics
- Decentralized quickest change detection
- A novel approach to detection of intrusions in computer networks via adaptive sequential and batch-sequential change-point detection methods
- On the maximum drawdown of a Brownian motion
- Detecting changes in probabilities of a multi—component process
- One Shot Schemes for Decentralized Quickest Change Detection
- Procedures for Reacting to a Change in Distribution
This page was built for publication: Byzantine Fault Tolerant Distributed Quickest Change Detection
