Localization of wireless sensors using compressive sensing for manifold learning

In this paper, a novel compressive sensing for manifold learning protocol (CSML) is proposed for localization in wireless sensor networks (WSNs). Intersensor communication costs are reduced significantly by applying the theory of compressive sensing, which indicates that sparse signals can be recovered from far fewer samples than that needed by the Nyquist sampling theorem. We represent the pair-wise distance measurement as a sparse matrix. Instead of sending full pair-wise measurement data to a central node, each sensor transmits only a small number of compressive measurements. And the full pair-wise distance matrix can be well reconstructed from these noisy compressive measurements in the central node, only through an ℓ1-minimization algorithm. The proposed method reduces the overall communication bandwidth requirement per sensor such that it increases logarithmically with the number of sensors and linearly with the number of neighbors, while achieves high localization accuracy. CSML is especially suitable for manifold learning based localization algorithms. Simulation results demonstrate the performance of the proposed protocol on both the localization accuracy and the communication cost reduction.

[1]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[2]  Neal Patwari,et al.  Distributed Multidimensional Scaling with Adaptive Weighting for Node Localization in Sensor Networks , 2004 .

[3]  R.L. Moses,et al.  Locating the nodes: cooperative localization in wireless sensor networks , 2005, IEEE Signal Processing Magazine.

[4]  Joshua B. Tenenbaum,et al.  Sparse multidimensional scaling using land-mark points , 2004 .

[5]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[6]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[7]  Alfred O. Hero,et al.  Manifold learning algorithms for localization in wireless sensor networks , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[8]  Paul E. Green,et al.  Multidimensional Scaling: Concepts and Applications , 1989 .

[9]  Alfred O. Hero,et al.  Distributed weighted-multidimensional scaling for node localization in sensor networks , 2006, TOSN.

[10]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

[11]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[12]  Xiang Ji,et al.  Sensor positioning in wireless ad-hoc sensor networks using multidimensional scaling , 2004, IEEE INFOCOM 2004.

[13]  Zafer Sahinoglu,et al.  The Cramer-Rao bounds of hybrid TOA/RSS and TDOA/RSS location estimation schemes , 2004, IEEE Communications Letters.