Value-based Proactive Caching for Sensing Data in Vehicular Networks: An Operator's Perspective

TL;DR

This paper proposes a long-term, operator-centric caching strategy for vehicular sensing data that considers multi-slot scenarios, service capacity, and cost efficiency, using stochastic programming and a novel optimization algorithm.

Contribution

It introduces a joint caching and allocation model with a value-based approach and a binary quantum particle swarm optimization algorithm for long-term vehicular data management.

Findings

Outperforms existing schemes in energy efficiency.

Reduces response latency significantly.

Increases cache-hit ratio effectively.

Abstract

Access to sensing data (SD) is crucial for vehicular networks to ensure safe and efficient transportation services. Given the vast volume of data involved, proactive caching required SD is a pivotal strategy for alleviating network congestion and improving data accessibility. Despite merits, existing studies predominantly address SD caching within a single slot. Therefore, these approaches lack scalability for scenarios involving multi-slots and are not well-suited for network operators who manage resources within a long-term cost budget. Moreover, the oversight of service capacity at caching nodes may result in substantial queuing delays for SD reception. To tackle these limitations, we jointly consider the problem of anchoring SD caching and allocating from an operator's perspective. A value model incorporating both temporal and spacial characteristics is given to estimate the significance of various caching decisions. Subsequently, a stochastic programming model is proposed to optimize the long-term system performance, which is converted into a series of online optimization problem by leveraging the Lyapunov method and linearized via introducing auxiliary variables. To expedite the solution, we provide a binary quantum particle swarm optimization based algorithm with quadratic time complexity. Numerical investigations demonstrate the superiority of proposed algorithms compared with other schemes in terms of energy consumption, response latency, and cache-hit ratio.