Reliable path identifying protocol in VANET

Abstract

Objective: The objective of this work is to enhance Adhoc On-demand Distance Vector (AODV) routing protocol for better communication through reliable routing scheme. Methods: In this paper, a reliable path selection algorithm is proposed to find the Most Reliable Path (MRP) between the source and destination vehicles. Reliable Path Ad-hoc On demand Distance Vector (RP-AODV) is proposed for efficient route discovery in Vehicular Ad-hoc Network (VANET). The algorithm divide network into manageable group and it maintains Cluster Member (CM) updates handling, Cluster Head (CH) re-selection, Cluster merging. The efficient routing decisions would lead to better communication in VANET. It is made by assigning dynamic and static information appropriately to the variables in process. The dataset used is both static and dynamic which is efficient in when compared with existing protocols. Findings: The finding of most reliable path in the network of VANET is carried out by the proposed reliable path selection algorithm. The algorithm divides the network as various parts that comprise the information of clustering. The clustering is the mechanism of grouping of nodes into clusters. Clusters possess members and head. The cluster head would be the point of initiation of communication and any node can be re-selected as cluster head. The members of clusters would be updated as per changes in clustering mechanism. The uniqueness of the proposed algorithm revealed through easy identification of vehicles to form a cluster, cluster members maintenance, and fast data communication over the network. The proposed RPAODV adds the extra fields for RouteREQuest (RREQ) and RouteREPly (RREP) messages (CH and CM information). It also works out for static and dynamic topology in good manner by the implementation of modified AODV algorithm. The scalability is also taken care by enhancing topology variant. The performance of the algorithm is measured and analyzed with the existing protocols and posted in graphs. Novelty: The simulation results show that the proposed work outperforms 60% than the existing schemes works Cluster-based VANET-oriented Evolving Graph( CVoEG), Leapfrog-Anti-Colony Optimization(LP-ACO) in terms of route reliability (0.11s high), packet delivery ratio (20% high), end to end delay (0.

CPDD: Clustering and Probabilistic based Data Dissemination in Vehicular Adhoc Networks

“…In 2003, Europe and Japan developed Dedicated Short Range Communication (DSRC) to support vehicle-to-vehicle (V2V) and vehicleto-infrastructure (V2I) communications (6) . The Challenges during data dissemination are scalability, security and trust, Quality of Service, Data Transmission in presence of Disconnection, High Mobility and Frequent Disconnections (7) .…”