scholarly journals Modeling the Accuracy of Estimating a Neighbor’s Evolving Position in VANET

2020 ◽  
Vol 10 (19) ◽  
pp. 6814
Author(s):  
Jae-Han Lim ◽  
Eun-Kyu Lee
Keyword(s):  
Network Performance ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Estimation Error ◽  
Numerical Results ◽  
Transport Systems ◽  
Accurate Estimation ◽  
Delivery Ratio ◽  
Proposed Model ◽  
Hoc Networks

Accurate estimation of a neighbor’s evolving position is essential to enhancing safety in intelligent transport systems. A vehicle can estimate a neighbor’s evolving position via periodic beaconing wherein each vehicle periodically broadcasts a beacon including its own kinematic data (e.g., position, speed, and acceleration). Many researchers have proposed analytic models to describe periodic beaconing in vehicular ad-hoc networks (VANETs). However, those models have focused only on network performance, e.g., packet delivery ratio (PDR), or a delay, which fail to evaluate the accuracy of estimating a neighbor’s evolving position. In this paper, we present a new analytic model capable of providing an estimation error of a neighbor’s evolving position in VANET to assess the accuracy of the estimation. This model relies on a vehicle system using periodic beaconing and a constant speed and position estimator (CSPE) to estimate a neighbor’s evolving position. To derive an estimation error, we first calculate the estimation error using a simple equation, which is associated with a probability of successful reception. Then, we derive the probability of successful reception that is applied onto the error model. To our knowledge, this is the first paper to establish a mathematical model to assess the accuracy of estimating a neighbor’s evolving position. To validate the proposed model, we compared the numerical results of the model with those of the NS-2 simulation. We observed that numerical results of the proposed model were located within the 95% confidential intervals of simulations results.

Modified fuzzy-based greedy routing protocol for VANETs

2020 ◽  
Vol 39 (6) ◽  
pp. 8357-8364
Author(s):  
Thompson Stephan ◽  
Ananthnarayan Rajappa ◽  
K.S. Sendhil Kumar ◽  
Shivang Gupta ◽  
Achyut Shankar ◽  
...  
Keyword(s):  
Fuzzy Logic ◽  
Routing Protocol ◽  
Intelligent Transportation Systems ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Research Area ◽  
Transportation Systems ◽  
Delivery Ratio ◽  
Greedy Routing ◽  
Hoc Networks

Vehicular Ad Hoc Networks (VANETs) is the most growing research area in wireless communication and has been gaining significant attention over recent years due to its role in designing intelligent transportation systems. Wireless multi-hop forwarding in VANETs is challenging since the data has to be relayed as soon as possible through the intermediate vehicles from the source to destination. This paper proposes a modified fuzzy-based greedy routing protocol (MFGR) which is an enhanced version of fuzzy logic-based greedy routing protocol (FLGR). Our proposed protocol applies fuzzy logic for the selection of the next greedy forwarder to forward the data reliably towards the destination. Five parameters, namely distance, direction, speed, position, and trust have been used to evaluate the node’s stability using fuzzy logic. The simulation results demonstrate that the proposed MFGR scheme can achieve the best performance in terms of the highest packet delivery ratio (PDR) and minimizes the average number of hops among all protocols.

scholarly journals Performance Analysis of ECDSA Based SE-AODV Routing Protocol In VANETS

2018 ◽  
Vol 7 (3.16) ◽  
pp. 76
Author(s):  
Deepak . ◽  
Rajkumar .
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Intelligent Transportation System ◽  
Secure Routing ◽  
The People ◽  
Main Challenge ◽  
Hoc Networks ◽  
Aodv Routing Protocol

Vehicular ad hoc networks is an emerging area for researchers to provide intelligent transportation system to the society. It is due to the wide area of applications of VANETs interest is developed among the people from different countries to be a part of it. Therefore many projects had been started and also presently working to implement VANETs in real world scenario. The main challenge in its implementation is to provide a secure mechanism against the various attacks and threats that have the capability to bring the network performance significantly down. In this paper to overcome different types of authentication based attacks in VANETs an ECDSA based secure routing protocol SE-AODV is proposed with security features incorporated in already existing AODV routing protocol. The performance of SE-AODV is evaluated and compared with original AODV and AODV with black hole attack (BH-AODV). The SE-AODV shows better performance with the parameters used for comparison with the variation in vehicle density, speed of vehicles and simulation time. 

scholarly journals Delay-Bounded and Cost-Limited RSU Deployment in Urban Vehicular Ad Hoc Networks

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 2764 ◽  
Author(s):  
Huanhuan Yang ◽  
Zongpu Jia ◽  
Guojun Xie
Keyword(s):  
Ad Hoc Networks ◽  
Network Performance ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Random Variable ◽  
Population Diversity ◽  
Coverage Ratio ◽  
Binary Differential Evolution ◽  
Hoc Networks ◽  
Feasible Solutions

As an auxiliary facility, roadside units (RSUs) can well improve the shortcomings incurred by ad hoc networks and promote network performance in a vehicular ad hoc network (VANET). However, deploying a large number of RSUs will lead to high installation and maintenance costs. Therefore, trying to find the best locations is a key issue when deploying RSUs with the set delay and budget. In this paper, we study the delay-bounded and cost-limited RSU deployment (DBCL) problem in urban VANET. We prove it is non-deterministic polynomial-time hard (NP-hard), and a binary differential evolution scheme is proposed to maximize the number of roads covered by deploying RSUs. Opposite-based learning is introduced to initialize the first generation, and a binary differential mutation operator is designed to obtain binary coding. A random variable is added to the traditional crossover operator to increase population diversity. Also, a greedy-based individual reparation and promotion algorithm is adopted to repair infeasible solutions violating given constraints, and to gain optimal feasible solutions with the compromise of given limits. Moreover, after selection, a solution promotion algorithm is executed to promote the best solution found in generation. Simulation is performed on analog trajectories sets, and results show that our proposed algorithm has a higher road coverage ratio and lower packet loss compared with other schemes.

An Illustrative Study of Vehicle Ad-Hoc Network Security using Advanced Encryption Standard Algorithm

2021 ◽  
Vol 7 (2) ◽  
Author(s):  
Akshay Kumar MV ◽  
Amogh C ◽  
Bhuvan S Kashyap ◽  
Drupad N Maharaj ◽  
Shazia Sultana
Keyword(s):  
Ad Hoc Networks ◽  
Secure Communication ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Transport Systems ◽  
Advanced Encryption Standard ◽  
Intelligent Transport System ◽  
Road Accidents ◽  
Intelligent Transport ◽  
Hoc Networks

India accounts for the highest road accidents and traffic congestion globally. The necessity for a canny vehicle framework is of great importance. VANET, abbreviated as Vehicular ad hoc networks is a network created in an ad hoc manner where different vehicles can exchange useful information among each other with dedicated servers ensuring safe travel. Security in VANET has always been a challenge in implementing a real time intelligent transport system. VANET is a type of mobile ad-hoc, to give correspondences among close by vehicles and among vehicles and close by fixed hardware. Vehicular ad hoc networks are highly dynamic in nature and suffer from frequent path breakage due to the high velocity of the moving vehicle. Hence, there are many security challenges and different types of attacks that makes VANETs less secure. Therefore, providing secure dedicated short-range communication (DSRC) easefully with any loss of data or malicious nodes has been a major research area. The major concern being addressed in the paper is to provide secure communication and save lives in road accidents. The role of security is high and messages in DSRC send warning messages to other vehicles. If attackers change these messages, then accidents become a part of the network and users’ lives can be at risk. Different classes of attacks include monitoring attack, social attack, timing attack, application attack and network attack to name a few. Advanced encryption standard is a symmetric block encryption algorithm. There is no evidence to crack this algorithm till date. This paper will provide a detailed overview of VANET architecture, types of attacks on VANET, AES algorithm and its salient features and how this algorithm could be utilized to make intelligent transport systems secure.

Artificial Intelligence Based Intrusion Detection System to Detect Flooding Attack in VANETs

2018 ◽  
pp. 87-100 ◽  
Author(s):  
Mannat Jot Singh Aneja ◽  
Tarunpreet Bhatia ◽  
Gaurav Sharma ◽  
Gulshan Shrivastava
Keyword(s):  
Intrusion Detection ◽  
Ad Hoc Networks ◽  
Intrusion Detection System ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Detection System ◽  
Delivery Ratio ◽  
Flooding Attack ◽  
Hoc Networks

This chapter describes how Vehicular Ad hoc Networks (VANETs) are classes of ad hoc networks that provides communication among various vehicles and roadside units. VANETs being decentralized are susceptible to many security attacks. A flooding attack is one of the major security threats to the VANET environment. This chapter proposes a hybrid Intrusion Detection System which improves accuracy and other performance metrics using Artificial Neural Networks as a classification engine and a genetic algorithm as an optimization engine for feature subset selection. These performance metrics have been calculated in two scenarios, namely misuse and anomaly. Various performance metrics are calculated and compared with other researchers' work. The results obtained indicate a high accuracy and precision and negligible false alarm rate. These performance metrics are used to evaluate the intrusion system and compare with other existing algorithms. The classifier works well for multiple malicious nodes. Apart from machine learning techniques, the effect of the network parameters like throughput and packet delivery ratio is observed.

A Probabilistic Routing Protocol in VANET

2010 ◽  
Vol 2 (4) ◽  
pp. 21-37 ◽  
Author(s):  
Gongjun Yan ◽  
Stephan Olariu ◽  
Shaharuddin Salleh
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Probability Model ◽  
Proposed Model ◽  
Probabilistic Routing ◽  
Hoc Networks ◽  
Manet Networks

The key attribute that distinguishes Vehicular Ad hoc Networks (VANET) from Mobile Ad hoc Networks (MANET) is scale. While MANET networks involve up to one hundred nodes and are short lived, being deployed in support of special-purpose operations, VANET networks involve millions of vehicles on thousands of kilometers of highways and city streets. Being mission-driven, MANET mobility is inherently limited by the application at hand. In most MANET applications, mobility occurs at low speed. By contrast, VANET networks involve vehicles that move at high speed, often well beyond what is reasonable or legally stipulated. Given the scale of its mobility and number of actors involved, the topology of VANET is changing constantly and, as a result, both individual links and routing paths are inherently unstable. Motivated by this latter truism, the authors propose a probability model for link duration based on realistic vehicular dynamics and radio propagation assumptions. The paper illustrates how the proposed model can be incorporated in a routing protocol, which results in paths that are easier to construct and maintain. Extensive simulation results confirm that this probabilistic routing protocol results in more easily maintainable paths.

scholarly journals BEAT: Beacon Inter-Reception Time Ensured Adaptive Transmission for Vehicle-to-Vehicle Safety Communication

Sensors ◽  
2019 ◽  
Vol 19 (14) ◽  
pp. 3061 ◽  
Author(s):  
Sunghwa Son ◽  
Kyung-Joon Park
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Adaptive Transmission ◽  
Vehicle Safety ◽  
Delivery Ratio ◽  
Safety Communication ◽  
Congestion Control Algorithm ◽  
Temporal Aspect ◽  
Varying Environments ◽  
Hoc Networks

To improve vehicle safety, vehicular ad hoc networks (VANETs) periodically broadcast safety messages known as beacons. Consequently, it becomes safety critical to guarantee the timely reception of periodic beacons under the time-varying environments of VANET. However, existing approaches typically measure the packet delivery ratio, which is a time-average metric that does not consider the temporal behavior associated with beacon reception. In this paper, to properly reflect the temporal aspect of beacon reception, we propose a congestion control algorithm, Beacon inter-reception time Ensured Adaptive Transmission (BEAT). The proposed algorithm tightly regulates the beacon inter-reception time compared to conventional techniques, which can significantly improve vehicle safety. Our simulation results demonstrate the effectiveness of the proposed scheme.

scholarly journals Transmission Power Based Intelligent Model in VANET

2020 ◽  
pp. 768-775
Author(s):  
Pushpender Sarao ◽  
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Research Work ◽  
Network Simulator ◽  
Transmission Power ◽  
Neuro Fuzzy ◽  
Proposed Model ◽  
Hoc Networks ◽  
Intelligent Model ◽  
Research Domain

Vehicular ad-hoc networks is very popular research domain in which research work is going on at various aspects like routing the data without loss end-to-end. Routing in such networks is very tedious task due to frequently changing the position of vehicles location-wise. In this paper an intelligent model has been developed on the basis of adaptive neuro fuzzy system for OLSR routing protocol in VANET. The proposed model is designed based on input parameters average goodput and mac/phy-overhead. Based on these parameters, transmission power can be predicted. Triangular and Gaussian membership functions have been applied for designing the decision model. A comparison work also has been carried out for Gaussian, triangular functions and NS-3 based results. At the same time, the model is investigated by simulation work carried out on network simulator-3 (NS-3) platform.

scholarly journals A distributed trust mechanism for malicious behaviors in VANETs

2020 ◽  
Vol 19 (3) ◽  
pp. 1147
Author(s):  
Ali Kamil Ahmed ◽  
Mohanad Najm Abdulwahed ◽  
Behnam Farzaneh
Keyword(s):  
Network Performance ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Malicious Node ◽  
Topsis Method ◽  
Trust Mechanism ◽  
Related Information ◽  
Hoc Networks ◽  
Malicious Behaviors

<p>Vehicular Ad-hoc Networks (VANETs) are one of the most important types of networks which are widely used in recent years. Along with all the benefits of Quality of Service (QoS) improvements, vulnerability analysis for this type of networks is an important issue. For instance, a Gray-hole attack decreases network performance. We proposed a novel solution to help to secure these networks against this vulnerability. The proposed method can detect and prevent the Gray-hole attack. Anywhere in the network, each node (vehicle) can distinguish between the Gray-hole attack and the failed link. Some topology related information helps us to detect attacks more accurately. Also, the proposed method uses the most reliable path in terms of link failure when there is no malicious node. In this paper, we used the TOPSIS method for choosing the most trusted node for routing intelligently. We validated our proposal using a simulation model in the NS-2 simulator. Simulation results show that the proposed method can prevent Gray-hole attack efficiently with low overhead.</p>

scholarly journals Inter-Vehicular Communications Using Wireless Ad Hoc Networks

2010 ◽  
pp. 120-138 ◽  
Author(s):  
Raúl Aquino-Santos ◽  
Víctor Rangel-Licea ◽  
Miguel A. García-Ruiz ◽  
Apolinar González-Potes ◽  
Omar Álvarez-Cardenas ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Large Scale ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Delivery Ratio ◽  
Test Bed ◽  
Limited Bandwidth ◽  
Hoc Networks ◽  
Large Scale Networks

This chapter proposes a new routing algorithm that allows communication in vehicular ad hoc networks. In vehicular ad hoc networks, the transmitter node cannot determine the immediate future position of the receiving node beforehand. Furthermore, rapid topological changes and limited bandwidth compound the difficulties nodes experience when attempting to exchange position information. The authors first validate their algorithm in a small-scale network with test bed results. Then, for large-scale networks, they compare their protocol with the models of two prominent reactive routing algorithms: Ad-Hoc On-Demand Distance Vector and Dynamic Source Routing on a multi-lane circular dual motorway, representative of motorway driving. Then the authors compare their algorithm with motorway vehicular mobility, a location-based routing algorithm, on a multi-lane circular motorway. This chapter then provides motorway vehicular mobility results of a microscopic traffic model developed in OPNET, which the authors use to evaluate the performance of each protocol in terms of: Route Discovery Time, End to End Delay, Routing Overhead, Overhead, Routing Load, and Delivery Ratio.

Sign in / Sign up

Export Citation Format

Share Document