Title
Optimal Neyman-Pearson fusion in two-dimensional sensor networks with serial architecture and dependent observations
Abstract
In this correspondence, we consider a sensor network with serial architecture. When solving a binary distributed detection problem where the sensor observations are dependent under each one of the two possible hypothesis, each fusion stage of the network applies a local decision rule. We assume that, based on the information available at each fusion stage, the decision rules provide a binary message regarding the presence or absence of an event of interest. Under this scenario and under a Neyman-Pearson formulation, we derive the optimal decision rules associated with each fusion stage. As it happens when the sensor observations are independent, we are able to show that, under the Neyman-Pearson criterion, the optimal fusion rules of a serial configuration with dependent observations also match optimal Neyman-Pearson tests.
Year
Venue
Keywords
2011
Information Fusion
decision theory,sensor fusion,wireless sensor networks,binary distributed detection problem,local decision rule,optimal Neyman-Pearson fusion,sensor dependent observations,serial architecture,two-dimensional sensor networks,Neyman-Pearson criterion,dependent observations,optimum distributed detection,serial network topology
Field
DocType
ISBN
Decision rule,Optimal decision,Computer science,Fusion rules,Sensor fusion,Network topology,Artificial intelligence,Decision theory,Wireless sensor network,Machine learning,Binary number
Conference
978-1-4577-0267-9
Citations 
PageRank 
References 
0
0.34
3
Authors
5