Internet of Vehicles (IoV)-Based Task Scheduling Approach Using Fuzzy Logic Technique in Fog Computing Enables Vehicular Ad Hoc Network (VANET)

The intelligent transportation system (ITS) relies heavily on the vehicular ad hoc network (VANET) and the internet of vehicles (IoVs), which combine cloud and fog to improve task processing capabilities. As a cloud extension, the fog processes' infrastructure is close to VANET, fostering an environment favorable to smart cars with IT equipment and effective task management oversight. Vehicle processing power, bandwidth, time, and high-speed mobility are all limited in VANET. It is critical to satisfy the vehicles' requirements for minimal latency and fast reaction times while offloading duties to the fog layer. We proposed a fuzzy logic-based task scheduling system in VANET to minimize latency and improve the enhanced response time when offloading tasks in the IoV. The proposed method effectively transfers workloads to the fog computing layer while considering the constrained resources of car nodes. After choosing a suitable processing unit, the algorithm sends the job and its associated resources to the fog layer. The dataset is related to crisp values for fog computing for system utilization, latency, and task deadline time for over 5000 values. The task execution, latency, deadline of task, storage, CPU, and bandwidth utilizations are used for fuzzy set values. We proved the effectiveness of our proposed task scheduling framework via simulation tests, outperforming current algorithms in terms of task ratio by 13%, decreasing average turnaround time by 9%, minimizing makespan time by 15%, and effectively overcoming average latency time within the network parameters. The proposed technique shows better results and responses than previous techniques by scheduling the tasks toward fog layers with less response time and minimizing the overall time from task submission to completion.

A Novel Energy-Efficient Reservation System for Edge Computing in 6G Vehicular Ad Hoc Network

The roadside unit (RSU) is one of the fundamental components in a vehicular ad hoc network (VANET), where a vehicle communicates in infrastructure mode. The RSU has multiple functions, including the sharing of emergency messages and the updating of vehicles about the traffic situation. Deploying and managing a static RSU (sRSU) requires considerable capital and operating expenditures (CAPEX and OPEX), leading to RSUs that are sparsely distributed, continuous handovers amongst RSUs, and, more importantly, frequent RSU interruptions. At present, researchers remain focused on multiple parameters in the sRSU to improve the vehicle-to-infrastructure (V2I) communication; however, in this research, the mobile RSU (mRSU), an emerging concept for sixth-generation (6G) edge computing vehicular ad hoc networks (VANETs), is proposed to improve the connectivity and efficiency of communication among V2I. In addition to this, the mRSU can serve as a computing resource for edge computing applications. This paper proposes a novel energy-efficient reservation technique for edge computing in 6G VANETs that provides an energy-efficient, reservation-based, cost-effective solution by introducing the concept of the mRSU. The simulation outcomes demonstrate that the mRSU exhibits superior performance compared to the sRSU in multiple aspects. The mRSU surpasses the sRSU with a packet delivery ratio improvement of 7.7%, a throughput increase of 5.1%, a reduction in end-to-end delay by 4.4%, and a decrease in hop count by 8.7%. The results are generated across diverse propagation models, employing realistic urban scenarios with varying packet sizes and numbers of vehicles. However, it is important to note that the enhanced performance parameters and improved connectivity with more nodes lead to a significant increase in energy consumption by 2%.

BBSF: Blockchain-Based Secure Weather Forecasting Information through Routing Protocol in Vanet

A vehicular ad hoc network (VANET) is a technique that uses vehicles with the ability to sense data from the environment and use it for their safety measures. Flooding is a commonly used term used for sending network packets. VANET may cause redundancy, delay, collision, and the incorrect receipt of the messages to their destination. Weather information is one of the most important types of information used for network control and provides an enhanced version of the network simulation environments. The network traffic delay and packet losses are the main problems identified inside the network. In this research, we propose a routing protocol which can transmit the weather forecasting information on demand based on source vehicle to destination vehicles, with the minimum number of hop counts, and provide significant control over network performance parameters. We propose a BBSF-based routing approach. The proposed technique effectively enhances the routing information and provides the secure and reliable service delivery of the network performance. The results taken from the network are based on hop count, network latency, network overhead, and packet delivery ratio. The results effectively show that the proposed technique is reliable in reducing the network latency, and that the hop count is minimized when transferring the weather information.

SONG: A Multi-Objective Evolutionary Algorithm for Delay and Energy Aware Facility Location in Vehicular Fog Networks

With the emergence of delay- and energy-critical vehicular applications, forwarding sense-actuate data from vehicles to the cloud became practically infeasible. Therefore, a new computational model called Vehicular Fog Computing (VFC) was proposed. It offloads the computation workload from passenger devices (PDs) to transportation infrastructures such as roadside units (RSUs) and base stations (BSs), called static fog nodes. It can also exploit the underutilized computation resources of nearby vehicles that can act as vehicular fog nodes (VFNs) and provide delay- and energy-aware computing services. However, the capacity planning and dimensioning of VFC, which come under a class of facility location problems (FLPs), is a challenging issue. The complexity arises from the spatio-temporal dynamics of vehicular traffic, varying resource demand from PD applications, and the mobility of VFNs. This paper proposes a multi-objective optimization model to investigate the facility location in VFC networks. The solutions to this model generate optimal VFC topologies pertaining to an optimized trade-off (Pareto front) between the service delay and energy consumption. Thus, to solve this model, we propose a hybrid Evolutionary Multi-Objective (EMO) algorithm called Swarm Optimized Non-dominated sorting Genetic algorithm (SONG). It combines the convergence and search efficiency of two popular EMO algorithms: the Non-dominated Sorting Genetic Algorithm (NSGA-II) and Speed-constrained Particle Swarm Optimization (SMPSO). First, we solve an example problem using the SONG algorithm to illustrate the delay-energy solution frontiers and plotted the corresponding layout topology. Subsequently, we evaluate the evolutionary performance of the SONG algorithm on real-world vehicular traces against three quality indicators: Hyper-Volume (HV), Inverted Generational Distance (IGD) and CPU delay gap. The empirical results show that SONG exhibits improved solution quality over the NSGA-II and SMPSO algorithms and hence can be utilized as a potential tool by the service providers for the planning and design of VFC networks.

Collaborative Learning Based Sybil Attack Detection in Vehicular AD-HOC Networks (VANETS)

Vehicular Ad-hoc network (VANET) is an imminent technology having both exciting prospects and substantial challenges, especially in terms of security. Due to its distributed network and frequently changing topology, it is extremely prone to security attacks. The researchers have proposed different strategies for detecting various forms of network attacks. However, VANET is still exposed to several attacks, specifically Sybil attack. Sybil Attack is one of the most challenging attacks in VANETS, which forge false identities in the network to undermine communication between network nodes. This attack highly impacts transportation safety services and may create traffic congestion. In this regard, a novel collaborative framework based on majority voting is proposed to detect the Sybil attack in the network. The framework works by ensembling individual classifiers, i.e., K-Nearest Neighbor, Naïve Bayes, Decision Tree, SVM, and Logistic Regression in a parallel manner. The Majority Voting (Hard and Soft) mechanism is adopted for a final prediction. A comparison is made between Majority Voting Hard and soft to choose the best approach. With the proposed approach, 95% accuracy is achieved. The proposed framework is also evaluated using the Receiver operating characteristics curve (ROC-curve).

Intelligent Transport System Using Time Delay-Based Multipath Routing Protocol for Vehicular Ad Hoc Networks

During the last decade, the research on Intelligent Transportation System (ITS) has improved exponentially in real-life scenarios to provide optimized transport network performance. It is a matter of importance that alert messages are delivered promptly to prevent vehicular traffic problems. The fact is an ITS system per se could be a part of a vehicular ad hoc network (VANET) which is an extension of a wireless network. In all sorts of wireless ad hoc networks, the network topology is subjected to change due to the mobility of network nodes; therefore, an existing explored route between two nodes could be demolished in a minor fraction of time. When it comes to the VANETs, the topology likely changes due to the high velocity of nodes. On the other hand, time is a crucial factor playing an important role in message handling between the network's nodes. In this paper, we propose Time delay-based Multipath Routing (TMR) protocol that effectively identifies an optimized path for packet delivery to the destination vehicle with a minimal time delay. Our algorithm gives a higher priority to alert messages compared to normal messages. It also selects the routes with the short round-trip time (RTT) within the RTT threshold. As a result, our algorithm would realize two goals. Firstly, it would speed up the data transmission rate and deliver data packets, particularly warning messages, to the destination vehicle promptly and therefore avoid vehicular problems such as car accidents. Secondly, the TMR algorithm reduces the data traffic load, particularly of the normal messages, to alleviate the pressure on the network and therefore avoids network congestion and data collisions. This, in turn, lessens the packets' retransmissions. To demonstrate the effectiveness of the proposed protocol, the TMR has been compared with the other protocols such as AOMDV, FF-AOMDV, EGSR, QMR, and ISR. Simulation results demonstrate that our proposed protocol proves its excellent performance compared to other protocols.

An Enhancement for IEEE 802.11p to Provision Quality of Service with Context Aware Channel Access for the Forward Collision Avoidance Application in Vehicular Ad Hoc Network

Key application of an intelligent transportation system is traffic safety, and it provides driver assistance. Safety messages are of two types, beacon messages and event messages. The nodes broadcast these messages in the vehicular networks. The system must rely on a robust medium access control (MAC) protocol to support delivery of safety messages. The standard medium access scheme that is used in vehicular networks to provide service differentiation to support various applications is IEEE 802.11p. The emergency event messages should reach the drivers immediately to take necessary steps to avoid casualties on the road. In IEEE 802.11p, both of these messages are considered with the same priority so that no separate differentiation is created. The proposed work focuses on improving the quality of service for forward collision warning applications in intelligent transportation systems. The scheme proposes a priority-based cooperative MAC (PCMAC) for channel access that works on the context of information. Simulation and analytical results validate improved performance of PCMAC in terms of packet delivery ratio, throughput, and average packet delivery delay, as compared with other eminent MAC protocols. The simulation results show that it has a 9% higher improvement in throughput than IEEE 802.11p and has better performance in the increasing number of emergency messages.

Security Measures with Enhanced Behavior Processing and Footprint Algorithm against Sybil and Bogus Attacks in Vehicular Ad Hoc Network

Vehicular ad hoc networks (VANETs) are created according to the principles of ad hoc mobile networks (MANETs), i.e., spontaneous creation of a wireless network for vehicle-to-vehicle (V2V) communication. Each vehicle in this network is treated as a node that is part of the mobile network. VANET turns all cooperating vehicles into a wireless router or node. This makes it possible to connect all cars within range to a stationary unit and create a wide network with a huge range. VANET is widely used for better traffic management, vehicle-to-vehicle communication, and road information provision. The VANET network is exposed to identity and information attacks, concealing or delaying data transmission, or information theft. Therefore, there are multiple types of attack, such as Sybil or bogus, that might harm the whole network infrastructure. The consequences of the mentioned two attacks could lead not only to the given infrastructure but could cause hammering people’s lives. In this paper, we analyze the ongoing methods for preserving Sybil and bogus attacks in a VANET network together with the authors’ methods: the Bogus & Sybil Trust Level & Timestamp (B&STL&T) algorithm and the Bogus & Sybil Enhanced Behavior Processing & Footprint (B&SEBP&F) algorithm. The first algorithm, the Bogus & Sybil Trust Level & Timestamp (B&STL&T) algorithm was improved into the Bogus & Sybil Enhanced Behavior Processing & Footprint (B&SEBP&F), presented in the paper. The proposed methods were tested with multiple scenarios using different variations of bogus and Sybil attack and various attacker–victim node number ratios. During analysis, it was observed that detection of all attackers in the network was reduced by approximately 30% in comparison to previous work and that of other cited authors.

Efficient Certificate-Less Aggregate Signature Scheme with Conditional Privacy-Preservation for Vehicular Ad Hoc Networks Enhanced Smart Grid System

Vehicular Ad hoc networks (VANETs) as spontaneous wireless communication technology of vehicles has a wide range of applications like road safety, navigation and other electric car technologies, however its practicability is greatly hampered by cyber-attacks. Due to message broadcasting in an open environment during communication, VANETs are inherently vulnerable to security and privacy attacks. However to address the cyber-security issues with optimal computation overhead is a matter of current security research challenge. So this paper designs a secure and efficient certificate-less aggregate scheme (ECLAS) for VANETs applicable in a smart grid scenario. The proposed scheme is based on elliptic curve cryptography to provide conditional privacy-preservation by incorporating usage of time validated pseudo-identification for communicating vehicles besides sorting out the KGC (Key Generation Center) escrow problem. The proposed scheme is comparatively more efficient to relevant related research work because it precludes expensive computation operations likes bilinear pairings as shown by the performance evaluation. Similarly, communication cost is within the ideal range to most related works while considering the security requirements of VANETs system applicable in a smart grid environment.

A Secure and Efficient Group Key Agreement Scheme for VANET

A vehicular ad hoc network (VANET) is a special mobile ad hoc network that provides vehicle collaborative security applications using intervehicle communication technology. The method enables vehicles to exchange information (e.g., emergency brake). In VANET, there are many vehicle platoon driving scenes, where vehicles with identical attributes (location, organization, etc.) are organized as a group. However, this organization causes the issue of security threats (message confidentiality, identity privacy, etc.) because of an unsafe wireless communication channel. To protect the security and privacy of group communication, it is necessary to design an effective group key agreement scheme. By negotiating a dynamic session secret key using a fixed roadside unit (RSU), which has stronger computational ability than the on-board unit (OBU) equipped on the vehicle, the designed scheme can help to provide more stable communication performance and speed up the encryption and decryption processes. To effectively implement the anonymous authentication mechanism and authentication efficiency, we use a batch authentication scheme and a shared secret key mechanism among the vehicles, RSUs and trusted authority (TA). We design an efficient group secret key agreement scheme, which satisfies the above communication and security requirements, protects the privacy of vehicles, and traces the real identity of the vehicle at a time when it is necessary. Computational analysis shows that the proposed scheme is secure and more efficient than existing schemes.

A Game Theory Algorithm for Intra-Cluster Data Aggregation in a Vehicular Ad Hoc Network

Vehicular ad hoc networks (VANETs) have an important role in urban management and planning. The effective integration of vehicle information in VANETs is critical to traffic analysis, large-scale vehicle route planning and intelligent transportation scheduling. However, given the limitations in the precision of the output information of a single sensor and the difficulty of information sharing among various sensors in a highly dynamic VANET, effectively performing data aggregation in VANETs remains a challenge. Moreover, current studies have mainly focused on data aggregation in large-scale environments but have rarely discussed the issue of intra-cluster data aggregation in VANETs. In this study, we propose a multi-player game theory algorithm for intra-cluster data aggregation in VANETs by analyzing the competitive and cooperative relationships among sensor nodes. Several sensor-centric metrics are proposed to measure the data redundancy and stability of a cluster. We then study the utility function to achieve efficient intra-cluster data aggregation by considering both data redundancy and cluster stability. In particular, we prove the existence of a unique Nash equilibrium in the game model, and conduct extensive experiments to validate the proposed algorithm. Results demonstrate that the proposed algorithm has advantages over typical data aggregation algorithms in both accuracy and efficiency.