English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study a problem of distributed detection of a stationary point event in alarge extent wireless sensor network ($\wsn$), where the event influences theobservations of the sensors only in the vicinity of where it occurs. An eventoccurs at an unknown time and at a random location in the coverage region (orregion of interest ($\ROI$)) of the $\wsn$. We consider a general sensing modelin which the effect of the event at a sensor node depends on the distancebetween the event and the sensor node; in particular, in the Boolean sensingmodel, all sensors in a disk of a given radius around the event are equallyaffected. Following the prior work reported in\cite{nikiforov95change_isolation},\cite{nikiforov03lower-bound-for-det-isolation},\cite{tartakovsky08multi-decision}, {\em the problem is formulated as that ofdetecting the event and locating it to a subregion of the $\ROI$ as early aspossible under the constraints that the average run length to false alarm($\tfa$) is bounded below by $\gamma$, and the probability of false isolation($\pfi$) is bounded above by $\alpha$}, where $\gamma$ and $\alpha$ are targetperformance requirements. In this setting, we propose distributed proceduresfor event detection and isolation (namely $\mx$, $\all$, and $\hall$), based onthe local fusion of $\CUSUM$s at the sensors. For these procedures, we obtainbounds on the maximum mean detection/isolation delay ($\add$), and on $\tfa$and $\pfi$, and thus provide an upper bound on $\add$ as$\min\{\gamma,1/\alpha\} \to \infty$. For the Boolean sensing model, we showthat an asymptotic upper bound on the maximum mean detection/isolation delay ofour distributed procedure scales with $\gamma$ and $\alpha$ in the same way asthe asymptotically optimal centralised procedure\cite{nikiforov03lower-bound-for-det-isolation}.

Distributed Detection/Isolation Procedures for Quickest Event Detection in Large Extent Wireless Sensor Networks