{'fraction_non_alphanumeric': 0.02663934426229508, 'fraction_numerical': 0.0010245901639344263, 'mean_word_length': 4.815476190476191, '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 Dispersion Sorting Mechanism for Vehicular Ad Hoc Network

In recent years, the issue of Vehicle Ad Hoc Network (VANET) is more and more popular. The network of VANET composed mainly of moving vehicles and fixed Road Site Units (RSU). Because it is expensive to establish RSUs, the number of RSUs is too less to cover all area such as suburbs. In other words, the resources of RSUs are more sparse and precious than vehicles. In order to promote the utility of RSUs, we propose a novel mechanism to arise the efficiency of communication between vehicle and RSU (Vehicle to Infrastructure, V2I). In this paper, the mechanism that we proposed is called “Dispersion Sorting Mechanism (DSM)”. In DSM, each vehicle can calculate their priority of communication individually and reduce the time to compete and obtain the channel. On the other hand, we consider the leaving vehicles from the coverage of communication and adjust their priorities of communication appropriately too.