Research Papers
Publication Number: WO/2024/008798
Abstract
The present disclosure regards a method for compression of a signal, of length, comprising data, the method comprising the steps of at least for a first level of decomposition, transforming the signal based on a first sparse matrix, of size × formed by an invertible matrix, representing a divisor-based signal decomposition for a first divisor to obtain a first vector of transformation coefficients, wherein =, and wherein the first vector comprises an initial component and detail components,, …,. The method further comprises the step of at least for a second level of decomposition, transforming the initial component based on a second sparse matrix, of size ×, where =, formed by an invertible matrix, representing a divisor-based signal decomposition for a second divisor, to obtain a second vector of transformation coefficients wherein =, and wherein the second vector comprises an initial component and detail components,, …,. After the transformation coefficients of the second vector of transformation coefficients,,, …, and detail components of the first vector,, …,, are quantized to obtain a quantized transformation vector and the signal is compressed based on the quantized transformation vector.
Abstract
Cardiovascular diseases are the primary cause of death around the world. Cardiovascular ailments can be monitored continuously using wearable devices, which are resource-constrained and battery-operated. Efficient data compression is a promising method to reduce transmission energy cost and extend battery lifetime. In this paper, we first propose two novel pruning methods with pruning matrix's entries taken from the set {−1, 0, 1}, which achieve similar reconstruction quality as compared to DCT pruning but with far less computational cost due to multiplierless operation. Reconstruction for these pruning methods is proposed using Gaussian elimination. Then we design two lightweight compression algorithms based on the pruning methods, i.e., sign compression algorithm and binary compression algorithm. The proposed compression algorithms and pruning methods are evaluated using performance metrics such as compression ratio, percentage root mean square difference, quality score, etc. Furthermore, The pruning methods are implemented in TelosB mote and execution time is evaluated. The experiments are conducted on the MIT-BIH arrhythmia database. The experimental results show that the proposed compression algorithms outperform the state-of-the-art methods.
Abstract
In most of existing Internet of Things (IoT) applications, data compression, data encryption and error/erasure correction are implemented separately. To achieve reliable communication, in particular, in harsh wireless environment with strong interference, error/erasure correction codes with higher correction capability or Automatic repeat request (ARQ) scheme are desirable but at the cost of increasing complexity and energy consumption. Due to resource-constrained IoT device, it is often challenging to implement all of them. In this paper, we propose a novel lightweight efficient secure error-robust scheme, ENCRUST, which is able to achieve these three functions using simple matrix multiplication. ENCRUST is built on the new theoretical foundation of projection-based encoding presented in this paper, by leveraging the sparsity inherent in the signal. We perform theoretical analysis and experimental study of the proposed scheme in comparison with the conventional schemes. It shows that the proposed scheme can work in low SINR range and the reconstructed signal quality shows graceful degradation. Furthermore, we apply the proposed scheme on real-life electrocardiogram (ECG) dataset and images. The results demonstrate that ENCRUST achieves decent compression, information secrecy as well as strong error recovery in one go.
Abstract
In this paper, we design the multi-class privacy-preserving cloud computing scheme (MPCC) leveraging compressive sensing for compact sensor data representation and secrecy for data encryption. The proposed scheme achieves two-class secrecy, one for superuser who can retrieve the exact sensor data, and the other for semi-authorized user who is only able to obtain the statistical data such as mean, variance, etc. MPCC scheme allows computationally expensive sparse signal recovery to be performed at cloud without compromising the confidentiality of data to the cloud service providers. In this way, it mitigates the issues in data transmission, energy and storage caused by massive IoT sensor data as well as the increasing concerns about IoT data privacy in cloud computing. Compared with the state-of-the-art schemes, we show that MPCC scheme not only has lower computational complexity at the IoT sensor device and data consumer, but also is proved to be secure against ciphertext-only attack.
Abstract
Compressive sensing (CS) can provide joint compression and encryption, which is promising to address the challenges of massive sensor data and data security in the Internet of Things (IoT). However, as IoT devices have constrained memory, computing power, and energy, in practice the CS-based computationally secure scheme is shown to be vulnerable to ciphertext-only attack for short-signal length. Although the CS-based perfectly secure scheme has no such vulnerabilities, its practical realization is challenging. In this article, we propose an energy concealment (EC) encryption scheme, a practical realization of the perfectly secure scheme by concealing energy, thereby removing the requirement of an additional secure channel. We propose three different methods to generate sensing matrix to improve energy efficiency using linear feedback shift registers and lagged Fibonacci sequences. Leveraging the signal's maximum energy in the EC scheme, we design a new measure to evaluate reconstructed signal quality without the knowledge of the original signal. Furthermore, a new CS decoding algorithm is designed by incorporating the knowledge of maximum energy at the decoder, which improves the signal reconstruction quality while reducing the number of measurements. Additionally, our comprehensive security analysis shows that the EC scheme is secure against various cryptographic attacks. We implement the EC scheme using the three different ways of generating the sensing matrix in the resource-constrained TelosB mote using the Contiki operating system. The experimental results demonstrate that the EC scheme outperforms advanced encryption standard in terms of code memory footprint and total energy consumption.
Abstract
Recent study has shown that compressive sensing (CS) based computationally secure scheme using Gaussian or Binomial sensing matrix in resource-constrained IoT devices is vulnerable to ciphertext-only attack. Although the CS-based perfectly secure scheme has no such vulnerabilities, the practical realization of the perfectly secure scheme is challenging, because it requires an additional secure channel to transmit the measurement norm. In this paper, we devise a practical realization of a perfectly secure scheme by concealing energy in which the requirement of an additional secure channel is removed. Since the generation of Gaussian sensing matrices is not feasible in resource-constrained IoT devices, approximate Gaussian sensing matrices are generated using linear feedback shift registers. We also demonstrate the implementation feasibility of the proposed perfectly secure scheme in practice without additional complexity. Furthermore, the security analysis of the proposed scheme is performed and compared with the state-of-the-art compressive sensing based energy obfuscation scheme.
Abstract
The last two decades have seen tremendous growth in data collections because of the realization of recent technologies, including the internet of things (IoT), E-Health, industrial IoT 4.0, autonomous vehicles, etc. The challenge of data transmission and storage can be handled by utilizing state-of-the-art data compression methods. Recent data compression methods are proposed using deep learning methods, which perform better than conventional methods. However, these methods require a lot of data and resources for training. Furthermore, it is difficult to materialize these deep learning-based solutions on IoT devices due to the resource-constrained nature of IoT devices. In this paper, we propose lightweight data compression methods based on data statistics and deviation. The proposed method performs better than the deep learning method in terms of compression ratio (CR). We simulate and compare the proposed data compression methods for various time series signals, e.g., accelerometer, gas sensor, gyroscope, electrical power consumption, etc. In particular, it is observed that the proposed method achieves 250.8%, 94.3%, and 205% higher CR than the deep learning method for the GYS, Gactive, and ACM datasets, respectively.
Interested in our Research?
Connect with us to learn more about our compression technologies and research initiatives.