{'fraction_non_alphanumeric': 0.025506867233485938, 'fraction_numerical': 0.0013080444735120995, 'mean_word_length': 4.9765625, '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 Novel Methodology for Traffic Monitoring and Efficient Data Propagation in Vehicular Ad-Hoc Networks

A vehicular ad hoc network is an emerging technology, however some challenging issues need to be resolved. In recent years, road congestion and traffic related pollution have a large negative social and economic impact worldwide. For better public transport, strategic planning, traffic monitoring is required to cut pollution and congestion. One of the important attributes of traffic data is the interval between the time that the data are generated by a vehicle on a particular road and the time that the data is made available to the user as a query response and also to select the fastest route to a destination in a reliable manner. To address these issues, this work focuses on two routing algorithms for VANETS 1) Delay bounded greedy forwarding(D- Greedy) 2)Delay bounded minimum cost forwarding (D-MinCost). The first proposed algorithm (D-Greedy) exploits local traffic conditions, i.e., information about the speed and density of cars at the road segment that it currently traverses. The second algorithm (D-MinCost) assumes knowledge of global traffic conditions, i.e., statistical information about the speed and density of cars on every road segment of the city. This work explores on the current traffic conditions on that road segment. Also a framework is proposed for vehicular networks that jointly optimizes the two key processes associated with monitoring traffic i.e. data acquisition and data delivery.