Parallel Algorithm for Wireless Data Compression and Encryption

Qin, Jiancheng; Lu, Yiqin; Yu, Zhong Kui

doi:10.1155/2017/4209397

Cited by 6 publications

(16 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have discussed the big data compression and encryption in the heavy nodes in a WSN in [5], but if the heavy nodes use BWT, we still have the following problems:…”

Section: Problems Of Bwt For Sensors and Big Data Compressionmentioning

confidence: 99%

“…In this paper and the previous [4,5], we use the same definition of the compression ratio as follows:…”

Section: Problems Of Bwt For Sensors and Big Data Compressionmentioning

confidence: 99%

“…We have designed a combined parallel algorithm named "CZ algorithm" to compress and encrypt the big data efficiently and developed our compression software named "ComZip" [5]. Now we have made ComZip compatible to Linux platforms.…”

Section: Introductionmentioning

confidence: 99%

“…Now we have made ComZip compatible to Linux platforms. As mentioned in the figures of [4,5], ComZip has a BWT filter. This paper focuses on the BWT filter and proposes a fast algorithm of truncated BWT named "CZ-BWT algorithm" to compress the big data efficiently.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Fast Algorithm of Truncated Burrows-Wheeler Transform Coding for Data Compression of Sensors

Qin

Zhong

2018

Journal of Sensors

Self Cite

View full text Add to dashboard Cite

Lots of sensors in the IoT (Internet of things) may generate massive data, which will challenge the limited sensor storage and network bandwidth. So the study of big data compression is very useful in the field of sensors. In practice, BWT (Burrows-Wheeler transform) can gain good compression results for some kinds of data, but the traditional BWT algorithms are neither concise nor fast enough for the hardware of sensors, which will limit the BWT block size in a very small and incompetent scale. To solve this problem, this paper presents a fast algorithm of truncated BWT named "CZ-BWT algorithm" and implements it in the shareware named "ComZip." CZ-BWT supports the BWT block up to 2 GB (or larger) and uses the bucket sort. It is very fast with the time complexity O(N) and fits the big data compression. The experiment results indicate that ComZip with the CZ-BWT filter is obviously faster than bzip2, and it can obtain better compression ratio than bzip2 and p7zip in some conditions. In addition, CZ-BWT is more concise than current BWT with SA (suffix array) sorts and fits the hardware BWT implementation of sensors.

show abstract

“…We have discussed the big data compression and encryption in the heavy nodes in a WSN in [5], but if the heavy nodes use BWT, we still have the following problems:…”

Section: Problems Of Bwt For Sensors and Big Data Compressionmentioning

confidence: 99%

“…In this paper and the previous [4,5], we use the same definition of the compression ratio as follows:…”

Section: Problems Of Bwt For Sensors and Big Data Compressionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fast Algorithm of Truncated Burrows-Wheeler Transform Coding for Data Compression of Sensors

Qin

Zhong

2018

Journal of Sensors

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, a new combined parallel algorithm named "CZ algorithm" which can compress and encrypt the Big Data efficiently can be found in paper [1]. Paper [2] describes several broadcast encryption schemes from the point of view of wireless sensor networks.…”

Section: Related Workmentioning

confidence: 99%

Reducing the Amount of Data for Creating Routes in a Dynamic DTN via Wi-Fi on the Basis of Static Data

Shichkina

Koblov

2017

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

This article presents the results of research on the acceleration of data processing in the construction routing in dynamic DTN, realized through the devices established in moving objects and connected by means of Wi-Fi. The routes are constructed based on the prehistory of the movement of objects, which is stored in the database in the csv format. This database has a large volume and contains unnecessary and incorrect information. The article shows the possibility of speeding up the process of constructing routes using data precleaning. Reducing data volume is proposed by constructing an enlarged grid on the object movement map. This article also demonstrates the use of fuzzy logic and graph theory for constructing routes.

show abstract

Data reduction and recovery in wireless communication system: An extensive experimental evaluation using PSK and QAM modulations

Panem

Vetrekar

Gad

2022

Int J Communication

View full text Add to dashboard Cite

Summary The evolution of technologies in data communication system has resulted in generation of large data. With the availability of limited bandwidth and to maintain the energy efficiency of the wireless communication system, data reduction plays a significant amount of role in preserving the lifetime of wireless communication system. Considering the significance of this problem in wireless communication system, in this work, we present data reduction and recovery or reconstruction on multivariate data using principal component analysis (PCA). In general, we send the eigen coefficients from the source and use these coefficients at the destination to recover or reconstruct the original data back in wireless communication system. We employ in our work two different digital modulation techniques such as phase‐shift keying (PSK) and quadrature amplitude modulation (QAM) with seven different bit rate to demonstrate our approach. We carry the experiments independently using five different signal ensemble and four different multiple‐input, multiple‐output (MIMO) configuration along with Rayleigh fading. This work presents an extensive simulated benchmark results based on performance matrix such as root mean square error (RMSE) and bit error rate (BER) at different values of signal‐to‐noise ratio (SNR). We further validate our approach by presenting synthesis of our proposed model using Xilinx target device Virtex‐6 LX240T Field Programmable Gate Array (FPGA). The experimental results reported based on simulation, synthesis, and validation of model demonstrate the applicability of our proposed approach in real‐time scenario.

show abstract

Parallel Algorithm for Wireless Data Compression and Encryption

Cited by 6 publications

References 17 publications

Fast Algorithm of Truncated Burrows-Wheeler Transform Coding for Data Compression of Sensors

Fast Algorithm of Truncated Burrows-Wheeler Transform Coding for Data Compression of Sensors

Reducing the Amount of Data for Creating Routes in a Dynamic DTN via Wi-Fi on the Basis of Static Data

Data reduction and recovery in wireless communication system: An extensive experimental evaluation using PSK and QAM modulations

Contact Info

Product

Resources

About