2009 International Conference on Future Computer and Communication 2009
DOI: 10.1109/icfcc.2009.105
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis of a General Tree Structure for Target Detection in Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…For conditionally dependent observations, the optimal fusion rules become intractable; they do not reduce to likelihood ratio tests. Recently, distributed detection algorithms have also been investigated under several communication constraints (Mirjalily et al, 2003;Varaee et al, 2009;Chen et al, 2004;Aldosari and Moura, 2005;Fabeck and Mathar, 2009;Quan et al, 2008Quan et al, , 2009). All the aforementioned algorithms focus on In this paper, under the background of underwater distributed detection using multiple sensors in the deep sea, a new united detection fusion and communication strategy is proposed.…”
Section: Introductionmentioning
confidence: 99%
“…For conditionally dependent observations, the optimal fusion rules become intractable; they do not reduce to likelihood ratio tests. Recently, distributed detection algorithms have also been investigated under several communication constraints (Mirjalily et al, 2003;Varaee et al, 2009;Chen et al, 2004;Aldosari and Moura, 2005;Fabeck and Mathar, 2009;Quan et al, 2008Quan et al, , 2009). All the aforementioned algorithms focus on In this paper, under the background of underwater distributed detection using multiple sensors in the deep sea, a new united detection fusion and communication strategy is proposed.…”
Section: Introductionmentioning
confidence: 99%