Decentralized Sequential Detection with a Fusion Center Performing the Sequential Test

Venugopal V. Veeravalli; Tamer Başar; H. Vincent Poor

doi:10.1109/18.212274

Decentralized Sequential Detection with a Fusion Center Performing the Sequential Test

Venugopal V. Veeravalli, Tamer Başar, H. Vincent Poor

Research output: Contribution to journal › Article › peer-review

152 Scopus citations

Abstract

A decentralized sequential detection problem is considered in which each one of a set of sensors receives a sequence of observations about the hypothesis. Each sensor sends a sequence of summary messages to the fusion center where a sequential test is carried out to determine the true hypothesis. A Bayesian framework for this problem is introduced, and for the case when the information structure in the system is quasi-classical, it is shown that the problem is tractable. A detailed analysis of this case is presented along with some numerical results.

Original language	English (US)
Pages (from-to)	433-442
Number of pages	10
Journal	IEEE Transactions on Information Theory
Volume	39
Issue number	2
DOIs	https://doi.org/10.1109/18.212274
State	Published - Mar 1993

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Keywords

Decentralized detection
dy-
namic programming
sequential analysis

Access to Document

10.1109/18.212274

Cite this

@article{9280e134d91c4a1a9180bc25b883c15b,

title = "Decentralized Sequential Detection with a Fusion Center Performing the Sequential Test",

abstract = "A decentralized sequential detection problem is considered in which each one of a set of sensors receives a sequence of observations about the hypothesis. Each sensor sends a sequence of summary messages to the fusion center where a sequential test is carried out to determine the true hypothesis. A Bayesian framework for this problem is introduced, and for the case when the information structure in the system is quasi-classical, it is shown that the problem is tractable. A detailed analysis of this case is presented along with some numerical results.",

keywords = "Decentralized detection, dy-, namic programming, sequential analysis",

author = "Veeravalli, {Venugopal V.} and Tamer Ba{\c s}ar and Poor, {H. Vincent}",

note = "Funding Information: Manuscript received November 1, 1991; revised June 15, 1992. This work was supported in part by the Joint Services Electronics Program under Grant N00014-90-J-1270, through the University of Illinois, and in part by the Office of Naval Research under Grant N00014-89-J-1321, through Princeton University. This work was presented in part at the 1992 American Control Conference, Chicago, IL, June 24-26, 1992.",

year = "1993",

month = mar,

doi = "10.1109/18.212274",

language = "English (US)",

volume = "39",

pages = "433--442",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

T1 - Decentralized Sequential Detection with a Fusion Center Performing the Sequential Test

AU - Veeravalli, Venugopal V.

AU - Başar, Tamer

AU - Poor, H. Vincent

N1 - Funding Information: Manuscript received November 1, 1991; revised June 15, 1992. This work was supported in part by the Joint Services Electronics Program under Grant N00014-90-J-1270, through the University of Illinois, and in part by the Office of Naval Research under Grant N00014-89-J-1321, through Princeton University. This work was presented in part at the 1992 American Control Conference, Chicago, IL, June 24-26, 1992.

PY - 1993/3

Y1 - 1993/3

N2 - A decentralized sequential detection problem is considered in which each one of a set of sensors receives a sequence of observations about the hypothesis. Each sensor sends a sequence of summary messages to the fusion center where a sequential test is carried out to determine the true hypothesis. A Bayesian framework for this problem is introduced, and for the case when the information structure in the system is quasi-classical, it is shown that the problem is tractable. A detailed analysis of this case is presented along with some numerical results.

AB - A decentralized sequential detection problem is considered in which each one of a set of sensors receives a sequence of observations about the hypothesis. Each sensor sends a sequence of summary messages to the fusion center where a sequential test is carried out to determine the true hypothesis. A Bayesian framework for this problem is introduced, and for the case when the information structure in the system is quasi-classical, it is shown that the problem is tractable. A detailed analysis of this case is presented along with some numerical results.

KW - Decentralized detection

KW - dy-

KW - namic programming

KW - sequential analysis

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

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

U2 - 10.1109/18.212274

DO - 10.1109/18.212274

M3 - Article

AN - SCOPUS:0027558370

SN - 0018-9448

VL - 39

SP - 433

EP - 442

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 2

ER -

Decentralized Sequential Detection with a Fusion Center Performing the Sequential Test

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this