Abstract

For vehicular <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ad hoc</i> networks (VANETs), edge caching has attracted considerable research attention to maximize the efficiency and reliability of infotainment applications. In this article, we propose a two-layer distributed content caching scheme for VANETs by jointly exploiting the cache at both vehicles and roadside units (RSUs). Specifically, we formulate the content caching problem to minimize the overall transmission delay and cost as a nonlinear integer programming (NLIP) problem and propose an alternate dynamic programming search (ADPS)-based algorithm to solve it. In ADPS, we divide the original problem into three subproblems and then we use the dynamic programming (DP) method to solve each subproblem separately. To reduce the complexity, we further propose a cooperation-based greedy (CBG) algorithm to solve the large-scale original problem. Both numerical simulation results and experiments in the testbed show that the proposed caching scheme outperforms existed caching schemes, and the transmission delay and cost can be reduced by 10% and 24%, respectively, while the hit ratio can be increased by 30% in a practical environment, as compared to the popularity-based caching scheme.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.