Sensor Selection for Event Detection in Wireless Sensor Networks

We consider the problem of sensor selection for event detection in wireless sensor networks (WSNs). We want to choose a subset of p out of n sensors that yields the best detection performance. As the sensor selection optimality criteria, we propose the Kullback-Leibler and Chernoff distances between the distributions of the selected measurements under the two hypothesis. We formulate the maxmin robust sensor selection problem to cope with the uncertainties in distribution means. We prove that the sensor selection problem is NP hard, for both Kullback-Leibler and Chernoff criteria. To (sub)optimally solve the sensor selection problem, we propose an algorithm of affordable complexity. Extensive numerical simulations on moderate size problem instances (when the optimum by exhaustive search is feasible to compute) demonstrate the algorithm's near optimality in a very large portion of problem instances. For larger problems, extensive simulations demonstrate that our algorithm outperforms random searches, once an upper bound on computational time is set. We corroborate numerically the validity of the Kullback-Leibler and Chernoff sensor selection criteria, by showing that they lead to sensor selections nearly optimal both in the Neyman-Pearson and Bayes sense.

[1]  R. Govindan,et al.  Utility-based sensor selection , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[2]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[3]  Stephen P. Boyd,et al.  Sensor Selection via Convex Optimization , 2009, IEEE Transactions on Signal Processing.

[4]  L.M. Kaplan,et al.  Local node selection for localization in a distributed sensor network , 2006, IEEE Transactions on Aerospace and Electronic Systems.

[5]  Feng Zhao,et al.  Information-Driven Dynamic Sensor Collaboration for Tracking Applications , 2002 .

[6]  Feng Zhao,et al.  Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks , 2002, Int. J. High Perform. Comput. Appl..

[7]  Ruzena Bajcsy,et al.  The Sensor Selection Problem for Bounded Uncertainty Sensing Models , 2005, IEEE Transactions on Automation Science and Engineering.

[8]  Maurice Queyranne,et al.  An Exact Algorithm for Maximum Entropy Sampling , 1995, Oper. Res..

[9]  Yao-tang Li,et al.  On Schur complement of block diagonally dominant matrices , 2006 .

[10]  Biagio Ricceri,et al.  Minimax theory and applications , 1998 .

[11]  John W. Fisher,et al.  Maximum Mutual Information Principle for Dynamic Sensor Query Problems , 2003, IPSN.

[12]  Shuguang Cui,et al.  Optimal Linear Cooperation for Spectrum Sensing in Cognitive Radio Networks , 2008, IEEE Journal of Selected Topics in Signal Processing.

[13]  Feng Zhao,et al.  Information-driven dynamic sensor collaboration , 2002, IEEE Signal Process. Mag..

[14]  Andreas Krause,et al.  Near-optimal sensor placements in Gaussian processes , 2005, ICML.

[15]  Shuguang Cui,et al.  Optimal Linear Fusion for Distributed Detection Via Semidefinite Programming , 2010, IEEE Transactions on Signal Processing.

[16]  B. Sinopoli,et al.  Robust linear dimensionality reduction for hypothesis testing with application to sensor selection , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[17]  Geir Hovland,et al.  Dynamic sensor selection for robotic systems , 1997, Proceedings of International Conference on Robotics and Automation.

[18]  Mohsen A. Jafari,et al.  Genetic algorithm convergence study for sensor network optimization , 2001, Inf. Sci..

[19]  Boris Polyak.  Convexity of Quadratic Transformations and Its Use in Control and Optimization , 1998 .

[20]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[21]  Georgios B. Giannakis,et al.  Selecting reliable sensors via convex optimization , 2010, 2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[22]  Danny Dolev,et al.  Distributed Sensor Selection using a Truncated Newton Method , 2009, 0907.0931.

[23]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[24]  Luis Rueda,et al.  Linear dimensionality reduction by maximizing the Chernoff distance in the transformed space , 2008, Pattern Recognit..

[25]  YangQuan Chen,et al.  Feasibility analysis on optimal sensor selection in cyber-physical systems , 2009, 2009 American Control Conference.

[26]  W. J. Studden,et al.  Theory Of Optimal Experiments , 1972 .

[27]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[28]  Luis Rueda,et al.  On the Performance of Chernoff-Distance-Based Linear Dimensionality Reduction Techniques , 2006, Canadian Conference on AI.

[29]  João M. F. Xavier,et al.  Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[30]  L.M. Kaplan,et al.  Global node selection for localization in a distributed sensor network , 2006, IEEE Transactions on Aerospace and Electronic Systems.

[31]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[32]  L. Brickman.  ON THE FIELD OF VALUES OF A MATRIX , 1961 .