2011/05/30 by Premkumar Karumbu, K. Premkumar, Karumbu, Premkumar +4
Computer Science · Decision Sciences · Engineering · Mathematics · #Advanced Statistical Process Monitoring #Applications (stat.AP) #Distributed Sensor Networks and Detection Algorithms #FOS: Computer and information sciences #Fault Detection and Control Systems #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #cs.IT #cs.NI #math.IT #stat.AP
paper · pdf · doi:10.48550/arxiv.1105.6061
Submitted to IEEE Transactions on Signal Processing, Mar. 10, 2011. Revised on Jul. 17, 2011. A part of this work was presented in Forty-Seventh Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, Sep. - Oct. 2009
openalex publication_date 2011/05/30 · arxiv created 2011/07/18 · arxiv updated 2011/07/19 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We study a problem of distributed detection of a stationary point event in a large extent wireless sensor network (\wsn), where the event influences the observations of the sensors only in the vicinity of where it occurs. An event occurs at an unknown time and at a random location in the coverage region (or region of interest (\ROI)) of the \wsn. We consider a general sensing model in which the effect of the event at a sensor node depends on the distance between the event and the sensor node; in particular, in the Boolean sensing model, all sensors in a disk of a given radius around the event are equally affected. Following the prior work reported in \citenikiforov95changeisolation, \citenikiforov03lower-bound-for-det-isolation, \citetartakovsky08multi-decision, \em the problem is formulated as that of detecting the event and locating it to a subregion of the \ROI as early as possible under the constraints that the average run length to false alarm (\tfa) is bounded below by γ, and the probability of false isolation (\pfi) is bounded above by α, where γ and α are target performance requirements. In this setting, we propose distributed procedures for event detection and isolation (namely \mx, \all, and \hall), based on the local fusion of \CUSUMs at the sensors. For these procedures, we obtain bounds on the maximum mean detection/isolation delay (\add), and on \tfa and \pfi, and thus provide an upper bound on \add as min\γ,1/α\ → ∞. For the Boolean sensing model, we show that an asymptotic upper bound on the maximum mean detection/isolation delay of our distributed procedure scales with γ and α in the same way as the asymptotically optimal centralised procedure \citenikiforov03lower-bound-for-det-isolation.