{'fraction_non_alphanumeric': 0.016464471403812825, 'fraction_numerical': 0.0017331022530329288, 'mean_word_length': 5.3812154696132595, '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}}
Position Based Routing Protocol for a City Environment

Recently, Vehicular ad hoc networks (VANETs) have started receiving significant attention from both academia and industry. In order to support safety related applications in delay tolerant networks, the design of an efficient routing protocol for VANETs is extremely crucial. The main requirement for all routing protocols is to achieve minimum delay with minimum consumption of network resources. In this paper we propose a position-based routing algorithm namely position-based routing with Most Forward within Radius (PRMFR) which clearly enhances the performance of the system compared to flooding based routing protocols such as epidemic routing in terms of packet dropping probability and the total number of transmissions. Position based routing protocols are known to use the node’s geographical locations in order to initiate a route between the source and the destination. Moreover, we introduce a percentage of greedy nodes to both protocols, and study their impact on the performance. Furthermore, a 3x3 km Manhattan mobility model is presented to examine the performance of our scheme.