On Distributed Fault-Tolerant Detection in Wireless Sensor Networks
IEEE Transactions on Computers
Energy-driven detection scheme with guaranteed accuracy
Proceedings of the 5th international conference on Information processing in sensor networks
The reliability of detection in wireless sensor networks: modeling and analyzing
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
On learning for fusion over fading channels in wireless sensor networks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Dynamic cooperator selection in cognitive radio networks
Ad Hoc Networks
Information Sciences: an International Journal
| Hi-index | 754.84 |
We consider the problem of binary hypothesis testing using binary decisions from independent and identically distributed (i.i.d). sensors. Identical likelihood-ratio quantizers with threshold λ are used at the sensors to obtain sensor decisions. Under this condition, the optimal fusion rule is known to be a k-out-of-n rule with threshold k. For the Bayesian detection problem, we show that given k, the probability of error is a quasi-convex function of λ and has a single minimum that is achieved by the unique optimal λopt . Except for the trivial situation where one hypothesis is always decided, we obtain a sufficient and necessary condition on λopt, and show that λopt can be efficiently obtained via the SECANT algorithm. The overall optimal solution is obtained by optimizing every pair of (k, λ). For the Neyman-Pearson detection problem, we show that the use of the Lagrange multiplier method is justified for a given fixed k since the objective function is a quasi-convex function of λ. We further show that the receiver operating characteristic (ROC) for a fixed k is concave downward