{'fraction_non_alphanumeric': 0.019823788546255508, 'fraction_numerical': 0.0, 'mean_word_length': 5.28110599078341, '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}}
The Feasibility of a Search Engine for Metropolitan Vehicular Ad-Hoc Networks

Applications based on vehicular ad-hoc networks (VANETs) rely on information exchanged within the network. There are two different methods of exchanging information among vehicles, i.e. distributing it proactively or requesting it on-demand. Proactive distribution of information is suitable for distributing small amounts of data, comprising information of common interest for a large number of vehicles. In contrast, proactive distribution of data is not advisable if information contained therein is relevant only to a small number of vehicles or if it would require large amounts of data. A more efficient alternative in this case is on-demand information distribution, which allows information of interest to be located, requested and sent on-demand. On-demand information retrieval in sparse metropolitan-wide VANETs is challenging, as vehicles stay in the metropolitan area only for a short period of time and message exchange is impacted by communication delays. In this paper, we introduce three different concepts of a search engine for metropolitan VANETs and explain how these concepts could make it possible to allow on-demand information exchange. We compare the concepts for their applicability by evaluating their performance with respect to latency and network load.