Cooperative Edge Caching With Location-Based
and Popular Contents for Vehicular Networks
I. INTRODUCTION
In this study, a collaborative edge storage method for III. SYSTEM MODEL
vehicular networks is proposed that enables content fetching
from many cache servers by cars. It takes into account two The system uses vehicles, RSU, and cellular levels
categories of requests for automotive material: popular to construct a heterogeneous vehicular network on roads.
content with looser deadlines (like live video streaming) and Cars can get content from several cache server tiers. The
location-based content with tight latency requirements (like primary components are:
HD maps). Both kinds of materials are cooperatively stored Vehicle level:
across several servers and encoded utilizing Fountain codes.
Automobiles with computer and caching systems
installed.
First, the authors examine the maximum amount of RSU level:
content that can be kept on a single server, which is based on
the vehicle link lifetime and download rate. For both kinds of Local computing and caching resources are provided by
material, they offer theoretical evaluations of the roadside units.
transmission latency and service cost (caching and Cellular level:
transmission expenses). Next, an optimization problem is
designed to find the best collaborative content method to Broad coverage and backhaul connectivity are offered by
minimize the overall transmission latency and service cost. macro base stations.
An technique based on ant colony optimization is
suggested to attain a near-optimal solution because the issue IV. PERFORMANCE METRICS
is NP-hard. The algorithm's performance in terms of reduced
transmission latency, appropriate buffering, convergence, The main performance metrics evaluated include:
and service cost is shown by the simulation results.
• Transmission delay: Encompasses computation
delay, transmission delay, and migration delay.
• Service cost: Includes content caching and
transmission costs.
II. KEY CONTRIBUTIONS
Collaborative caching scheme: Cars may save money by
caching on inexpensive servers, minimize latency through V. CONCLOSION
seamless delivery, and retrieve material from several edge
servers while they are moving. The study shows that by utilizing multi-level caching
servers, collaborative caching may greatly enhance
Analyzing costs and delay theories: performance in automotive networks. The suggested
Under the mobility/communication models, there is a algorithms distribute material among servers in a way that
delay for location-based items to get to the best place. produces near-optimal latency and cost.
Analyze the minimal placement for common contents with .
delay requirements to guarantee delay and calculate the
service cost.
Algorithm for cooperative content placement: VI. PROPOSALS
Create a multi-objective optimization problem and work
together to reduce costs and delays. To accomplish almost [1] Minimizing Service Delay and Cost in
ideal fine-grained cooperative placement, develop a method Vehicular Networks through Differential
for ant colony optimization. Content Placement
XXX-X-XXXX-XXXX-X/XX/$XX.00 ©20XX IEEE
