{'fraction_non_alphanumeric': 0.01904761904761905, 'fraction_numerical': 0.0, 'mean_word_length': 5.816216216216216, '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}}
Space and Time Constrained Data Offloading in Vehicular Networks

Mobile data offloading is a feasible and cost-effective solution to ease the burden of cellular networks. In Internet of Vehicles, however, existing offloading techniques are hardly applicable to the ubiquitous location-dependent services, which impose strict spatiotemporal constraints on content delivery. Particularly, the spatiotemporal constraints cause a phenomenon where the delivery deadlines are different even for the vehicles who subscribe to the same content. To this end, we propose a space and time constrained data offloading scheme (STCDO). The scheme maintains a probability-based contact graph to represent the near-term transmission opportunities between vehicles. Furthermore, a dynamic structure called offloading tree is introduced to evaluate the influence of each vehicle on opportunistic dissemination. Finally, the scheme uses a greedy algorithm to effectively select appropriate vehicles as offloading seeds. We perform extensive experiments based on the real-world map-driven movement model in the ONE simulator. The experimental results show that the proposed scheme largely offloads the overloaded cellular networks while satisfying the spatiotemporal constraints.