Scale perception data compression method with blockchain technology for UAV communication
The demand for high data throughput and security in Unmanned Aerial Vehicle (UAV) communication is rising. Efficient data transmission remains challenging due to limited wireless resources. This paper introduces a Scale Perception Compression Method that leverages compression and blockchain technolo...
Saved in:
Published in | Alexandria engineering journal Vol. 88; pp. 287 - 297 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.02.2024
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The demand for high data throughput and security in Unmanned Aerial Vehicle (UAV) communication is rising. Efficient data transmission remains challenging due to limited wireless resources. This paper introduces a Scale Perception Compression Method that leverages compression and blockchain technology to optimize UAV communication. The method involves normalizing data into matrices, generating compression and decompression matrix codebook pairs, and selecting suitable pairs for small or large-scale matrices. Simulation results show that the error rate is associated with the distributions of the data and compression matrix. It remains relatively low when the data and compression matrix subjected to Uniform distribution compared to Gaussian distribution, regardless of the values of the number of rows m and columns r in compression matrix. Bubble method is more suitable to find out the proper matrix pair to compress and decompress transmitted data for small-scale codebook because it is stable, fast and results in lower difference between original and recovered data matrices. The same applies to Merge method for the large-scale codebook. The ER is always lower based on a small-scale codebook searching by Bubble method than that of on a large-scale codebook searching by Merge method, which indicates the former is sufficient for compression. |
---|---|
ISSN: | 1110-0168 |
DOI: | 10.1016/j.aej.2024.01.012 |