Performance Evaluation of Location-Based Geocast Routing Using Directed Flooding Rectangular Forwarding Zone in City VANET

Vehicular ad hoc network (VANET) is an application of mobile ad hoc network (MANET) where vehicular nodes are integrated with GPS and other controlling devices to communicate among each other. Because of predefined structure of roads as well as very high moving speed of vehicles, routing becomes an extremely challenging issue in VANET. In literature, authors in research papers related to vehicular communication evaluate mostly the performance of topology or position-based routing protocols. This article implements a geocast approach called directed flooding rectangular forwarding zone in distance-effect routing algorithm for mobility (DREAM), location aided routing (LAR) and zone routing protocol (ZRP) for city vehicular environment. Packet delivery ratio normalized routing load, delay, throughput, dropped packet ratio and bandwidth wastage parameters are evaluated using NS-2.33 integrated with IEEE802.11p and IDM_IM based VanetMobiSim. The impact of mobility on these parameters is also analyzed

Routing in a many-to-one communication scenario in a realistic VDTN

In this paper, we evaluate and compare the performance of different routing protocols in a many-to-one communication within a Vehicular Delay Tolerant Network (VDTN). Seven groups with three stationary sensor nodes sense the temperature, humidity and wind speed and send these data to a stationary destination node that collect them for statistical and data analysis purposes. Vehicles moving in Tirana city roads in Albania during the opportunistic contacts will exchange the sensed data to destination node. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. For the simulations we considered two different scenarios where the distance of the source nodes from the destination is short and long. For both scenarios the effect of node density, ttl and node movement model is evaluated. The performance is analyzed using delivery probability, overhead ratio, average latency, average number of hops and average buffer time metrics. The simulation results show that the increase of node density increases the delivery probability for all protocols and both scenarios, and better results are achieved when shortest-path map-based movement model is used. The increase of ttl slightly affects the performance of all protocols. By increasing the distance between source nodes and destination node, delivery probability is decreased almost 10% for all protocols, the overhead for sprayandwait protocol does not change, but for other protocols is slightly increased and the average number of hops and average latency is increased.Peer ReviewedPostprint (author's final draft

Secure Anonymous Routing for MANETs Using Distributed Dynamic Random Path Selection

Most of the MANET security research has so far focused on providing routing security and confidentiality to the data packets, but less has been done to ensure privacy and anonymity of the communicating entities. In this paper, we propose a routing protocol which ensures anonymity, privacy of the user. This is achieved by randomly selecting next hop at each intermediate. This protocol also provides data security using public key ciphers. The protocol is simulated using in-house simulator written in C with OpenSSL crypto APIs. The robustness of our protocol is evaluated against known security attacks