{'fraction_non_alphanumeric': 0.018698578908002993, 'fraction_numerical': 0.0, 'mean_word_length': 5.311320754716981, '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}}
Defensive mechanism for VANET security in game theoretic approach using heuristic based ant colony optimization

The communications in VANET consists of roadside units (RSUs) linked to each other or even to the Internet. In the recent vehicular approach, VANETs security properties have received more attention in research community. We improve the game theoretic approaches for the application cases having scenarios with few known opponents and others with opponent uncertainty. In this work, we plan to introduce a defensive mechanism for the VANET security with heuristic based ant colony optimization. The heuristic based ant model, worked with known opponents and unknown opponents based on the density of pheromone deposited in the road network path with new road path exploration with traversal of ants. Then the Nash equilibrium is applied with the game theoretic framework to identify the stability state of the players involved in it. Optimal exploitation of traffic organizes and security framework is investigated both in the static (e.g., preset roadside units) and active cases (e.g., mobile law enforcement units). An experimental evaluation is carried out to evaluate the performance of the proposed defensive mechanism in game theoretic approach using heuristic based ant colony optimization [DMGTA] for VANET security.