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 (RPAODV) 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.5 saverage), and throughput (10 kbps high). Keywords: VANET; Routing Protocol; RPAODV; Clustering; Reliable Routing; and Cluster message
Highlights
Vehicular Ad-hoc Network (VANET) reduces the death rate due to road accidents through the wireless communication in Intelligent Transportation System (ITS) [1,2,3,4]
The traffic congestion is reduced in VANET that has a new cluster-based routing protocol combining a modified k-means algorithm with continuous Hope field network and maximum stable set problem(KMRP) [19]
The simulation results show the proposed RPAODV protocol compares with previous works i.e., Cluster-based VANET oriented Evolving Graph (CVoEG), LP-Ant Colony Optimization (ACO)
Summary
Vehicular Ad-hoc Network (VANET) reduces the death rate due to road accidents through the wireless communication in Intelligent Transportation System (ITS) [1,2,3,4]. It excels in various applications in terms of location-based and service-based [9,10,11]. In paper [14,15,16,17,18], new clustering formation technique is proposed to avoid destruction of network links and efficient routing. In the research [15], AODV and Ant Colony Optimization (ACO) technique is applied to reduce congestion in network. The traffic congestion is reduced in VANET that has a new cluster-based routing protocol combining a modified k-means algorithm with continuous Hope field network and maximum stable set problem(KMRP) [19]. Protocols methodologies, strength, and limitations considered [15,16,18,19,20]
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
