Generalized analysis of a distributed energy efficient algorithm for change detection
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
One shot schemes for decentralized quickest change detection
IEEE Transactions on Information Theory
Amplify and forward for correlated data gathering over hierarchical sensor networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Bayesian quickest change process detection
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Restless watchdog: selective quickest spectrum sensing in multichannel cognitive radio systems
EURASIP Journal on Advances in Signal Processing - Special issue on dynamic spectrum access for wireless networking
Collaborative quickest spectrum sensing via random broadcast in cognitive radio systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Cooperative quickest spectrum sensing in cognitive radios with unknown parameters
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Restless watchdog: monitoring multiple bands with blind period in cognitive radio systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Quickest change detection of a Markov process across a sensor array
IEEE Transactions on Information Theory
Collaborative quickest spectrum sensing via random broadcast in cognitive radio systems
IEEE Transactions on Wireless Communications
Quickest detection in multiple on-off processes
IEEE Transactions on Signal Processing
Consensus-based Page's test in sensor networks
Signal Processing
Optimal shot detection and recognition using Shiryaev-Roberts statistics
Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
Delay optimal event detection on ad hoc wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 754.96 |
A decentralized formulation of the quickest change detection problem is studied, where the distributions of the observations at all of the sensors in the system change at the time of disruption, and the sensors communicate with a common fusion center. A Bayesian setting is considered in which a priori knowledge of the change time distribution is available. The observations are assumed to be independent from sensor to sensor, conditioned on the change hypothesis. An optimal solution to the problem is derived under a quasi-classical information structure, where each sensor retains only its messages from the past (restricted local memory), and receives feedback from the fusion center about the past messages of the other sensors (full feedback). A technique for implementation of the optimal solution is given, and the solution is extended to the situation where a priori change time distribution information is not available. The structure of the optimal solution is then used to arrive at a simple suboptimal policy that does not require any past massage information. Numerical examples are given, which illustrate that the optimal solution offers little improvement over the suboptimal one, i.e., that feedback from the fusion center cannot be exploited to improve performance