Dijkstra algorithm based cooperative caching strategy for UAV-assisted edge computing system

Recently, the unmanned aerial vehicle (UAV)-assisted edge computing is proposed to improve the quality of service in some scenarios within sparse or unavailable base stations (BSs). Meanwhile, the caching technology is adopted to reduce the wireless traffic load and the data transmission delay. Howe...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Wireless networks Ročník 30; číslo 3; s. 1201 - 1219
Hlavní autoři: Zhang, Jing, Bai, Jingpan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2024
Springer Nature B.V
Témata:
Algorithms
Caching
Communications Engineering
Computer Communication Networks
Data transmission
Delay
Dijkstra's algorithm
Edge computing
Electrical Engineering
Engineering
IT in Business
Networks
Nodes
Optimization
Original Paper
Storage capacity
Unmanned aerial vehicles
Cooperative caching
UAVs
Dijkstra algorithm
Edge computing
ISSN:1022-0038, 1572-8196
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Recently, the unmanned aerial vehicle (UAV)-assisted edge computing is proposed to improve the quality of service in some scenarios within sparse or unavailable base stations (BSs). Meanwhile, the caching technology is adopted to reduce the wireless traffic load and the data transmission delay. However, due to the limited storage capacity of edge nodes, the edge nodes cannot store all of the contents required by user equipment (UE). So, how to select the reasonable contents for caching on edge nodes to reduce the content delivery delay becomes a challenge in the UAV-assisted edge computing environment. In this paper, the Dijkstra algorithm based cooperative caching strategy for UAV-assisted edge computing system is proposed. Specially, the content transmission delay between two nodes is computed. Then, for each requested content, the weighted edge-undirected graph (WEUG), in which one vertex represents one node, is built. Furthermore, Dijkstra algorithm is adopted to achieve the minimal content transmission delay from the edge node caching the requested content to UE. Finally, the optimization problem of content caching is built, and the corresponding cache strategy is achieved by solving the optimization problem. The experimental results imply that the proposed cooperative caching algorithm can achieve better performance on the average content transmission delay, the average cache hit rate, and the total of hops, respectively, comparing with the benchmark algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1022-0038
1572-8196
DOI:10.1007/s11276-023-03551-x