{'fraction_non_alphanumeric': 0.027833001988071572, 'fraction_numerical': 0.005301524188204109, 'mean_word_length': 5.62280701754386, '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}}
On Trajectory-Based I2V Group Message Delivery Over Vehicular Ad-Hoc Networks

In the literature, future vehicle trajectories have been exploited to improve the performance of challenging infrastructure-to-vehicle (I2V) group message delivery over vehicular ad-hoc networks (VANETs). The existing trajectory-based I2V group message delivery protocols typically consist of two phases. Based on the reported vehicle trajectories, phase one identifies an appropriate rendezvous point of the group message and each of the member vehicles. Then, phase two composes a multicast tree to deliver the message to these selected rendezvous points. The message is kept at the rendezvous points for later last-hop delivery when the member vehicles pass through. However, separately handling the rendezvous point selection and the multicast tree construction may significantly restrict the overall message delivery performance. This paper designs a novel trajectory-based I2V group message delivery protocol, i.e., eTGMD, for delay-tolerant vehicular applications. eTGMD iteratively selects a promising rendezvous point and extends the current multicast tree to cover the selected rendezvous point. Our specific contributions include the following: 1) We prove the trajectory-based I2V group message delivery problem's NP-hardness, 2) we theoretically analyze the worst-case performance bound and time complexity of eTGMD, and 3) we conduct extensive simulation experiments to evaluate eTGMD's message delivery performance.