Towards Efficient Compressive Data Collection in the Internet of Things
Peng Sun, Liantao Wu, Zhi Wang

TL;DR
This paper introduces a new sparse Gaussian matrix for compressive sensing in IoT, which is easy to implement and resource-efficient, while maintaining good signal recovery performance.
Contribution
The paper proposes a novel sparse Gaussian matrix for CS in IoT, addressing implementation challenges of existing matrices and demonstrating its efficiency through analysis and experiments.
Findings
Significant reduction in time and memory costs.
Maintains satisfactory signal recovery performance.
Theoretical and experimental validation of the matrix's effectiveness.
Abstract
It is of paramount importance to achieve efficient data collection in the Internet of Things (IoT). Due to the inherent structural properties (e.g., sparsity) existing in many signals of interest, compressive sensing (CS) technology has been extensively used for data collection in IoT to improve both accuracy and energy efficiency. Apart from the existing works which leverage CS as a channel coding scheme to deal with data loss during transmission, some recent results have started to employ CS as a source coding strategy. The frequently used projection matrices in these CS-based source coding schemes include dense random matrices (e.g., Gaussian matrices or Bernoulli matrices) and structured matrices (e.g., Toeplitz matrices). However, these matrices are either difficult to be implemented on resource-constrained IoT sensor nodes or have limited applicability. To address these issues, in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Energy Efficient Wireless Sensor Networks · Distributed Sensor Networks and Detection Algorithms
