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

The heterogeneous distributed quickest change detection (HetDQCD) problemwith 1-bit feedback is studied, in which a fusion center monitors an abruptchange through a bunch of heterogeneous sensors via anonymous 1-bit feedbacks.Two fusion rules, one-shot and voting rules, are considered. We analyze theperformance in terms of the worst-case expected detection delay and the averagerun length to false alarm for the two fusion rules. Our analysis unveils themixed impact of involving more sensors into the decision and enables us to findnear optimal choices of parameters in the two schemes. Notably, it is shownthat, in contrast to the homogeneous setting, the first alarm rule may nolonger lead to the best performance among one-shot schemes. The non-anonymoussetting is then investigated where a novel weighted voting rule is proposedthat assigns different weights to votes from different types of sensors.Simulation results show that the proposed scheme is able to outperform all theabove schemes and the mixture CUSUM scheme for the anonymous HetDQCD, hintingat the price of anonymity.

Bandwidth-Constrained Distributed Quickest Change Detection in Heterogeneous Sensor Networks: Anonymous vs Non-Anonymous Settings