A survey on security attacks in VANETs: Communication, applications and challenges

Vehicular ad-hoc NETworks (VANETs) have received considerable attention in recent years, due to its unique characteristics, which are different from mobile ad-hoc NETworks, such as rapid topology change, frequent link failure, and high vehicle mobility. The main drawback of VANETs network is the network instability, which yields to reduce the network efficiency. In this paper, we propose three algorithms: cluster-based life-time routing (CBLTR) protocol, Intersection dynamic VANET routing (IDVR) protocol, and control overhead reduction algorithm (CORA). The CBLTR protocol aims to increase the route stability and average throughput in a bidirectional segment scenario. The cluster heads (CHs) are selected based on maximum lifetime among all vehicles that are located within each cluster. The IDVR protocol aims to increase the route stability and average throughput, and to reduce end-to-end delay in a grid topology. The elected intersection CH receives a set of candidate shortest routes (SCSR) closed to the desired destination from the software defined network. The IDVR protocol selects the optimal route based on its current location, destination location, and the maximum of the minimum average throughput of SCSR. Finally, the CORA algorithm aims to reduce the control overhead messages in the clusters by developing a new mechanism to calculate the optimal numbers of the control overhead messages between the cluster members and the CH. We used SUMO traffic generator simulators and MATLAB to evaluate the performance of our proposed protocols. These protocols significantly outperform many protocols mentioned in the literature, in terms of many parameters.

Performance Improvement of Cluster-Based Routing Protocol in VANET

We propose a vehicle-to-roadside communication protocol based on distributed clustering where a coalitional game approach is used to stimulate the vehicles to join a cluster, and a fuzzy logic algorithm is employed to generate stable clusters by considering multiple metrics of vehicle velocity, moving pattern, and signal qualities between vehicles. A reinforcement learning algorithm with game theory based reward allocation is employed to guide each vehicle to select the route that can maximize the whole network performance. The protocol is integrated with a multi-hop data delivery virtualization scheme that works on the top of the transport layer and provides high performance for multi-hop end-to-end data transmissions. We conduct realistic computer simulations to show the performance advantage of the protocol over other approaches.

Computational Intelligence Inspired Data Delivery for Vehicle-to-Roadside Communications

Nowadays, the integration of Wireless Sensor Networks (WSN) and the Internet of Things (IoT) provides a great concern for the research community for enabling advanced services. An IoT network may comprise a large number of heterogeneous smart devices for gathering and forwarding huge data. Such diverse networks raise several research questions, such as processing, storage, and management of massive data. Furthermore, IoT devices have restricted constraints and expose to a variety of malicious network attacks. This paper presents a Secure Sensor Cloud Architecture (SASC) for IoT applications to improve network scalability with efficient data processing and security. The proposed architecture comprises two main phases. Firstly, network nodes are grouped using unsupervised machine learning and exploit weighted-based centroid vectors for the development of intelligent systems. Secondly, the proposed architecture makes the use of sensor-cloud infrastructure for boundless storage and consistent service delivery. Furthermore, the sensor-cloud infrastructure is protected against malicious nodes by using a mathematically unbreakable one-time pad (OTP) encryption scheme to provide data security. To evaluate the performance of the proposed architecture, different simulation experiments are conducted using Network Simulator (NS3). It has been observed through experimental results that the proposed architecture outperforms other state-of-the-art approaches in terms of network lifetime, packet drop ratio, energy consumption, and transmission overhead.

/pdf/sasc-secure-and-authentication-based-sensor-cloud-28r26humzg.pdf

SASC: Secure and Authentication-Based Sensor Cloud Architecture for Intelligent Internet of Things

—In recent years, research on advancing performance of mobile ad-hoc networks (MANETs) has attracted a special attention of scientists around the world. In a dynamic network environment like MANET, routing protocols play a particularly important role in improving the overall network performance. In essence, each routing protocol may use a combined routing metrics to select the intended route(s) for data transmission. This means that routing metrics will influence the design of routing protocols for MANETs. Therefore, we investigate on routing metrics and protocols proposed for MANETs. Our main focus will be on proposals aimed at high achievable network performance and energy efficiency. In this paper, we summarize our findings and propose future research directions.

/pdf/survey-of-recent-routing-metrics-and-protocols-for-mobile-ad-1oqauoo0jn.pdf

Survey of Recent Routing Metrics and Protocols for Mobile Ad-Hoc Networks

Vehicular Ad-Hoc NETwork (VANET) has received considerable attention in recent years, due to its unique characteristics which are different from Mobile Ad-Hoc NETwork (MANET), such as rapid topology change, frequent link failure, and high vehicles mobility. The main drawback of VANET network is the network instability, which yields to reduce the network efficiency. This paper proposed a Cluster-Based Life-Time Routing (CBLTR) protocol, which aims to increase the route stability and average throughput in two-direction segment scenario. Cluster Head (CH) is responsible for selecting next candidate CH based on its routing table that contains the neighbor CHs identification and location, the CHs are selected based on maximum Life-Time (LT) among all vehicles that are located within each cluster. Simulation is used to evaluate the performance of our proposed protocol, the simulation results show our proposed protocol outperforms other proposed CBR protocols that are mentioned in the literature in terms of average throughput.

A Cluster-Based Life-Time Routing Protocol in VANET

Vehicular Ad-Hoc NETworks (VANETs) are unique form of Mobile Ad-Hoc NETworks (MANETs), where the nodes act as vehicles moving with relatively high mobility, and moving in a predefined routes. The mobility in VANETs causes high topology changes and in turn leads to excessive control overhead and frequent link communication failures. Traditionally, clustering techniques have been used as the main solution to reduce the control overhead messages in VANET, in which the network is divided into multiple clusters and selecting one of the Cluster Members (CMs) as a Cluster Head (CH). Still, a problem occurs when the control overhead messages increase due to periodically forwarding of CM HELLO (CMHELLO) messages between the CMs and the CH, and when the CH periodically broadcasts an CH advertisement (CHADS) messages to declare itself to the CMs. In this paper, we propose a Control Overhead Reduction Algorithm (CORA) which aims to reduce the control overhead messages in a clustered topology. Therefore, we develop a new mechanism for calculating the optimal period for updating or forwarding the CMHELLO messages between the CMs and the CH. Finally, we evaluate the performance of our proposed work by comparing with other recent researches that published in this field. Based on the simulation results, the CORA algorithm significantly reduces the CMHELLO messages, where it generates the minimum percentage of CMHELLO messages compared with other techniques proposed on this field.

/pdf/control-overhead-reduction-in-cluster-based-vanet-routing-2hrrkubppx.pdf

Control Overhead Reduction in Cluster-Based VANET Routing Protocol

Vehicular Ad-Hoc NETworks (VANETs) have received considerable attention in recent years, due to its unique characteristics, which are different from Mobile Ad-Hoc NETworks (MANETs), such as rapid topology change, frequent link failure, and high vehicle mobility. The main drawback of VANETs network is the network instability, which yields to reduce the network efficiency. This paper proposes a novel Intersection Dynamic VANET Routing (IDVR) protocol, which aims to increase the route stability, average throughput, and reduce end-to-end delay in a grid topology. We used a centralized Software Defined Network (SDN) to gather a real-time traffic information and provide the Intersection Cluster Head (ICH) a Set of Candidate Shortest Routes (SCSR). At the Intersection, An ICH algorithm is proposed based on the maximum Life Time (LT), the LT is the time that each vehicle requires till it leaves the cluster. The IDVR protocol selects the optimal route based on its current location, destination location, and the maximum of the minimum average throughput among the SCSR. We used SUMO traffic generator simulator and MATLAB to evaluate the performance of our proposed protocol. Our proposed protocol outperforms many protocols mentioned in the literature, such as IRTIV, VDLA, and GPCR, in terms of end-to-end delay and throughput.

An Intersection Dynamic VANET Routing Protocol for a Grid Scenario

The mobility in Vehicular Ad-Hoc NETworks (VANETs) causes high topology changes and in turn leads to excessive control overhead messages and frequent link communication failures Traditionally, clustering techniques have been used as the main solution to improve the stability of the clustered topology and to minimize the routing overhead messages generated due to the routing protocols In the clustering techniques, the network is divided into multiple clusters and selecting one of the Cluster Members (CMs) as a Cluster Head (CH) Still, a problem occurs when the CMs periodically forwards of CM HELLO (CMHELLO) messages to the CH Also, when the CH periodically broadcasts an CH ADvertiSement (CHADS) messages to announce itself to the CMs Hence, minimizing control overhead messages in any cluster environment is an essential goal to efficiently use the network resources In this paper, we propose an Enhanced Control Overhead messages Reduction Algorithm (ECORA) with the goal to reduce the CHADS messages that broadcasted by the CHs Finally, we evaluate the performance of our proposed algorithm by comparing with other similar contributions

Ahmad Abuashour

Papers

Performance Improvement of Cluster-Based Routing Protocol in VANET

A Cluster-Based Life-Time Routing Protocol in VANET

Control Overhead Reduction in Cluster-Based VANET Routing Protocol

An Intersection Dynamic VANET Routing Protocol for a Grid Scenario

An Enhanced Control Overhead Messages Reduction Algorithm in VANET