{'fraction_non_alphanumeric': 0.015473887814313346, 'fraction_numerical': 0.0, 'mean_word_length': 4.880681818181818, '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}}
Vehicular parking space discovery with agent approach

Finding a parking space is a common challenge faced by millions of city-dwellers every day. An attempt is made with wireless ad-hoc networking technologies, which offer a new and efficient means to simplify the process of parking as well as extending the convenience for drivers. This paper presents a novel parking space discovery mechanism for Vehicular Ad-hoc Networks (VANETs) using intelligent Unique Routing Agents (URAs). URAs periodically collect routing and service availability information and index the same in appropriate URA nodes. Every node in the network is close to at least one URA node. The vehicle node running an application in need of a parking space dispatches a Discovery Agent to its nearest URA node. The index available at the URA node will guide the Discoverer Agent to the service node. The method has been simulated over VANET and simulation results show that the system has satisfactory data delivery ratio and response time for number of requests.