RVMF: RELIABLE ROUTING METHOD FOR VEHICULAR AD HOC NETWORKS USING MOTH-FLAME AND FIREFLY OPTIMIZATION ALGORITHMS

Vehicular ad hoc network (VANET) is fastest growing technology that ensure safe and efficient road traffic management. Mobility management is the main challenge in VANET. So, adaptive and stable routing protocol is a vital issue in VANET technology. Cluster-based VANET is getting more attention day by day. However, finding a solution that ensure longer lifetime of a moving vehicle in a cluster is essential. In this paper, we propose a new routing protocol for cluster-based VANET called central lane-based lifetime routing (CLLTR) to improve the quality of services. In the CLLTR scheme, to ensure the longer lifetime in cluster the cluster heads (CHs) should be selected from the central lane of the road. Because, the central lane cars will travel longer distance, i. e., lifetime will be larger, than other lane cars as the shape of the cluster is circular. Here, the CHs will also act as a gateway node of the clusters. Numerical simulations are carried out to evaluate the performance of the proposed CLLTR scheme. Results confirm that the proposed CLLTR scheme provides better stability than the conventional cluster-based life time routing (CBLTR) schemes of VANET.

Vehicular Ad Hoc Networks (VANET) are key to realizing Intelligent Transportation Systems (ITS). Although VANETs belong to the class of Mobile Ad Hoc Networks (MANET), and there are numerous routing protocols for MANETs, none of these protocols are applicable for VANETs. In particular, VANETs are highly dynamic due to high speed mobility of vehicles and traditional routing algorithms for MANETs cannot deal with such dynamicity of network nodes. Several comparative studies have suggested AODV (Ad hoc On-Demand Distance Vector), a well known MANET protocol that is adaptive to dynamic changes in network and makes efficient utilization of network resources, to be the best candidate for dealing with VANETs. However, verbatim adoption of AODV is not an efficient routing solution for VANETs. Recent works therefore proposed various modifications and/or additions to AODV to make it suitable for VANETs. It is particularly important to control congestion in VANETs by efficiently dealing with the AODV "Route Request" (RREQ) packets. In this paper, we propose Pro-AODV (Proactive AODV), a protocol that uses information from the AODV routing table to minimize congestion in VANETs, yet sustains other performance metrics at acceptable levels. The novelty and elegance in Pro-AODV comes from the fact that it does not require the execution of any additional logic, it is sufficient to know only the size of the routing table at each node.

Intelligent Transportation Systems (ITS) is an integrated approach being developed to exchange relevant information to increase the safety and efficiency of the road transportation systems. Vehicular Ad hoc Network (VANET), a variant of mobile ad hoc networks (MANET), is a core component of ITS. Performance of this smart ITS mainly owes to the design of efficient routing protocols in VANETs. Distinct features of VANETs like unsteady connectivity, high mobility and partitioning of the network have made routing of the information in VANETs difficult and challenging, hence dictating the development of efficient routing protocols. The computation of the best route measures the performance of communication whereas routing protocols takes care of communication & routing of the data. Provision of smart communication, necessitates the analysis of routing protocols in VANET. Accordingly in this paper we have reviewed various types of existing routing protocols in VANET, listing their advantages and disadvantages. Lastly possible inclinations of forthcoming research linked to VANET routing are discussed.

OF DISSERTATION Secure and Authenticated Message Dissemination in Vehicular ad hoc Networks and an Incentive-based Architecture for Vehicular Cloud Vehicular ad hoc Networks (VANETs) allow vehicles to form a self-organized network. VANETs are likely to be widely deployed in the future, given the interest shown by industry in self-driving cars and satisfying their customers various interests. Problems related to Mobile ad hoc Networks (MANETs) such as routing, security, etc. have been extensively studied. Even though VANETs are special type of MANETs, solutions proposed for MANETs cannot be directly applied to VANETs because all problems related to MANETs have been studied for small networks. Moreover, in MANETs, nodes can move randomly. On the other hand, movement of nodes in VANETs are constrained to roads and the number of nodes in VANETs is large and covers typically large area. The following are the contributions of the thesis. Secure, authenticated, privacy preserving message dissemination in VANETs: When vehicles in VANET observe phenomena such as accidents, icy road condition, etc., they need to disseminate this information to vehicles in appropriate areas so the drivers of those vehicles can take appropriate action. When such messages are disseminated, the authenticity of the vehicles disseminating such messages should be verified while at the same time the anonymity of the vehicles should be preserved. Moreover, to punish the vehicles spreading malicious messages, authorities should be able to trace such messages to their senders when necessary. For this, we present an efficient protocol for the dissemination of authenticated messages. Incentive-based architecture for vehicular cloud: Due to the advantages such as flexibility and availability, interest in cloud computing has gained lot of attention in recent years. Allowing vehicles in VANETs to store the collected information in the cloud would facilitate other vehicles to retrieve this information when they need. In this thesis, we present a secure incentive-based architecture for vehicular cloud. Our architecture allows vehicles to collect and store information in the cloud; it also provides a mechanism for rewarding vehicles that contributing to the cloud. Privacy preserving message dissemination in VANETs: Sometimes, it is sufficient to ensure the anonymity of the vehicles disseminating messages in VANETs. We present a privacy preserving message dissemination protocol for VANETs.

Intelligent Transportation System (ITS) is a critical factor for Vehicular Ad hoc Networks (VANET). Even though VANET belongs to the class of Mobile Ad hoc Network (MANET), none of the MANET routing protocol applies to VANET. VANET network is dynamic, due to increased vehicle speed and mobility. Vehicle mobility of VANET affects conventional routing algorithm performance, which deals with the dynamicity of the network node. The evaluation of the existing research stated that Ad hoc On-Demand Distance Vector (AODV) is an effective MANET protocol to adopt network changes for significant resource utilization and also provides effective adaptation in the network change. Due to the effective performance of the AODV protocol, it is considered as an effective routing protocol for VANET. This paper proposed an ad hoc TROPHY (TAD-HOC) routing protocol for the VANET network for increasing efficiency and effective resource utilization of the network. To improve the overall performance, ad hoc network is combined with Trustworthy VANET ROuting with grouP autHentication keYs (TROPHY) protocol. The proposed TAD-HOC protocol transmits data based on time demand in the VANET network with the desired authentication. Results of the proposed approach show the increased performance of the VANET network with packet delay, transmission range, and end-to-end delay. The comparative analysis of the proposed approach with I-AODV, AODV-R, and AODV-L shows that the proposed TAD-HOC exhibited effective performance.

<h2>Abstract</h2> <p><strong>Objective:</strong> The objective of this work is to enhance Adhoc On-demand Distance Vector (AODV) routing protocol for better communication through reliable routing scheme.<strong> Methods:</strong> 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. <strong>Findings:</strong> 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. <strong>Novelty:</strong> 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).</p> <p><strong>Keywords:</strong> VANET; Routing Protocol; RPAODV; Clustering; Reliable Routing; and Cluster message</p>

Kinetic mobility management applied to vehicular ad hoc network protocols

Vehicular Ad Hoc Network (VANET) is an application of the general concept of Mobile Ad hoc Network (MANET) in the transportation domain. Playing a key-role in Intelligent Transportation Systems (ITS), VANETs are vulnerable to threats that may jeopardize the in-vehicle security, thus subsequently causing accidents. Moreover, on looking at the connected car paradigm that enables interaction between both in-vehicle services as well as devices, and services with outside ones, VANETs will have to inherit security risks of conventional information technologies (IT) systems. This makes it necessary to resort to approaches providing supports and services that are capable to tackle the resulting wide range of security risks. Many works have been dedicated to VANETs security. Mostly the focus has been on data security, relying on cryptographic centric tools in order to ensure privacy, anonymity, and data security. Contrary to this, we propose an approach that aims to proactively address issues beyond data security that could hinder VANETs to become a reality if not properly faced. Although inspired by honeypots used in wired networks, it differs because of the need for tools and methods that should be sufficiently efficient and flexible to ensure context-awareness of security measures.KeywordsCyber securityHoneypotVANETIntelligent Transport System

In recent years, vehicular ad-hoc networks (VANETs) have received considerable attentions. As a promising approach to future Intelligent Transportation System (ITS), VANET is capable of providing safety related applications, Internet accessing and various user applications for drivers and passengers. To support efficient data interaction among vehicles, clustering based topology can be applied which groups vehicle nodes in geographical vicinity together, supports direct interaction inside one cluster and inter-cluster data interaction through cluster heads (CHs). Both K-means and K-Harmonic Means (KHM) algorithms are commonly-used clustering algorithms for wireless sensor networks, however, these algorithms cannot be applied to VANETs directly due to the specific characteristics of VANETs. In this paper, we propose an improved KHM algorithms, called Adaptive K-Harmonic Means (AKHM) clustering algorithm for VANETs, which jointly considers the available bandwidth of candidate CHs, and relative distance and velocity between cluster members (CMs) and CHs. To perform the proposed algorithm, the initial values of the number of clusters and the positions of each centroids are chosen and the weighted distance between vehicles and centroids is defined, based on which the objective function can be formulated, and the optimal CHs and the association between CMs and CHs can then be determined. The simulation results demonstrate the efficiency of AKHM algorithm.

Vehicular ad hoc networks (VANETs) are a special form of wireless networks made by vehicles communicating among themselves on roads. The conventional routing protocols proposed for mobile ad hoc networks (MANETs) work poorly in VANETs. As communication links break more frequently in VANETs than in MANETs, the routing reliability of such highly dynamic networks needs to be paid special attention. To date, very little research has focused on the routing reliability of VANETs on highways. In this paper, we use the evolving graph theory to model the VANET communication graph on a highway. The extended evolving graph helps capture the evolving characteristics of the vehicular network topology and determines the reliable routes preemptively. This paper is the first to propose an evolving graph-based reliable routing scheme for VANETs to facilitate quality-of-service (QoS) support in the routing process. A new algorithm is developed to find the most reliable route in the VANET evolving graph from the source to the destination. We demonstrate, through the simulation results, that our proposed scheme significantly outperforms the related protocols in the literature.

A survey on Intrusion Detection Systems and Honeypot based proactive security mechanisms in VANETs and VANET Cloud

The Internet of Vehicles (IoV) is one of the developing paradigms that integrates the automotive industry with the Internet of Things (IoT). The evolution of traditional Vehicular Ad-hoc Networks (VANETs), which are a layered framework for Intelligent Transportation Systems (ITS), is employed to provide Quality of Service (QoS) to end users in hazardous situations. VANETs can set up ad-hoc networks and share information among themselves using Peer-to-Peer (P2P) communication. Dynamic properties in VANETs such as dynamic topology, node mobility, sparse vehicle distribution, and bandwidth constraints can have an impact on scalability, routing, and security. This can result in frequent link failures, instability, reliability, and QOS concerns, as well as the inherent complexity of NP-hard problems. Researchers have proposed several techniques to achieve stability; the most prominent one is clustering, which relies on mobility metrics. However, existing clustering techniques generate overwhelming clusters, resulting in greater resource consumption, communication overhead, and hop count, which may lead to increased latency. Therefore, the primary objective is to achieve stability by increasing cluster lifetime, which is accomplished by generating optimal clusters. A nature-inspired meta-heuristic algorithm titled African Vulture Optimization Based Clustering Algorithm (AVOCA) is implemented to achieve it. The proposed algorithm can achieve load optimization with efficient resource utilization by mitigating hidden node challenges and ensuring communication proficiency. By maintaining an equilibrium state between the exploration and exploitation phases, AVOCA avoids local optima. The paper explores a taxonomy of the techniques used in Cluster Head (CH) selection, coordination, and maintenance to achieve stability with lower communication costs. We evaluated the effectiveness of AVOCA using various network grid sizes, transmission ranges, and network nodes. The results show that AVOCA generates 40% less clusters when compared to the Clustering Algorithm Based on Moth-Flame Optimization for VANETs (CAMONET). AVOCA generates 45% less clusters when compared to Self-Adaptive Multi-Kernel Clustering for Urban VANETs (SAMNET), AVOCA generates 43% less clusters when compared to Intelligent Whale Optimization Algorithm (i-WOA) and AVOCA generates 38% less clusters when compared to Harris Hawks Optimization (HHO). The results show that AVOCA outperforms state-of-the-art algorithms in generating optimal clusters.

Vehicular Ad hoc Networks (VANETs) that are considered as a subset of Mobile Ad hoc Networks (MANETs) can be applied in the field of transportation especially in Intelligent Transportation Systems (ITS). The routing process in these networks is a challenging task due to rapid topology changes, high vehicle mobility and frequent disconnection of links. Therefore, developing an efficient routing protocol that satisfies restriction of delay and minimum overhead is faced with many difficulties and limitations. Also, the detection of malicious vehicles is a significant task in VANETs. To address these issues, using Unmanned Aerial Vehicles (UAVs) can be helpful to cope with these limitations. In this paper, operation of UAVs in ad hoc mode and their cooperation with vehicles in VANETs are studied to help in the process of routing and detection of malicious vehicles. A routing protocol named VRU is proposed that includes two distinct ways of routing of data: (1) delivering packets of data between vehicles with the help of UAVs using a protocol named VRU_vu, and (2) routing packet of data between UAVs using a protocol named VRU_u. The NS-2.35 simulator under Linux Ubuntu 12.04 is utilized in order to appraise the performance of VRU routing components in an urban scenario. Also, VanetMobiSim generator of mobility and MobiSim are used to produce the motions of vehicles and to produce the motions of UAVs, respectively. The performance analysis displays that VRU protocol can improve the packet delivery ratio by 16% and detection ratio by 7% compared to other reviewed routing protocol. Also, VRU protocol decreases end-to-end delay by an average of 13% and overhead by 40%.

Vehicular communication networks are a type of network in which vehicles and roadside units are the communicating nodes, providing each other with information such as safety warnings and traffic information. As a cooperative approach, vehicular communications can be more effective in avoiding accidents and traffic congestion, rather than each vehicle trying to solve these problems individually. Therefore, intelligent transportation systems (ITS) have been developed to address the challenges of the safety, security, and efficacy of the current transportation systems. The field of inter vehicular communications (IVC) includes both vehicle-to-vehicle (V2V) and vehicle-to infrastructures (V2I) communication and is also known as the vehicular ad hoc network (VANET). The VANET is recognized as an important component of ITS in various national plans [1]. Direct communication between vehicles may be set up by means of mobile ad hoc networks (MANETs), which do not depend on the altered foundation. Research on MANETs covers the application prerequisites and correspondence conventions for everything from sensor systems to handheld PCs and vehicular frameworks [2].

Multiagent driven dynamic clustering of vehicles in VANETs