Optimal epidemic broadcasting for vehicular ad hoc networks

The primary goal of Vehicular Ad-hoc Network (VANET) technology’s development is to increase road safety and enable Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communication in order to share crucial information and prevent road accidents. VANET establishes a mobile network between moving cars by considering each vehicle as a separate entity. Safety applications in VANET are currently receiving a lot of attention from researchers as well as automobile manufacturers. This paper concentrate on simulation-based safety-critical techniques in vehicle networks employing radar and video sensors in various road styles. This paper discusses about how to create a simulation-based driving scenario environment and calculates the fluctuations in sensor detection rates depending on different driving conditions. And also created a basic Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communication network. An integrated approach is also proposed to Forward Collision Warning System (FCWS) in different cases.

Vehicular Ad-hoc Network (VANET) is an emerging technique dedicated to wireless vehicular communication to improve transportation safety by exchanging driving information between vehicles. For safety purposes, vehicles periodically broadcast a safety packet via Vehicle-to-Vehicle (V2V) communication. Accordingly, VANET safety applications demand a reliable exchange of the safety packet with high Packet Delivery Ratio (PDR), acceptable latency, and communication fairness. However, the communication performance significantly degrades due to numerous packet collisions when a large number of vehicles simultaneously access limited channel resources for the safety broadcast. In particular, the problem grows more severe in congested VANETs absent infrastructures since vehicles must control channel access using a self-adaptive scheme without external assistance. Thus, a robust and decentralized channel access protocol for VANETs is required to achieve road safety. In this paper, we propose an intelligent channel access algorithm empowered by cooperative Reinforcement Learning (RL), in which vehicles coordinate the channel access in a fully-decentralized manner. We also consider a proper interaction scheme between vehicles for enhancing the V2V safety broadcast in infrastructure-less congested VANETs. We provide evaluation results with extensive simulations according to various levels of traffic congestion. Simulations confirm the superior performance of the algorithm: the algorithm has a 20% increase in PDR compared to the latest RL-based channel access scheme. Furthermore, the algorithm satisfies the low latency requirement of VANET safety applications as well as both short-term and long-term communication fairness.

Objectives: To explored the highlighted obliged QoS routing issue in Vehicular Ad hoc Networks (VANETs). Methods/ Statistical Analysis: The issues are tended to firstly by working up an association faithful quality model considering the topological and numerical properties of vehicular advancements and speeds. The VANET correspondence diagram in advancing chart hypothesis is used to model and organize the formed association trustworthiness shown into it. In light of the consequent intensified chart diagram illustrate, the most tried and true course in the framework is picked. However course assurance does not ensure awesome transmission as well. Findings: Vehicular extraordinarily designated Systems (VANETs) are a particular sort of remote framework made by vehicles giving among themselves and with roadside base stations. A broad assortment of organizations has been made for VANETs going from security to infotainment applications. A key need for such organizations is that they are offered with Nature of Administration Quality of Service (QoS) guarantees similar to organization unfaltering quality and availability. QoS routing expect an essential part in recognizing courses that meet the QoS necessities of the offered organization over VANETs. For filtering the achievable courses it subject to various QoS goals is with everything taken into account a NP-difficult issue. Furthermore, the reliability of the routing ought to be given unprecedented thought as correspondence associations, as frequently as conceivable in VANETs. In present situation, the most existing QoS routing calculations are been PSO algorithm for stable VANET system without considering the security and wellbeing of the routing procedure. Along these lines, they are not appropriate for applications in VANETs. Application/Improvements: Low complexity nature advanced administration dependable routing calculation is made to ensure to lessen transmission redundancy with use of Subterranean insect State estimation with better eventual outcomes of course decision and transmission considering better request and sorting calculations in the Particle Swam Optimization (PSO) algorithm work calculation for extremely powerful VANET system with less preferred quality in evaluation with favoured data transmission over interchange QoS counts as shown by the results and satisfy QoS requirements of specific traffic using PSO in the VANET routing protocol environments. Meanwhile, an optimized function with PSO is also proposed to make scheduling decisions so that the dropped packet rates are reduced. The results of PSO algorithm simulations are better and feasible as compared to the previous techniques. Keywords: Graph Theory, Optimised Service Reliable Routing Algorithm, Particle Swam Optimization, Quality of Service, Roadside Base Stations, VANET

Vehicular Adhoc Network (VANET), is an emerging technology that holds the opportunity to create potential applications that directly impact peoples' lives, traffic management, and infotainment services. Understanding VANET applications and the available routing protocols can help to infer the most suitable protocols that satisfy VANET application requirements. This paper develops a systematic classification methodology to classify VANET applications from a routing perspective, each application class has different network requirements which are laid down by VANET Projects conducted in different countries. Some of these requirements are related to the routing aspects and need to be satisfied by the selected routing strategies (proactive and reactive). The paper identifies routing strategies performance metrics related to each application class requirement, to efficiently guide the development of these routing strategies towards guaranteeing satisfactory performance for the applications under a wide variety of realistic VANET scenarios. It is also worth mentioning that minimum delay is a requirement needed by time and event-driven application classes. However, high reliability is a requirement needed by on-demand applications. The paper aims to provide a comparative study on the performance of routing strategies in different VANET application classes, to identify which routing strategies have better performance in specific VANET applications class. End-to-end delay is employed as a performance metric to evaluate the short delay requirement, while, the Routing Overhead (RO) is used to assess the reliability requirement. Simulation results showed that proactive routing protocol has a lower delay, which means that it is suitable for delay-sensitive applications such as time-driven and event-driven applications. The result also showed that the reactive routing protocol outperforms the proactive routing protocol in terms of RO, which means that reactive routing protocols can be nominated as proper routing strategies to satisfy the reliability requirement of the On-demand driven applications.

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

Vehicular Ad hoc Networks (VANETs) have become a cornerstone component of Intelligent Transportation Systems (ITS). VANET applications present a huge potential for improving road safety and travel comfort, hence the growing interest of both academia and industry. The main advantage of VANETs is its ad hoc nature which does not require fixed infrastructure or centralized administration. However, designing scalable information dissemination techniques for VANET applications remains a challenging task due to the inherent nature of such highly dynamic environments. Existing dissemination techniques often resort to simulation for performance evaluation and there are only few studies that offer mathematical modeling. In this paper we provide a comparative study of existing performance modeling approaches for data dissemination techniques designed for different VANET applications.

Communication messages in vehicular ad hoc networks (VANET) can be used to locate and track vehicles. While tracking can be beneficial for vehicle navigation, it can also lead to threats on location privacy of vehicle user. In this paper, we address the problem of mitigating unauthorized tracking of vehicles based on their broadcast communications, to enhance the user location privacy in VANET. Compared to other mobile networks, VANET exhibits unique characteristics in terms of vehicular mobility constraints, application requirements such as a safety message broadcast period, and vehicular network connectivity. Based on the observed characteristics, we propose a scheme called AMOEBA, that provides location privacy by utilizing the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">group navigation of vehicles</i> . By simulating vehicular mobility in freeways and streets, the performance of the proposed scheme is evaluated under VANET application constraints and two passive adversary models. We make use of vehicular groups for anonymous access to location based service applications in VANET, for user privacy protection. The robustness of the user privacy provided is considered under various attacks.

Vehicular Ad Hoc Network (VANET) is a promising area of research and development as it has remarkable role in improving safety of vehicles on road, efficient traffic management, and providing comfort to commuters. The typical characteristics of VANET environment pose several challenges for VANET application developers. There is always a demand for scalable communication mechanisms suitable for low- and high-speed vehicles, information dissemination techniques that suit sparse and dense traffic conditions. Thus, the reliability of any VANET application strongly depends upon the robustness of the underlying communication architecture. Any VANET communication model shall strictly adhere to the wireless access standards and specifications laid down for vehicular communications. In this work, we have designed and implemented a basic VANET communication model that facilitates both Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communication adhering to IEEE 802.11p standards. The Physical and Link Layer extensions of WAVE standard have been integrated to EXata5.1 (network emulator) to support IEEE 802.11p communication. Necessary Graphical User Interface and library level extensions were made to create VANET scenarios. To demonstrate and evaluate our communication model, urban scenarios with different node densities were created in EXata. The communication scenarios were emulated with predefined mobility of nodes, CBR as the traffic application and Bellman Ford as the default routing protocol. Using EXata analyzer, the performance metrics were analyzed and found that our basic VANET communication model offers good throughput at high vehicle densities with a soft delay constraint.

Vehicular Ad Hoc networks (VANETs) have been employed in supporting several applications related to safety and comfort. VANET applications have strict security requirements, as they have direct impact on people comfort and safety. Although many ordinary networks security systems can be applied to provide security services in VANET, the key establishment between legitimate vehicles is the common challenge among all of these systems. This paper proposes a secret key establishment technique for vehicular communications exploiting the special properties and randomness inherent of the wireless channel. Our comprehensive simulations show that the proposed key extraction technique suits VANETs rather than other communication systems, owing to the multi environments operation of VANET which causes more randomness due to fading, noise multipath and velocity variation. The proposed approach can be tuned to extract low or high rate secret key with high entropy rate and less information exchange between legitimate vehicles. The extracted secret key can be employed to support providing security services in VANET.

Analysis and adaptive optimization of vehicular safety message communications at intersections

The increasing number of moving vehicles along roads and the lack of supporting infrastructure is a wellestablished problem. Major consequences are augmenting of traffic jams, accidents, fuel consumption and pollution. Vehicular Ad hoc NETworks (VANETs) represent opportunities to deal with the aforementioned problems. In VANETS, efficiency and safety to applications are provided using communication support. In efficiency applications, each vehicle is aware of its location. Using this information and communication support, vehicles collaborate to reduce travel time and to improve mobility. In contrast, safety applications aim to reduce or even avoid accidents, and must obey strong timing constraints. In this context, VANETs applications can benefit from Computational Intelligence (CI) and adaptive approaches to implement the required demands. Thus, the contribution of this paper is twofold: $( i)$ we discuss how VANETs can benefit from CI and Artificial Intelligence techniques to make transportation networks more efficient regarding to safety applications, and, $( ii)$ we report our current work and new directions in the development of efficiency applications to VANETs using adaptation and CI techniques.

Vehicular Ad-hoc Networks (VANETs) offer immense potential for revolutionizing modern transportation systems through real-time communication and interaction between vehicles and roadside infrastructure. These networks can significantly enhance traffic management, improve safety, and support various vehicular services. However, ensuring secure communication in VANETs remains a critical challenge due to the highly sensitive nature of the data exchanged, such as location and personal information. Current authentication schemes, including the ANEL scheme, exhibit vulnerabilities like data interception and tracking risks. In this paper, we propose a novel, efficient, and lightweight authentication scheme that leverages elliptic curve cryptography (ECC) and message mapping techniques to address these security issues. The proposed solution strengthens encryption, enhances privacy protection, and mitigates risks such as unauthorized access and man-in-the-middle attacks. Furthermore, the scheme offers scalability and distinguishes between regular and priority users, making it adaptable to various VANET applications. This approach significantly improves the overall security and privacy framework of VANET systems while ensuring the efficient use of computational resources in vehicular environments.

LEAPER: A lightweight reliable and faithful data packet relaying framework for VANETs

Classical ad-hoc network algorithms become impractical for Vehicular Ad Hoc Networks when density of vehicles is low in rural areas and during the periods when the vehicle traffic is low in cities (such as at night). End-to-end connectivity requirement of these algorithms causes deflection. Connections get broken when a suitable network element isn't available for data transfer. This problem which occurs in low dense partially connected Vehicular Ad hoc Networks can be solved by using delay tolerant approaches in routing algorithms. By using the store-carry-forward method, data is carried by network elements until a suitable network element is found. By this way, network connectivity is provided in a delayed manner between momentarily disconnected vehicles. In this paper, the impact of delayed transfer of data to an end-to-end transfer and the impact of data lifetime to the network performance are examined. Considering the speed of vehicles and the desired throughput, lifetime of data is determined according to the network connectivity. The results of this study contribute to the fulfilment of the Quality of Service (QoS) requirements in Vehicular Ad Hoc Network applications.

Vehicular ad hoc network (VANET) is one of the most promising large-scale applications of mobile ad hoc networks. VANET applications are rooted in advanced understanding of communication networks because both control messages and data information need to be disseminated in geographic regions (i.e., Geocast). The challenges come from highly dynamic environments in VANET. Destination nodes in geocast are dynamic over time due to vehicle mobility, which undermines existing results on dissemination latency and information propagation speed with pre-determined destinations. Moreover, the affected area by the dissemination, which is referred to as horizon of message (HOM), is critical in geocast as it determines the latency for the message reaching nodes inside the area of interest (AOI), in which the message is relevant to drivers. Therefore, we characterize the HOM in geocast by how far the message can reach within time t (referred as dissemination distance) and how long the message takes to inform nodes at certain locations (referred as hitting time). Analytic bounds of dissemination distance and hitting time are derived under four types of dissemination mechanisms, which provide insights into the spatial and temporal limits of HOM as well as how the numbers of disseminators and geographic information exchanges affect them. Applying analytic and simulation results to two real applications, we observe that geocast with AOI near the source or high reliability requirement should recruit multiple disseminators while geocast with AOI far from the source need to utilize geographic information for fast message propagation.