2014 IEEE International Conference on Communications (ICC) 2014
DOI: 10.1109/icc.2014.6883519
|View full text |Cite
|
Sign up to set email alerts
|

A new algorithm for distributed nonparametric sequential detection

Abstract: We consider non parametric sequential hypothesis testing problem when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to some other unknown distribution with some loose constraints. We propose a simple algorithm to address the problem. This is also generalized to the case when the distribution under the null hypothesis is not fully known. These problems are primarily motivated from wireless sensor networks and spectrum sensing in Cognitive Radios. A decentrali… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 29 publications
(61 reference statements)
0
10
0
Order By: Relevance
“…[3] less accurate and/or difficult to implement. Now we describe our basic distributed algorithm which has been shown to be asymptotically optimal and performs well at practical parameter values ( [27], [21]). It also makes an efficient use of the reporting MAC.…”
Section: System Model and Distributed Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…[3] less accurate and/or difficult to implement. Now we describe our basic distributed algorithm which has been shown to be asymptotically optimal and performs well at practical parameter values ( [27], [21]). It also makes an efficient use of the reporting MAC.…”
Section: System Model and Distributed Algorithmmentioning
confidence: 99%
“…Since Γ 0l > 0, this goes down exponentially to 0 with | log c| → ∞ at rate Γ 0l γ l . Now consider P 0 [sup 0≤k≤τ (c)Ŵk > | log c|], the second term on the RHS of ( 21). From Theorem 10 in [45], since {Ŵ k } is a submartingale, we get, for an α > 0 with E[e ≤ (e α0| log c| − 1)…”
Section: Appendixmentioning
confidence: 99%
See 1 more Smart Citation
“…Quickest change detection problem literature is summarized in [6]. Distributed sequential detection has been studied in [7], [8], [9] and [10]. The problem considered in [9] and [10] is of sequential distributed detection of two simple hypothesis when the distribution under both hypothesis is known.…”
Section: Introductionmentioning
confidence: 99%
“…In [7] and [8] Fusion Center (FC) noise is considered but handled very differently from [11] via physical layer fusion. The approach of [7] and [8] has an additional advantage that it requires a single low bandwidth reporting channel with minimal transmission delays. Our present algorithm differs from [7] and [8] in the local algorithms used by the CR nodes.…”
Section: Introductionmentioning
confidence: 99%