Delta compression optimisation for UAV‐enabled mobile edge caching. Issue 15 (9th July 2020)

• Record Type: Journal Article
• Authors: Hu, Zhijuan; Wang, Danyang; Li, Zan; Li, Junling; Gao, Yuan
• Is Part Of: IET communications. Volume 14:Issue 15(2020)
• Page Start: 2500
• Page End: 2508
• Publication Date: 2020-07-09
• Subjects: cache storage -- optimisation -- file organisation -- parallel processing -- remotely operated vehicles -- autonomous aerial vehicles -- greedy algorithms -- data compression; monitoring coverage -- spectrum data -- UAV monitor -- data collection period -- storage space -- control centre -- edge computing server -- delta compression method -- caching space -- transfer time -- evaluation model -- optimisation problem -- optimal delta encoding -- maximal total length -- copied fragments algorithm -- mutually separated L‐grams common fragments -- MTLC algorithm -- good delta encoding -- maximum total length -- minimum total number -- COPYs -- synthetic data -- hash suffix array delta algorithms -- delta compression optimisation -- UAV‐enabled mobile edge caching -- unmanned aerial vehicles‐based sensor networks -- recognising -- tracking -- manoeuvring targets; Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/iet-com.2019.1214
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract : Unmanned aerial vehicles (UAVs)‐based sensor network is an effective mechanism for recognising and tracking of manoeuvring targets as well as expanding the monitoring coverage in the battlefield. However, there exists redundancy among the spectrum data collected by a UAV monitor within a data collection period, which may waste storage space and reduce the speed of data uploaded to the control centre. The authors assume that each UAV is equipped with an edge computing server and propose a delta compression method, which can save cache space and transfer time. First, they present a cost model and evaluation model for delta compression of the COPY/ADD class. Then an optimisation problem is formulated aiming to obtain the optimal delta encoding. Additionally, a maximal total length of copied fragments (MTLC) algorithm is proposed to find more mutually separated L ‐grams common fragments between the data collected at two adjacent moments. Theoretical analysis proves that the MTLC algorithm can generate a good delta encoding with the maximum total length and then the minimum total number of the COPYs. Moreover, numerical results show that MTLC has better performance in constructing a good delta encoding than the simple greedy and hash suffix array delta algorithms.