MCFS Enhanced Route Selection Approach Using Multipath Carry Forwarding and Searching in VANET

MCFS Enhanced Route Selection Approach Using Multipath Carry Forwarding and Searching in VANET

Hiteshkumar Chandrakant Patel (Rai University, Ahmedabad, India) and Gopal Ramchandra Kulkarni (S.S. Agrawal Institute of Engineering & Technology, Navsari, India)
DOI: 10.4018/IJVTIS.2018010101
OnDemand PDF Download:
No Current Special Offers


This article describes how a vehicular ad-hoc network (VANET) is an infrastructureless network in which vehicles are connected without wires. Routing in VANET is challenging nowadays due to increased number of a vehicle, the high mobility of nodes, dynamically changing topology and highly partitioned network, so the challenges on the roads are also increased like the road congestion, the safety problem, speed, etc. Various protocol designs have been suggested by various authors to search and forward packets to the destination node. These various algorithms use different schemes like greedy forwarding, perimeter forwarding, carry and store approach, geographic location base approach, etc. The proposed system uses both beacon packets and a geographic closure node approach to forward packets. The beacon-based strategy includes a carry and search approach to search for a routing path. Geographic forwarding will start when carry and search forwarding fails to transmit packets. Route requests will perform multicasting while a route reply follows a unicast strategy. The new proposed system achieves good PDR and an end to end delay.
Article Preview

2. Preliminaries

Anchor-based Street-and Traffic-Aware Routing (A-STAR) is having aware about the physical environment or nodes around the vehicles. The protocol can take good routing decisions. Packet header consists of a list of junctions (anchors) that the packet must traverse. A-STAR depends on GSR. A-STAR also provides traffic density information to weigh the streets of the scenario inside packet info (Seet et al., 2004).

Connectivity-Aware Routing (CAR) algorithm is divided into three stages: (1) Searching location of destination node position and path to reach destination node, (2) use this path to transmit packets, and (3) maintaining the connection between nodes due to the mobility of vehicles (Naumov & Gross., 2007).

GPCR eliminate node planarization by using a planar graph. In this planar graph, nodes forward packets in both greedy as well as perimeter mode and stop at given junctions where a decision will be taken about which next road segment to turn into (Lochert et al., 2005).

Contention-Based Forwarding (CBF) (Fussler et al., 2007) is position-based unicast forwarding, without neighborhood knowledge. The forwarding decision is based on the actual position of the nodes when a packet is forwarded. The Packet is forwarded from source node to other or destination node in position based routing is done based on the local GPS location of the nodes (Füßler et al., 2003).

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 2: 1 Issue (2018)
Volume 1: 2 Issues (2017)
View Complete Journal Contents Listing