LAPSE:2023.1851
Published Article
LAPSE:2023.1851
Research on Discrete Artificial Bee Colony Cache Strategy of UAV Edge Network
Yang Hong, Yuexia Zhang, Shaoshuai Fan
February 21, 2023
Abstract
Unmanned aerial vehicle edge networks (UENs) can reduce the cache load of the core network and improve system performance to provide users with efficient content services. However, the time-varying characteristics of content popularity in UENs lead to a low accuracy of popularity prediction, and the capacity limitations of wireless channel conditions lead to a lower cache hit rate than the rates of traditional fiber-optic-based cache strategies. Therefore, this paper proposes the discrete artificial bee colony cache strategy of UENs (DABCCSU). First, the information−dynamics−dissemination model of UENs (IDDMU) is established to deduce the coupling relationship between the channel capacity and the service probability in IDDMU. The influence of the service probability change on the content dissemination process is discussed, and the content popularity in UENs is predicted by the state iteration matrix. Then, the discrete artificial bee colony cache (DABCC) optimization algorithm is proposed. The action function of the artificial bee colony is designed as a random action based on the historical cache strategy. The discrete cache strategy is used as an optimization variable, and the popularity prediction result obtained by IDDMU is used to maximize the cache hit rate. DABCC provides the optimal cache strategy for the UENs, and effectively improves the cache hit rate. The simulation result shows that the accuracy of DABCCSU in content popularity prediction is more than 90%, which achieves a good prediction effect. In terms of cache performance, the average cache hit rate of DABCCSU is 91.62%, which is better than the 51.09% of the Least Recently Used (LRU) strategy, 89.27% of the Greedy Algorithm (GA) and 54.26% of Binary Particle Swarm Optimization (BPSO). In addition, the cache hit rate of DABCCSU under different cache capacities is better than that of LRU, GA, and BPSO, showing a relatively stable performance. It shows that DABCCSU can achieve excellent content popularity prediction, and it can also maximize the cache hit rate under limited communication resources and cache resources to provide UENs with the optimal content cache strategy, and provides users with high-quality content services.
Keywords
artificial bee colony, cache strategy, popularity prediction, UAV edge network
Suggested Citation
Hong Y, Zhang Y, Fan S. Research on Discrete Artificial Bee Colony Cache Strategy of UAV Edge Network. (2023). LAPSE:2023.1851
Author Affiliations
Hong Y: Key Laboratory of Modern Measurement & Control Technology, Ministry of Education, Beijing Information Science and Technology University, Beijing 100101, China; Key Laboratory of Information and Communication Systems, Ministry of Information Industry, Beij [ORCID]
Zhang Y: Key Laboratory of Modern Measurement & Control Technology, Ministry of Education, Beijing Information Science and Technology University, Beijing 100101, China; State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Te
Fan S: State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
Journal Name
Processes
Volume
10
Issue
9
First Page
1838
Year
2022
Publication Date
2022-09-13
ISSN
2227-9717
Version Comments
Original Submission
Other Meta
PII: pr10091838, Publication Type: Journal Article
Record Map
Published Article

LAPSE:2023.1851
This Record
External Link

https://doi.org/10.3390/pr10091838
Publisher Version
Download
Files
Feb 21, 2023
Main Article
License
CC BY 4.0
Meta
Record Statistics
Record Views
243
Version History
[v1] (Original Submission)
Feb 21, 2023
 
Verified by curator on
Feb 21, 2023
This Version Number
v1
Citations
Most Recent
This Version
URL Here
https://psecommunity.org/LAPSE:2023.1851
 
Record Owner
Auto Uploader for LAPSE
Links to Related Works
Directly Related to This Work
Publisher Version

[0.21 s]