C-V2X Greedy Cooperative Caching and Response Algorithm

Abstract

Greedy Cooperative Caching and Response Algorithm (GCCR) is proposed to relieve the communication load of base station as edge Caching source in C-V2X and improve the efficiency of data transmission. Under the constraint of node topological relationship, the greedy flooding cache node allocation order is adopted to increase the complementary cooperation of cache files of neighboring nodes. The result is not only to enrich cache content and increase request response rates, but also to increase service coverage for highly popular files, thereby reducing transmission delays and duplicate response rates.