{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:42:06Z","timestamp":1775144526984,"version":"3.50.1"},"reference-count":35,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T00:00:00Z","timestamp":1550880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61771262 and No. 61801164"],"award-info":[{"award-number":["No. 61771262 and No. 61801164"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin City","doi-asserted-by":"publisher","award":["No. 18JCQNJC01700"],"award-info":[{"award-number":["No. 18JCQNJC01700"]}],"id":[{"id":"10.13039\/501100006606","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Sparse sensing schemes based on matrix completion for data collection have been proposed to reduce the power consumption of data-sensing and transmission in wireless sensor networks (WSNs). While extensive efforts have been made to improve the recovery accuracy from the sparse samples, it is usually at the cost of running time. Moreover, most data-collection methods are difficult to implement with low sampling ratio because of the communication limit. In this paper, we design a novel data-collection method including a Rotating Random Sparse Sampling method and a Fast Singular Value Thresholding algorithm. With the proposed method, nodes are in the sleep mode most of the time, and the sampling ratio varies over time slots during the sampling process. From the samples, a corresponding algorithm with Nesterov technique is given to recover the original data accurately and fast. With two real-world data sets in WSNs, simulations verify that our scheme outperforms other schemes in terms of energy consumption, reconstruction accuracy, and rate. Moreover, the proposed sampling method enhances the recovery algorithm and prolongs the lifetime of WSNs.<\/jats:p>","DOI":"10.3390\/s19040945","type":"journal-article","created":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T03:06:52Z","timestamp":1551064012000},"page":"945","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Low-Energy Data Collection in Wireless Sensor Networks Based on Matrix Completion"],"prefix":"10.3390","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9180-851X","authenticated-orcid":false,"given":"Yi","family":"Xu","sequence":"first","affiliation":[{"name":"College of Electronic Information and Optical Engineering, Nankai University, Tianjin 300071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guiling","family":"Sun","sequence":"additional","affiliation":[{"name":"College of Electronic Information and Optical Engineering, Nankai University, Tianjin 300071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyu","family":"Geng","sequence":"additional","affiliation":[{"name":"College of Electronic Information and Optical Engineering, Nankai University, Tianjin 300071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingfei","family":"He","sequence":"additional","affiliation":[{"name":"Department of Key Laboratory of Electronic Materials and Devices of Tianjin, School of Electronics and Information Engineering, Hebei University of Technology, Tianjin 300401, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11227-013-1021-9","article-title":"Wireless sensor networks: A survey on recent developments and potential synergies","volume":"68","author":"Rawat","year":"2014","journal-title":"J. Supercomput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","article-title":"Compressed sensing","volume":"52","author":"Donoho","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Luo, C., Wu, F., Sun, J., and Chen, C.W. (2009, January 20\u201325). Compressive data gathering for large-scale wireless sensor networks. Proceedings of the 15th Annual International Conference on Mobile Computing and Networking, Beijing, China.","DOI":"10.1145\/1614320.1614337"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.sigpro.2016.08.002","article-title":"Compressive data gathering with low-rank constraints for wireless sensor networks","volume":"131","author":"He","year":"2017","journal-title":"Signal Process."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Chen, J., Jia, J., Deng, Y., Wang, X., and Aghvami, A.H. (2018). Adaptive Compressive Sensing and Data Recovery for Periodical Monitoring Wireless Sensor Networks. Sensors, 18.","DOI":"10.3390\/s18103369"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","article-title":"Exact matrix completion via convex optimization","volume":"9","author":"Recht","year":"2009","journal-title":"Found. Comput. Math."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Cheng, J., Jiang, H., Ma, X., Liu, L., Qian, L., Tian, C., and Liu, W. (2010, January 6\u201310). Efficient data collection with sampling in WSNs: Making use of matrix completion techniques. Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2010), Miami, FL, USA.","DOI":"10.1109\/GLOCOM.2010.5684139"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1109\/TWC.2012.121412.120148","article-title":"STCDG: An efficient data gathering algorithm based on matrix completion for wireless sensor networks","volume":"12","author":"Cheng","year":"2013","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1109\/LCOMM.2015.2489212","article-title":"Data Recovery in Wireless Sensor Networks With Joint Matrix Completion and Sparsity Constraints","volume":"19","author":"He","year":"2015","journal-title":"IEEE Commun. Lett."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","article-title":"A singular value thresholding algorithm for matrix completion","volume":"20","author":"Cai","year":"2010","journal-title":"SIAM J. Optim."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1595","DOI":"10.1109\/TMC.2017.2775230","article-title":"Low cost and high accuracy data gathering in WSNs with matrix completion","volume":"17","author":"Xie","year":"2018","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1434","DOI":"10.1109\/TMC.2016.2595569","article-title":"Recover corrupted data in sensor networks: A matrix completion solution","volume":"16","author":"Xie","year":"2017","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.adhoc.2004.04.003","article-title":"Wireless sensor and actor networks: Research challenges","volume":"2","author":"Akyildiz","year":"2004","journal-title":"Ad Hoc Netw."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2822","DOI":"10.1109\/COMST.2018.2850220","article-title":"A Review of Computational Intelligence Techniques in Wireless Sensor and Actuator Networks","volume":"20","author":"Primeau","year":"2018","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.jnca.2016.01.013","article-title":"Towards wireless sensor, actuator and robot networks: Conceptual framework, challenges and perspectives","volume":"63","author":"Curiac","year":"2016","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0024-3795(94)00014-5","article-title":"Majorization relations for Hadamard products","volume":"223\u2013224","author":"Ando","year":"1995","journal-title":"Linear Algebra Its Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.comnet.2004.03.007","article-title":"Spatio-temporal correlation: Theory and applications for wireless sensor networks","volume":"45","author":"Vuran","year":"2004","journal-title":"Comput. Netw."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S0097539792240406","article-title":"Sparse approximate solutions to linear systems","volume":"24","author":"Natarajan","year":"1995","journal-title":"SIAM J. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1137\/S0895479897326432","article-title":"Tikhonov regularization and total least squares","volume":"21","author":"Golub","year":"1999","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"ref_20","first-page":"3441","article-title":"Iterative reweighted algorithms for matrix rank minimization","volume":"13","author":"Mohan","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","article-title":"Fast and accurate matrix completion via truncated nuclear norm regularization","volume":"35","author":"Hu","year":"2013","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Lu, C., Tang, J., Yan, S., and Lin, Z. (2014, January 23\u201328). Generalized nonconvex nonsmooth low-rank minimization. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Columbus, OH, USA.","DOI":"10.1109\/CVPR.2014.526"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"5632","DOI":"10.1109\/TIP.2017.2745200","article-title":"Convergence of proximal iteratively reweighted nuclear norm algorithm for image processing","volume":"26","author":"Sun","year":"2017","journal-title":"IEEE Trans. Image Process."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","article-title":"Signal recovery by proximal forward-backward splitting","volume":"4","author":"Combettes","year":"2005","journal-title":"Multiscale Model. Simul."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","article-title":"Proximal algorithms","volume":"1","author":"Parikh","year":"2014","journal-title":"Found. Trends Optim."},{"key":"ref_26","unstructured":"Nesterov, Y. (2013). Introductory Lectures on Convex Optimization: A Basic Course, Springer Science & Business Media."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","article-title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","volume":"2","author":"Beck","year":"2009","journal-title":"SIAM J. Imaging Sci."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","article-title":"Adaptive restart for accelerated gradient schemes","volume":"15","author":"Candes","year":"2015","journal-title":"Found. Comput. Math."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","article-title":"Templates for convex cone problems with applications to sparse signal recovery","volume":"3","author":"Becker","year":"2011","journal-title":"Math. Program. Comput."},{"key":"ref_30","first-page":"15","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"Toh","year":"2010","journal-title":"Pac. J. Optim."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1049\/iet-spr.2015.0096","article-title":"Reweighted fast iterative shrinkage thresholding algorithm with restarts for l1-l1 minimisation","volume":"10","author":"Sun","year":"2016","journal-title":"IET Signal Process."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Sun, T., Barrio, R., Jiang, H., and Cheng, L. (2018). Convergence rates of accelerated proximal gradient algorithms under independent noise. Numer. Algorithms, 1\u201324.","DOI":"10.1007\/s11075-018-0565-4"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"23137","DOI":"10.3390\/s141223137","article-title":"Correlated spatio-temporal data collection in wireless sensor networks based on low rank matrix approximation and optimized node sampling","volume":"14","author":"Piao","year":"2014","journal-title":"Sensors"},{"key":"ref_34","unstructured":"(2018, October 10). Sensor Mote Data from Data Sensing Lab. Available online: http:\/\/datasensinglab.com\/data\/."},{"key":"ref_35","unstructured":"(2018, May 15). Sensor Data from Intel Berkeley Research Lab. Available online: http:\/\/db.csail.mit.edu\/labdata\/labdata.html."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/4\/945\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:34:19Z","timestamp":1760186059000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/4\/945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,23]]},"references-count":35,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2019,2]]}},"alternative-id":["s19040945"],"URL":"https:\/\/doi.org\/10.3390\/s19040945","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,23]]}}}