{'fraction_non_alphanumeric': 0.025362318840579712, 'fraction_numerical': 0.0, 'mean_word_length': 5.453271028037383, '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 probabilistic model for message propagation in two-dimensional vehicular ad-hoc networks

Vehicular ad-hoc networks (VANET) promise to enhance the road safety and travel comfort significantly in both highway and city scenarios. Message propagation, either for emergency or pleasure purposes, constitutes a major category of VANET applications, and is particularly challenging in infrastructure-less vehicle-to-vehicle communication scenarios. In this paper, we study the connectivity property of message propagation in two-dimensional VANET. We first derive the exact expression for the average size of the connected components in the one-dimensional case, i.e., messages propagating along a main street, and give a close approximation to the size distribution. We further derive the connectivity of message propagation in the two-dimensional ladder case, i.e., covering the main and two side streets, and formulate the problem for the two-dimensional lattice case to cover all the blocks in a district. Extensive simulation has been conducted to verify the analytical model and provide further insights in message propagation with and without geographic constraints, respectively. The simulation results show the efficacy of the model and the tradeoff between these two message forwarding strategies, and provide guidelines for future network planning and protocol development.