{'fraction_non_alphanumeric': 0.018367346938775512, 'fraction_numerical': 0.0, 'mean_word_length': 5.329032258064516, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A novel algorithm to cache vehicular content with parked vehicles applications

With the rapid development of vehicular and ICT technologies, Vehicular Content Networks (VCNs) play an important role in facilitating better road safety and comfortable driving. Because the content, such as traffic reports and disaster warning messages, must be delivered efficiently and timely, how to guarantee and improve the performance of VCNs becomes a hot issue. Recently, caching with the parked vehicles shows its efficiency to distribute the large-sized vehicular content. However, the related caching algorithm has not been studied thoroughly. In this paper, based on the analyses of the arrival of vehicles, mobility in parking area and access pattern of vehicular content, we propose an algorithm to decide how to use the cached replicas in the parking area to provide users with the requested content. Simulation results prove that our proposal can outperform the conventional methods.