Download now Free registration required
The authors consider the problem of sensor selection for event detection in Wireless Sensor Networks (WSNs). They want to choose a subset of p out of n sensors that yields the best detection performance. As the sensor selection optimality criteria, they propose the Kullback-Leibler and Chernoff distances between the distributions of the selected measurements under the two hypotheses. They formulate the maxmin robust sensor selection problem to cope with the uncertainties in distribution means. They prove that the sensor selection problem is NP hard, for both Kullback-Leibler and Chernoff criteria. To (sub)optimally solve the sensor selection problem, they propose an algorithm of affordable complexity.
- Format: PDF
- Size: 599.64 KB