Data caching algorithm in metropolitan vehicle network

Abstract

Data caching is an important technique in metropolitan vehicle networks.It can increase data availability and significantly improve the efficiency of information access by reducing the access latency and bandwidth usage.However,designing efficient caching algorithms is non-trivial when network nodes have limited memory.This paper analyzed how to cache with the help of benefit function,and proposed a way of using local access frequency and neighboring node access frequency to construct the benefit function.The authors simulated the algorithm using a network simulator(NS2),and its advantage was demonstrated in city scenarios.