A Perturbed Compressed Sensing Protocol for Crowd Sensing

Crowd sensing network is a data-centric network consisting of many participants uploading environmental data by smart mobile devices or predeployed sensors; however, concerns about communication complexity and data confidentiality arise in real application. Recently, Compressed Sensing (CS) is a booming theory which employs nonadaptive linear projections to reduce data quantity and then reconstructs the original signal. Unfortunately, privacy issues induced by untrusted network still remain to be unsettled practically. In this paper, we consider crowd sensing using CS in wireless sensor network (WSN) as the application scenario and propose a data collection protocol called perturbed compressed sensing protocol (PCSP) to preserve data confidentiality as well as its practicality. At first, we briefly introduce the CS theory and three factors correlated with reconstruction effect. Secondly, a secure CS-based framework using a secret disturbance is developed to protect raw data in WSN, in which each node collects, encrypts, measures, and transmits the sampled data in our protocol. Formally, we prove that our protocol is CPA-secure on the basis of a theorem. Finally, evaluation on real and simulative datasets shows that our protocol could not only achieve higher efficiency than related algorithms but also protect signal’s confidentiality.

[1]  Peter E. Hart,et al.  Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.

[2]  Stephen P. Boyd,et al.  An Interior-Point Method for Large-Scale $\ell_1$-Regularized Least Squares , 2007, IEEE Journal of Selected Topics in Signal Processing.

[3]  Y. Rachlin,et al.  The secrecy of compressed sensing measurements , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[4]  Shutao Li,et al.  A Survey on Compressive Sensing: A Survey on Compressive Sensing , 2009 .

[5]  V. S. Saroja,et al.  A survey on compressive sensing , 2015, 2015 2nd International Conference on Electronics and Communication Systems (ICECS).

[6]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[7]  Yaakov Tsaig,et al.  Extensions of compressed sensing , 2006, Signal Process..

[8]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[9]  Mário A. T. Figueiredo,et al.  Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.

[10]  Meng Zhang,et al.  Energy-efficient and Secure Sensor Data Transmission Using Encompression , 2013, 2013 26th International Conference on VLSI Design and 2013 12th International Conference on Embedded Systems.

[11]  R. Vershynin,et al.  One sketch for all: fast algorithms for compressed sensing , 2007, STOC '07.

[12]  Luigi Palopoli,et al.  Scalable Offline Optimization of Industrial Wireless Sensor Networks , 2011, IEEE Transactions on Industrial Informatics.

[13]  Yonina C. Eldar,et al.  Compressed Sensing with Coherent and Redundant Dictionaries , 2010, ArXiv.

[14]  Sudipto Guha,et al.  Near-optimal sparse fourier representations via sampling , 2002, STOC '02.

[15]  Athanasios V. Vasilakos,et al.  CDC: Compressive Data Collection for Wireless Sensor Networks , 2015, IEEE Transactions on Parallel and Distributed Systems.

[16]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[17]  Esther Rodriguez-Villegas,et al.  Compressive sensing: From “Compressing while Sampling” to “Compressing and Securing while Sampling” , 2010, 2010 Annual International Conference of the IEEE Engineering in Medicine and Biology.

[18]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[19]  Gill R. Tsouri,et al.  Establishing secure measurement matrix for compressed sensing using wireless physical layer security , 2013, 2013 International Conference on Computing, Networking and Communications (ICNC).

[20]  G. Sharma,et al.  On the security and robustness of encryption via compressed sensing , 2008, MILCOM 2008 - 2008 IEEE Military Communications Conference.

[21]  R. Nowak,et al.  Compressed Sensing for Networked Data , 2008, IEEE Signal Processing Magazine.

[22]  Pierre Vandergheynst,et al.  Compressed Sensing for Real-Time Energy-Efficient ECG Compression on Wireless Body Sensor Nodes , 2011, IEEE Transactions on Biomedical Engineering.

[23]  Jean-Luc Starck,et al.  Compressed Sensing in Astronomy , 2008, IEEE Journal of Selected Topics in Signal Processing.

[24]  Dawn Xiaodong Song,et al.  SIA: secure information aggregation in sensor networks , 2003, SenSys '03.

[25]  R. DeVore,et al.  Compressed sensing and best k-term approximation , 2008 .

[26]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[27]  Jun Sun,et al.  Compressive data gathering for large-scale wireless sensor networks , 2009, MobiCom '09.

[28]  Deanna Needell,et al.  Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit , 2007, Found. Comput. Math..

[29]  I. Daubechies,et al.  An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.

[30]  E.J. Candes Compressive Sampling , 2022 .

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

[32]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[33]  Jean-Luc Starck,et al.  Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.