By Topic

Robust detection and optimization with decentralized parallel sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gul, G. ; Signal Process. Group, Tech. Univ. Darmstadt, Darmstadt, Germany ; Zoubir, A.M.

In the first part of this paper, we derive a generic form of optimization for binary hypothesis testing. We show that information theoretical as well as the proposed singular value decomposition (s.v.d.) based optimization methods are special cases of this generalization. In terms of robustness, neither the information theoretical nor the s.v.d. based optimization method has a contribution for decentralized detection. The second part of the paper is concerned with the assignment of the costs for robust distributed detection without a fusion center. We show that the monotonicity rule should remain exactly the same as in distributed detection with a fusion center, meaning that sub-sets of this fusion rule cannot even include the simple fusion rules such as AND or OR.

Published in:

Signal Processing Advances in Wireless Communications (SPAWC), 2012 IEEE 13th International Workshop on

Date of Conference:

17-20 June 2012