Energy-efficient data gathering algorithm relying on compressive sensing in lossy WSNs

Abstract Packet loss is one of the most critical factors affecting the accuracy of compressed sensing (CS)-based data gathering algorithms. In this paper, a data gathering algorithm is proposed to decrease energy consumption and resist packet loss. Each cluster head formulates a sparsest random measurement matrix (SRMM) via the received data to avoid the measurement of the lost node and decrease the number of measurements. To employ spatial correlation between clusters, the sink constructs a block diagonal matrix (BDM) as a measurement matrix via SRMMs and reconstructs the entire network data. Additionally, the optimal number of clusters is discussed under this framework to reach the minimum power consumption. The SR-BDM is evaluated on the emulated data and the real sensor data from GreenOrbs, respectively. The simulation results indicate the proposed algorithm reaches high precision, both with reliable links and with a 60% packet loss rate link, without causing increased energy consumption.

[1]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.

[2]  Panlong Yang,et al.  Compressive sensing meets unreliable link: sparsest random scheduling for compressive data gathering in lossy WSNs , 2014, MobiHoc '14.

[3]  Antonio Iera,et al.  The Internet of Things: A survey , 2010, Comput. Networks.

[4]  Michael B. Wakin,et al.  The Restricted Isometry Property for block diagonal matrices , 2011, 2011 45th Annual Conference on Information Sciences and Systems.

[5]  Rui Zhang,et al.  Energy-Efficient Data Collection in UAV Enabled Wireless Sensor Network , 2017, IEEE Wireless Communications Letters.

[6]  Marian Codreanu,et al.  Sequential Compressed Sensing With Progressive Signal Reconstruction in Wireless Sensor Networks , 2015, IEEE Transactions on Wireless Communications.

[7]  Ping Zhang,et al.  A secure data collection scheme based on compressive sensing in wireless sensor networks , 2018, Ad Hoc Networks.

[8]  Chadi Assi,et al.  UAV-Aided Projection-Based Compressive Data Gathering in Wireless Sensor Networks , 2019, IEEE Internet of Things Journal.

[9]  Yu Zhou,et al.  An Efficient Tree-Based Self-Organizing Protocol for Internet of Things , 2016, IEEE Access.

[10]  Panlong Yang,et al.  Sparsest Random Scheduling for Compressive Data Gathering in Wireless Sensor Networks , 2014, IEEE Transactions on Wireless Communications.

[11]  Shojiro Nishio,et al.  Energy-efficient topology construction for multi-attribute data gathering in WSNs , 2016, IMCOM.

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

[13]  Catherine Rosenberg,et al.  Does Compressed Sensing Improve the Throughput of Wireless Sensor Networks? , 2010, 2010 IEEE International Conference on Communications.

[14]  Wei Wang,et al.  Distributed Sparse Random Projections for Refinable Approximation , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[15]  Minh Tuan Nguyen,et al.  Compressive sensing based random walk routing in wireless sensor networks , 2017, Ad Hoc Networks.

[16]  Shaojie Tang,et al.  Canopy closure estimates with GreenOrbs: sustainable sensing in the forest , 2009, SenSys '09.

[17]  Richard G. Baraniuk,et al.  Compressive Sensing , 2008, Computer Vision, A Reference Guide.

[18]  Lionel M. Ni,et al.  SEER: Metropolitan-Scale Traffic Perception Based on Lossy Sensory Data , 2009, IEEE INFOCOM 2009.

[19]  Jianzhong Li,et al.  K-Nearest Neighbor Based Missing Data Estimation Algorithm in Wireless Sensor Networks , 2010, Wirel. Sens. Netw..

[20]  Mani Srivastava,et al.  Energy-aware wireless microsensor networks , 2002, IEEE Signal Process. Mag..

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

[22]  Ning Liu,et al.  Spatiotemporal Compressive Network Coding for Energy-Efficient Distributed Data Storage in Wireless Sensor Networks , 2015, IEEE Communications Letters.

[23]  Guangyi Liu,et al.  A Practical Data-Gathering Algorithm for Lossy Wireless Sensor Networks Employing Distributed Data Storage and Compressive Sensing , 2018, Sensors.

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

[25]  Enrico Magli,et al.  Distributed Compressed Sensing , 2015 .

[26]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[27]  Naixue Xiong,et al.  Minimizing Delay and Transmission Times with Long Lifetime in Code Dissemination Scheme for High Loss Ratio and Low Duty Cycle Wireless Sensor Networks , 2018, Sensors.

[28]  D. L. Donoho,et al.  Compressed sensing , 2006, IEEE Trans. Inf. Theory.

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

[30]  Xue Liu,et al.  Data loss and reconstruction in sensor networks , 2013, 2013 Proceedings IEEE INFOCOM.

[31]  Nazanin Rahnavard,et al.  CCS: Energy-efficient data collection in clustered wireless sensor networks utilizing block-wise compressive sensing , 2016, Comput. Networks.

[32]  Shu Lin,et al.  Automatic-repeat-request error-control schemes , 1984, IEEE Communications Magazine.