Implicit Cooperative Caching based on Information Popularity for Vehicular Networks

Yuhong Li, Ji Wang, Anders Lindgren, Xiang Su, Jukka Riekki2017 · DOI

TL;DR

This paper proposes a novel caching strategy for Information-Centric Networking (ICN) in vehicular networks. It intelligently caches data based on its popularity and vehicle density, reducing redundancy and improving storage efficiency without requiring explicit communication between vehicles.

What Problem Does This Paper Address?

Vehicular networks generate and consume vast amounts of data, making efficient data dissemination crucial for intelligent transportation systems. Information-Centric Networking (ICN) offers a promising paradigm for this, as it focuses on what data is needed rather than where it comes from. Caching is a cornerstone of ICN, allowing data to be stored closer to users, reducing latency and network load. However, existing ICN caching strategies, often designed for wired networks, struggle with the highly dynamic topology, intermittent connectivity, and varying data popularity inherent in vehicular environments. This leads to inefficient storage utilization (e.g., redundant caching) and potential delays in accessing critical information.

Methods

The authors introduce an "interval-based selective caching" approach. Instead of caching every piece of data that passes through a vehicle, they propose caching data only at calculated intervals along its path. This interval is dynamically determined based on two key factors:

  • Information Popularity: Data that is requested more frequently is considered more popular and is cached more widely. Popularity is modeled with a time-attenuated function, acknowledging that past popularity doesn't guarantee future demand.
  • Vehicle Density: In areas with high vehicle density, data can be found quickly from nearby vehicles. Therefore, the caching interval can be larger, meaning fewer vehicles need to store the same data. Conversely, in sparser areas, a smaller interval is used.

This approach is "implicit" because it doesn't require vehicles to exchange explicit cache management messages. Instead, the caching decision is made locally based on estimated popularity and density, and the interval is embedded within data packets.

Datasets

Not discussed in the paper. The evaluation was performed using simulations.

Key Insights and Ideas

  • Dynamic Caching for Dynamic Networks: The core insight is that caching strategies must adapt to the unique characteristics of vehicular networks, particularly their mobility and varying density.
  • Implicit Cooperation: Achieving cooperative caching benefits (reduced redundancy, better utilization) without the overhead of explicit communication is a significant advantage in highly dynamic environments.
  • Popularity and Density as Caching Cues: Leveraging information popularity and vehicle density provides a practical and effective way to guide caching decisions, balancing data availability with storage efficiency.
  • Interval-Based Caching: The concept of caching at calculated intervals, rather than indiscriminately, is a novel way to manage cache space and reduce redundancy.

Key Results

The simulation results demonstrate that the proposed interval-based caching approach significantly reduces data redundancy compared to caching everywhere. This leads to:

  • Increased Storage Space Utilization: Vehicles can store a wider variety of information due to reduced redundancy.
  • Low Data Response Time: Despite caching less frequently, the response times for obtaining data do not increase significantly, and in some cases, are comparable or even better than traditional methods.
  • Reduced Network Load: By caching data more efficiently, the overall network traffic is reduced.

Specifically, figures show that average redundancy is substantially lower with the proposed method. While cache hit ratios might slightly decrease for less popular items (as expected and desired for efficiency), the overall performance in terms of space utilization and response time is improved.

Limitations and Future Work

The authors acknowledge that:

  • Determining Cooperation Extent: Finding a unified strategy for defining cooperation groups in vehicular networks is challenging due to their dynamic nature.
  • Information Categories: Different types of information have varying temporal and spatial constraints, which the current model might not fully capture.
  • Future Work: The authors suggest further analysis and evaluation of information characteristics and a more thorough consideration of network topology dynamicity on caching. They also plan to explore the relationship between the interval value, popularity, and density more deeply.

Summary updated

Abstract

Information-centric networking (ICN) technology is becoming a popular research topic in vehicular networks due to the connectionless and lightweight characteristics of this networking paradigm. Caching plays an essential role in information-centric networks, but current caching techniques for ICN are not ideal for the dynamic and wireless vehicular networks. This paper presents a caching approach for ICN-based vehicular networks that takes into account both the dynamicity of vehicular networks and the popularity of the information being distributed. We introduce an interval metric for selective caching. With this metric and estimates of information popularity and vehicle density, cooperative caching can be realized without exchanging cache management information among the vehicular nodes. Simulation results show that the proposed approach can increase the storage space utilization and has low data response time for vehicular networks.
BibTeX
@misc{li2017implicit,
  author = {Yuhong Li and Ji Wang and Anders Lindgren and Xiang Su and Jukka Riekki},
  title = {{Implicit Cooperative Caching based on Information Popularity for Vehicular Networks}},
  year = {2017},
  doi = {10.1145/3124087.3124091},
}
Figure