Decentralised detection strategies under communication constraints
Decision maker
Decision rule
Detection theory
False alarm
DOI:
10.1049/ip-rsn:19982129
Publication Date:
2002-07-26T11:03:36Z
AUTHORS (3)
ABSTRACT
Decentralised detection systems with parallel decision fusion topology have received significant attention, especially for surveillance radar systems. Typically, a deterministic test (DT) is employed, and the optimal local strategies rule are determined according to Neyman–Pearson (N–P) criterion. The authors show how, in practical applications, communication bottle-neck may significantly limit performance of distributed employing conventional DT. A paradigm introduced decentralised under constraints, based on concept dependent randomisation (or scheduling) rules. Numerical results that proposed approach provides improved over tests, moderate increase system complexity; improvement particularly noticeable spiky (non-Gaussian) clutter environments.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (26)
CITATIONS (25)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....