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.

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.

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.

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.

scholarly journals Efficient RSU Selection Approaches for Load Balancing in Vehicular Ad Hoc Networks

2020 ◽  
Vol 5 (1) ◽  
pp. 56-63
Author(s):  
Chi-Fu Huang ◽  
Jyun-Hao Jhang
Keyword(s):  
Wireless Communication ◽  
Load Balancing ◽  
Ad Hoc Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
High Mobility ◽  
Communication Technologies ◽  
Delivery Ratio ◽  
Entry Points ◽  
Hoc Networks

Due to advances in wireless communication technologies, wireless transmissions gradually replace traditional wired data transmissions. In recent years, vehicles on the move can also enjoy the convenience of wireless communication technologies by assisting each other in message exchange and form an interconnecting network, namely Vehicular Ad Hoc Networks (VANETs). In a VANET, each vehicle is capable of communicating with nearby vehicles and accessing information provided by the network. There are two basic communication models in VANETs, V2V and V2I. Vehicles equipped with wireless transceiver can communicate with other vehicles (V2V) or roadside units (RSUs) (V2I). RSUs acting as gateways are entry points to the Internet for vehicles. Naturally, vehicles tend to choose nearby RSUs as serving gateways. However, due to uneven density distribution and high mobility nature of vehicles, load imbalance of RSUs can happen. In this paper, we study the RSU load-balancing problem and propose two solutions. In the first solution, the whole network is divided into sub-regions based on RSUs’ locations. A RSU provides Internet access for vehicles in its sub-region and the boundaries between sub-regions change dynamically to adopt to load migration. In the second solution, vehicles choose their serving RSUs distributedly by taking their future trajectories and RSUs’ loading information into considerations. From simulation results, the proposed methods can improve packet delivery ratio, packet delay, and load balance among RSUs.

scholarly journals Applicability of Overlay Non-Delay Tolerant Position-Based Protocols in Highways and Urban Environments for VANET

2021 ◽  
Vol 13 (2) ◽  
pp. 9-24
Author(s):  
Mahmoud Ali Al Shugran
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Hop Count ◽  
On The Road ◽  
Hoc Networks ◽  
Delay Tolerant

Vehicular Ad hoc Networks (VANETs) is new sort in wireless ad-hoc networks. Vehicle-to-Vehicle (V2V) communication is one of the main communication paradigms that provide a level of safety and convenience to drivers and passengers on the road. In such environment, routing data packet is challenging due to frequently changed of network topology because of highly dynamic nature of vehicles. Thus, routing in VANETs in require for efficient protocols that guarantee message transmission among vehicles. Numerous routing protocols and algorithms have been proposed or enhanced to solve the aforementioned problems. Many position based routing protocols have been developed for routing messages that have been identified to be appropriate for VANETs. This work explores the performances of selected unicast non-delay tolerant overlay position-based routing protocols. The evaluation has been conducted in highway and urban environment in two different scenarios. The evaluation metrics that are used are Packet Delivery Ratio (PDR), Void Problem Occurrence (VPO), and Average Hop Count (AHC).

scholarly journals W-GPCR Routing Method for Vehicular Ad Hoc Networks

Sensors ◽  
2020 ◽  
Vol 20 (12) ◽  
pp. 3406 ◽  
Author(s):  
Min Li ◽  
Zhiru Gu ◽  
Yonghong Long ◽  
Xiaohua Shu ◽  
Qing Rong ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Rapid Change ◽  
Relay Node ◽  
Geographic Routing ◽  
Delivery Ratio ◽  
Local Optimum ◽  
Hoc Networks

The high-speed dynamics of nodes and rapid change of network topology in vehicular ad hoc networks (VANETs) pose significant challenges for the design of routing protocols. Because of the unpredictability of VANETs, selecting the appropriate next-hop relay node, which is related to the performance of the routing protocol, is a difficult task. As an effective solution for VANETs, geographic routing has received extensive attention in recent years. The Greedy Perimeter Coordinator Routing (GPCR) protocol is a widely adopted position-based routing protocol. In this paper, to improve the performance in sparse networks, the local optimum, and the routing loop in the GPCR protocol, the Weighted-GPCR (W-GPCR) protocol is proposed. Firstly, the relationship between vehicle node routing and other parameters, such as the Euclidean distance between node pairs, driving direction, and density, is analyzed. Secondly, the composite parameter weighted model is established and the calculation method is designed for the existing routing problems; the weighted parameter ratio is selected adaptively in different scenarios, so as to obtain the optimal next-hop relay node. In order to verify the performance of the W-GPCR method, the proposed method is compared with existing methods, such as the traditional Geographic Perimeter Stateless Routing (GPSR) protocol and GPCR. Results show that this method is superior in terms of the package delivery ratio, end-to-end delay, and average hop count.

Design and Development of Secured Framework for Efficient Routing in Vehicular Ad-Hoc Network

2021 ◽  
pp. 615-633
Author(s):  
Mamata Rath ◽  
Bibudhendu Pati ◽  
Binod Kumar Pattanayak
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Denial Of Service ◽  
Dynamic Network ◽  
High Mobility ◽  
Delivery Ratio ◽  
Denial Of Service Attack ◽  
Service Attack ◽  
Hoc Networks ◽  
Smart Traffic

Due to many challenging issues in vehicular ad-hoc networks (VANETs), such as high mobility and network instability, this has led to insecurity and vulnerability to attacks. Due to dynamic network topology changes and frequent network re-configuration, security is a major target in VANET research domains. VANETs have gained significant attention in the current wireless network scenario, due to their exclusive characteristics which are different from other wireless networks such as rapid link failure and high vehicle mobility. In this are, the authors present a Secured and Safety Protocol for VANET (STVAN), as an intelligent Ad-Hoc On Demand Distance Vector (AODV)-based routing mechanism that prevents the Denial of Service attack (DoS) and improves the quality of service for secured communications in a VANET. In order to build a STVAN, the authors have considered a smart traffic environment in a smart city and introduced the concept of load balancing over VANET vehicles in a best effort manner. Simulation results reveal that the proposed STVAN accomplishes enhanced performance when compared with other similar protocols in terms of reduced delay, better packet delivery ratio, reasonable energy efficiency, increased network throughput and decreased data drop compared to other similar approach.

scholarly journals Time Slot Utilization for Efficient Multi-Channel MAC Protocol in VANETs

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 3028 ◽  
Author(s):  
VanDung Nguyen ◽  
Tran Anh Khoa ◽  
Thant Zin Oo ◽  
Nguyen H. Tran ◽  
Choong Seon Hong ◽  
...  
Keyword(s):  
Multiple Access ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Mac Protocol ◽  
Media Access Control ◽  
Delivery Ratio ◽  
Media Access ◽  
Traffic Conditions ◽  
Hoc Networks ◽  
Transmission Overhead

In vehicular ad hoc networks (VANETs), many schemes for a multi-channel media access control (MAC) protocol have been proposed to adapt to dynamically changing vehicle traffic conditions and deliver both safety and non-safety packets. One such scheme is to employ both time-division multiple access (TDMA) and carrier-sense multiple access (CSMA) schemes (called a hybrid TDMA/CSMA scheme) in the control channel (CCH) interval. The scheme can adjust the length of the TDMA period depending on traffic conditions. In this paper, we propose a modified packet transmitted in the TDMA period to reduce transmission overhead under a hybrid TDMA/CSMA multi-channel MAC protocol. Simulation results show that a MAC protocol with a modified packet supports an efficient packet delivery ratio of control packets in the CCH. In addition, we analyze the hybrid TDMA/CSMA multi-channel MAC protocol with the modified packet under saturated throughput conditions on the service channels (SCHs). The analysis results show that the number of neighbors has little effect on the establishment of the number of time slots in TDMA periods and on SCHs under saturated throughput conditions.

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.

scholarly journals Spectrum-Aware Geographic Routing in Cognitive Vehicular Ad Hoc Network Using a Kalman Filter

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Huma Ghafoor ◽  
Insoo Koo
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Relay Node ◽  
Primary User ◽  
Geographic Routing ◽  
Delivery Ratio ◽  
Vehicle Communication ◽  
Moving Vehicles ◽  
Hoc Networks ◽  
The One

We propose a position-based routing protocol for cognitive radio vehicular ad hoc networks (CR-VANETs) using aKalmanfilter algorithm. The protocol first selects an idle channel from among all the channels available to a vehicle while moving on a straight road and then finds the best relay node to deliver the packet to the destination. The selection of a relay node is done by dividing the vehicular transmission range into five regions, and then the source/relay node selects the one that is in the region having a higher preference than other regions. Communication between two vehicles occurs only when both the vehicles are on the same channel. Delay may increase while sensing the channel and selecting the relay node. To reduce the delay, we use aKalmanfilter to predict the future positions of all moving vehicles in the network. We consider vehicle-to-vehicle communication and compare our protocol for different probabilities of primary user being idle. Our proposed protocol shows improvement in both packet delivery ratio and end-to-end delay.

Sign in / Sign up

Export Citation Format

Share Document