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.

The In wireless mobile ad hoc network, each node / junction is proficient of transfer message (information) with dynamism without constraint of any permanent infrastructure environment. Movable nodes commonly progress inside or outside from the entire network dynamically, building network topology unbalanced in mobile ad-hoc network (MANET). In a privacy preserving network group, cluster head is dependable for communication with associates in a cluster which consumes additional battery (energy) supremacy in evaluation to cluster members in a cluster. As a message transmission inside and outside cluster as a result, it becomes an enormously testing job to maintain stability in network. In this paper aims to present a cluster based privacy preserving routing protocol selection algorithm in inside and outside cluster using NS (Network Simulator) 2.34 Framework. The proposed routing protocol selection based Cluster head selection formation operates exclusively based on source routing and on-demand process, it has been selected as the routing protocol to be executed and tested for ad hoc network application characterized by a source on-demand message conversation between nodes in a portable ad hoc network

The Trusted Key Management Protocol (TKMP) provides one of the most secure communication technologies in MANET cluster-based data protection. For security reasons, TKMP is a trusted key that can be sent to all nodes in the communication cluster. This document introduces the Trusted Key Management Protocol (TKMP) feature to improve the quality of secure communications over a cluster-based wireless network. The proposed TKMP execution process includes CBPPRS (Cluster Based Privacy Preserving Routing Selection), LBCPR (Load Balancing Cluster Based Privacy Routing) and DLBPS (Dynamic Load Balancing Privacy Path Selection) procedure. To lock the data from the malicious node, the Paillier Cryptosystem (PC) encrypts packets with homomorphic encryption. The trust score makes it easier to update routing information and improves network throughput. The experimental results show that the proposed TKMP method works better than the other Trust-ECC method.

No abstract