A Spectral Clustering Approach to Validating Sensors via Their Peers in Distributed Sensor Networks

In a distributed sensor network, the goodness of a sensor may change according to its current device status (e.g. health of hardware) and environment (e.g. wireless reception conditions at the sensor location). As a result, it is often necessary to validate periodically sensors in the field, in order to identify those which no longer work properly and eliminate them from applications' use. In this paper, we describe a spectral clustering approach of using peer sensors to identify these bad sensors. Using a simple model problem, we describe how our sensor validation method works and demonstrate its performance in simulation.

[1]  Bruce W. Suter,et al.  A Hub Matrix Theory and Applications to Wireless Communications , 2007, EURASIP J. Adv. Signal Process..

[2]  H. Kung,et al.  Sign-based spectral clustering , 2010, 2010 25th Biennial Symposium on Communications.

[3]  Ying Zhang,et al.  Localization from connectivity in sensor networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[4]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[5]  David Kempe,et al.  A decentralized algorithm for spectral analysis , 2008, J. Comput. Syst. Sci..

[6]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[7]  M. Fiedler Algebraic connectivity of graphs , 1973 .

[8]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[9]  Dario Vlah,et al.  Validating sensors in the field via spectral clustering based on their measurement data , 2009, MILCOM 2009 - 2009 IEEE Military Communications Conference.

[10]  H. T. Kung,et al.  Localization with snap-inducing shaped residuals (SISR): coping with errors in measurement , 2009, MobiCom '09.