NEIGHBOR ROUTING CONTROL USING RELATIVE ROUTING PACKET FLOW ALGORITHM (NRC-RRPFA) TO IMPROVE THE DATA TRANSMISSION ROUTING IN VEHICULAR AD HOC NETWORK

Abstract

Vehicle ad-hoc networks are highly mobile wireless networks for energy consumption. The Ad-Network in the routing environment become probable in traffic conditions. A VANET provides a vehicle-to-vehicle connection that can be used in communication as in the form of data flow information in energy constraint level. The data transmission of the wireless communication device a mounted on the vehicle network as well in the defined network. The relative transmission algorithm in each time slot is used to predict all users that are predictable to connect to the Routing relay nodes created mitigation. Therefore, try to find the nearest facility here from the specified location and the path between any two points of the service area destination defined factors dominate the average path loss and the propagation speed and time and the probability distribution of VANET vehicle infrastructure communication delays. To propose a Neighbor routing Control using Relative Routing packet Flow algorithm (NRC-RRPFA) to improve the data transmission routing in vehicular ad hoc network. To improve the Data speed, efficiency and determine the path, optimization problem. To address this, delay-tolerant communications also fly around. The protocol allows location based nodes to carry packets back to their anchor location from the point of relay nodes. where they periodically first separated to make easy communication medium. A unique feature of this protocol is that when it is moved away from the origin, the recorded geographic track is the improve the network communication to optimize the return path. the performance improvement will become even more by neighbor routing.