{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:09:11Z","timestamp":1760148551729,"version":"build-2065373602"},"reference-count":31,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T00:00:00Z","timestamp":1683676800000},"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":["61802425","62171466","62001515"],"award-info":[{"award-number":["61802425","62171466","62001515"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>This work studied the event-detection problem in an Internet of Things (IoT) system, where a group of sensor nodes are placed in the region of interest to capture sparse active event sources. Using compressive sensing (CS), the event-detection problem is modeled as recovering the high-dimensional integer-valued sparse signal from incomplete linear measurements. We show that the sensing process in IoT system produces an equivalent integer CS using sparse graph codes at the sink node, for which one can devise a simple deterministic construction of a sparse measurement matrix and an efficient integer-valued signal recovery algorithm. We validated the determined measurement matrix, uniquely determined the signal coefficients, and performed an asymptotic analysis to examine the performance of the proposed approach, namely event detection with integer sum peeling (ISP), with the density evolution method. Simulation results show that the proposed ISP approach achieves a significantly higher performance compared to existing literature at various simulation scenario and match that of the theoretical results.<\/jats:p>","DOI":"10.3390\/s23104620","type":"journal-article","created":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T01:37:24Z","timestamp":1683769044000},"page":"4620","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Compressive Sensing Event-Detection Scheme for Internet of Things System Based on Sparse-Graph Codes"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1202-423X","authenticated-orcid":false,"given":"Jun","family":"Cai","sequence":"first","affiliation":[{"name":"College of Communications Engineering, Army Engineering University of PLA, Nanjing 210007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Xu","sequence":"additional","affiliation":[{"name":"College of Communications Engineering, Army Engineering University of PLA, Nanjing 210007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongpeng","family":"Zhu","sequence":"additional","affiliation":[{"name":"College of Communications Engineering, Army Engineering University of PLA, Nanjing 210007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Cheng","sequence":"additional","affiliation":[{"name":"College of Communications Engineering, Army Engineering University of PLA, Nanjing 210007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,5,10]]},"reference":[{"key":"ref_1","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_2","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","article-title":"Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information","volume":"52","author":"Candes","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1856","DOI":"10.1109\/JIOT.2018.2876695","article-title":"UAV-enabled spatial data sampling in large-scale IoT systems using denoising autoencoder neural network","volume":"6","author":"Yu","year":"2018","journal-title":"IEEE Internet Things J."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"4811","DOI":"10.1109\/TWC.2021.3062568","article-title":"An Energy-Efficient Edge Computing Framework for Decentralized Sensing in WSN-Assisted IoT","volume":"20","author":"Gupta","year":"2021","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/OJCS.2022.3177290","article-title":"A Survey of Sparse Mobile Crowdsensing: Developments and Opportunities","volume":"3","author":"Zhao","year":"2022","journal-title":"IEEE Open J. Comput. Soc."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"10794","DOI":"10.1109\/JSEN.2022.3169226","article-title":"Compressed Tensor Completion: A Robust Technique for Fast and Efficient Data Reconstruction in Wireless Sensor Networks","volume":"22","author":"Sekar","year":"2022","journal-title":"IEEE Sens. J."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2215","DOI":"10.1109\/TIT.2009.2016024","article-title":"Weighted superimposed codes and constrained integer compressed sensing","volume":"55","author":"Dai","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Charbiwala, Z., Kim, Y., Zahedi, S., Friedman, J., and Srivastava, M.B. (2009, January 19\u201321). Energy efficient sampling for event detection in wireless sensor networks. Proceedings of the 2009 ACM\/IEEE International Symposium on Low Power Electronics and Design, San Fancisco, CA, USA.","key":"ref_8","DOI":"10.1145\/1594233.1594339"},{"doi-asserted-by":"crossref","unstructured":"Stecklein, M., Beytur, H.B., de Veciana, G., and Vikalo, H. (2021, January 14\u201323). Optimizing resource constrained distributed collaborative sensing. Proceedings of the 2021 IEEE International Conference on Communications Workshops (ICC Workshops), Montreal, QC, Canada.","key":"ref_9","DOI":"10.1109\/ICCWorkshops50388.2021.9473805"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2196","DOI":"10.1109\/JSEN.2015.2508670","article-title":"Multivariated Bayesian compressive sensing in wireless sensor networks","volume":"16","author":"Hwang","year":"2015","journal-title":"IEEE Sens. J."},{"doi-asserted-by":"crossref","unstructured":"Eltabie, O.M., Ghuniem, A.M., and Abdelkader, M.F. (2019, January 14\u201317). Model assisted compressive data gathering in dense IoT monitoring of water distribution networks. Proceedings of the 2019 IEEE International Smart Cities Conference (ISC2), Casablanca, Morocco.","key":"ref_11","DOI":"10.1109\/ISC246665.2019.9071690"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/97.386290","article-title":"Blind estimation of multiple digital signals transmitted over FIR channels","volume":"2","author":"Talwar","year":"1995","journal-title":"Signal Process. Lett. IEEE"},{"unstructured":"Tian, Z., Leus, G., and Lottici, V. (2009, January 19\u201324). Detection of sparse signals under finite-alphabet constraints. Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Taipei, Taiwan.","key":"ref_13"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"6540","DOI":"10.1109\/TSP.2015.2472362","article-title":"Binary Compressive Sensing via Analog Fountain Coding","volume":"63","author":"Shirvanimoghaddam","year":"2015","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1982","DOI":"10.1109\/TIT.2010.2040894","article-title":"Model-based compressive sensing","volume":"56","author":"Baraniuk","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1307","DOI":"10.1109\/LSP.2022.3179230","article-title":"Measurement Matrix Design for Sample-efficient Binary Compressed Sensing","volume":"29","author":"Sarangi","year":"2022","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_17","first-page":"1575","article-title":"Discrete Signal Reconstruction by Sum of Absolute Values","volume":"22","author":"Nagahara","year":"2015","journal-title":"Signal Process. Lett. IEEE"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2388","DOI":"10.1109\/TSP.2022.3172028","article-title":"Extreme Compressed Sensing of Poisson Rates from Multiple Measurements","volume":"70","author":"Kota","year":"2022","journal-title":"IEEE Trans. Signal Process."},{"doi-asserted-by":"crossref","unstructured":"Das, A.K., and Vishwanath, S. (2013, January 26\u201331). On finite alphabet compressive sensing. Proceedings of the 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Vancouver, BC, Canada.","key":"ref_19","DOI":"10.1109\/ICASSP.2013.6638794"},{"doi-asserted-by":"crossref","unstructured":"Bioglio, V., Coluccia, G., and Magli, E. (2014, January 27\u201330). Sparse image recovery using compressed sensing over finite alphabets. Proceedings of the 2014 IEEE International Conference on Image Processing (ICIP), Paris, France.","key":"ref_20","DOI":"10.1109\/ICIP.2014.7025257"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1109\/OJCOMS.2021.3064983","article-title":"Robust symbol detection in large-scale overloaded NOMA systems","volume":"2","author":"Iimori","year":"2021","journal-title":"IEEE Open J. Commun. Soc."},{"doi-asserted-by":"crossref","unstructured":"Fosson, S.M. (2018). Non-convex Lasso-kind approach to compressed sensing for finite-valued signals. arXiv.","key":"ref_22","DOI":"10.1109\/ACSSC.2018.8645293"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/18.910575","article-title":"Efficient erasure correcting codes","volume":"47","author":"Luby","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Li, X., Pawar, S., and Ramchandran, K. (2014). Sub-linear time support recovery for compressed sensing using sparse-graph codes. arXiv.","key":"ref_24","DOI":"10.1109\/ISIT.2015.7282735"},{"doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Strauss, M.J., Tropp, J.A., and Vershynin, R. (2007, January 11\u201313). One sketch for all: Fast algorithms for compressed sensing. Proceedings of the ACM Symposium on Theory of Computing, San Diego, CA, USA.","key":"ref_25","DOI":"10.1145\/1250790.1250824"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.910577","article-title":"The capacity of low-density parity-check codes under message-passing decoding","volume":"47","author":"Richardson","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"7235","DOI":"10.1109\/TWC.2017.2743699","article-title":"Design of distributed protograph LDPC codes for multi-relay coded-cooperative networks","volume":"16","author":"Fang","year":"2017","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1109\/COMST.2019.2893851","article-title":"Survey of turbo, LDPC, and polar decoder ASIC implementations","volume":"21","author":"Shao","year":"2019","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2060","DOI":"10.1109\/TITS.2021.3122994","article-title":"Irregular-mapped protograph LDPC-coded modulation: A bandwidth-efficient solution for 6G-enabled mobile networks","volume":"24","author":"Fang","year":"2021","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"6616","DOI":"10.1109\/TIT.2012.2206368","article-title":"Density evolution analysis of node-based verification-based algorithms in compressed sensing","volume":"58","author":"Eftekhari","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","article-title":"Finite-length analysis of low-density parity-check codes on the binary erasure channel","volume":"48","author":"Di","year":"2002","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/10\/4620\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:32:07Z","timestamp":1760124727000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/10\/4620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,10]]},"references-count":31,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["s23104620"],"URL":"https:\/\/doi.org\/10.3390\/s23104620","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2023,5,10]]}}}