The Central Detection Officer problem: SALSA detector and performance guarantees

Xiao Li, H. Vincent Poor, Anna Scaglione

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper formulates the Central Detection Officer (CDO) problem in which a central officer decides if some agents in a network observe data from an anomalous distribution compared to the majority. Since the data statistics are unknown in advance, the goal of the CDO is to identify the data pattern of each agent and detect the presence and locations of anomalies by polling the agents strategically. To solve the CDO problem in a Gaussian multiple access channel, the Sparsity-Aware Least Squares Anomaly (SALSA) detection scheme is proposed, which combines a type-based encoder for the agents data with a compressive network polling scheme. The performances of the proposed scheme are analyzed theoretically and demonstrated numerically.

Original languageEnglish (US)
Title of host publication2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
PublisherIEEE Computer Society
Pages853-860
Number of pages8
ISBN (Print)9781479934096
DOIs
StatePublished - 2013
Externally publishedYes
Event51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 - Monticello, IL, United States
Duration: Oct 2 2013Oct 4 2013

Other

Other51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
CountryUnited States
CityMonticello, IL
Period10/2/1310/4/13

Fingerprint

Detectors
Statistics

Keywords

  • anomaly detection
  • compressive sensing
  • sparse recovery
  • type

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Li, X., Poor, H. V., & Scaglione, A. (2013). The Central Detection Officer problem: SALSA detector and performance guarantees. In 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 (pp. 853-860). [6736614] IEEE Computer Society. https://doi.org/10.1109/Allerton.2013.6736614

The Central Detection Officer problem : SALSA detector and performance guarantees. / Li, Xiao; Poor, H. Vincent; Scaglione, Anna.

2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society, 2013. p. 853-860 6736614.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, X, Poor, HV & Scaglione, A 2013, The Central Detection Officer problem: SALSA detector and performance guarantees. in 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013., 6736614, IEEE Computer Society, pp. 853-860, 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, Monticello, IL, United States, 10/2/13. https://doi.org/10.1109/Allerton.2013.6736614
Li X, Poor HV, Scaglione A. The Central Detection Officer problem: SALSA detector and performance guarantees. In 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society. 2013. p. 853-860. 6736614 https://doi.org/10.1109/Allerton.2013.6736614
Li, Xiao ; Poor, H. Vincent ; Scaglione, Anna. / The Central Detection Officer problem : SALSA detector and performance guarantees. 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society, 2013. pp. 853-860
@inproceedings{f207a7dbb99a4244977ea627050320c8,
title = "The Central Detection Officer problem: SALSA detector and performance guarantees",
abstract = "This paper formulates the Central Detection Officer (CDO) problem in which a central officer decides if some agents in a network observe data from an anomalous distribution compared to the majority. Since the data statistics are unknown in advance, the goal of the CDO is to identify the data pattern of each agent and detect the presence and locations of anomalies by polling the agents strategically. To solve the CDO problem in a Gaussian multiple access channel, the Sparsity-Aware Least Squares Anomaly (SALSA) detection scheme is proposed, which combines a type-based encoder for the agents data with a compressive network polling scheme. The performances of the proposed scheme are analyzed theoretically and demonstrated numerically.",
keywords = "anomaly detection, compressive sensing, sparse recovery, type",
author = "Xiao Li and Poor, {H. Vincent} and Anna Scaglione",
year = "2013",
doi = "10.1109/Allerton.2013.6736614",
language = "English (US)",
isbn = "9781479934096",
pages = "853--860",
booktitle = "2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - The Central Detection Officer problem

T2 - SALSA detector and performance guarantees

AU - Li, Xiao

AU - Poor, H. Vincent

AU - Scaglione, Anna

PY - 2013

Y1 - 2013

N2 - This paper formulates the Central Detection Officer (CDO) problem in which a central officer decides if some agents in a network observe data from an anomalous distribution compared to the majority. Since the data statistics are unknown in advance, the goal of the CDO is to identify the data pattern of each agent and detect the presence and locations of anomalies by polling the agents strategically. To solve the CDO problem in a Gaussian multiple access channel, the Sparsity-Aware Least Squares Anomaly (SALSA) detection scheme is proposed, which combines a type-based encoder for the agents data with a compressive network polling scheme. The performances of the proposed scheme are analyzed theoretically and demonstrated numerically.

AB - This paper formulates the Central Detection Officer (CDO) problem in which a central officer decides if some agents in a network observe data from an anomalous distribution compared to the majority. Since the data statistics are unknown in advance, the goal of the CDO is to identify the data pattern of each agent and detect the presence and locations of anomalies by polling the agents strategically. To solve the CDO problem in a Gaussian multiple access channel, the Sparsity-Aware Least Squares Anomaly (SALSA) detection scheme is proposed, which combines a type-based encoder for the agents data with a compressive network polling scheme. The performances of the proposed scheme are analyzed theoretically and demonstrated numerically.

KW - anomaly detection

KW - compressive sensing

KW - sparse recovery

KW - type

UR - http://www.scopus.com/inward/record.url?scp=84897674682&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897674682&partnerID=8YFLogxK

U2 - 10.1109/Allerton.2013.6736614

DO - 10.1109/Allerton.2013.6736614

M3 - Conference contribution

AN - SCOPUS:84897674682

SN - 9781479934096

SP - 853

EP - 860

BT - 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013

PB - IEEE Computer Society

ER -