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

The vehicular ad-hoc network (VANET) is a promising technology in near future. VANET allows vehicles to communicate with each other and with roadside units (RSUs). Wireless Access in Vehicular Environment (WAVE), defined by IEEE, provides the Internet connectivity for vehicles as well as vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. RSUs can form a wireless mesh network (WMN) as a backbone infrastructure to enhance the performance of VANET. However, WAVE supports only one-hop communications for IP packets in VANET, and existing researches do not consider the compatibility between VANET and WMN infrastructure formed by RSUs. We propose the extended WMN (ExWMN) which has the feasibility to extend WMN to VANET domain. In ExWMN, the vehicles can send IP packets to an access router by using the multi-hop capability of WMN. ExWMN uses the addressing scheme of WMN for the extended VANET domain and exploits geographical routing protocols instead of existing routing protocols of WMN due to VANET characteristics such as mobility and dynamically changing network topologies. ExWMN supports the compatibility between the extended VANET and a WMN infrastructure due to RSUs, which provide a bridging function between them. This paper presents the architecture and the detailed procedures of the ExWMN.

Vehicular ad hoc network (VANET) has attracted more attention for providing safe and efficient traffic management in the modern roads. Performance of the VANET depends on proper routing protocol, mobility management, and efficient inter-vehicular communications. To ensure the optimal data forwarding and energy efficiency in VANET, a suitable network hierarchy is required. In this paper, we propose a new optical network-based clustering hierarchy (ONCH) to improve the quality of services of the VANET. In the proposed scheme, the road side units (RSUs) of a VANET will be divided into several small groups called clusters. In each cluster, an RSU will act as gateway node and each gateway node will be connected to the WiMAX base station through optical fiber. We have analyzed the performance of the proposed ONCH scheme by numerical simulations. The simulated results prove that the ONCH scheme of VANET provides higher energy efficiency than the conventional wireless network-based clustering hierarchy (WNCH) scheme of VANET.

With the development of the vehicular communications technology, roadside units (RSUs) placement problem has recently received considerable attentions in vehicular ad hoc networks (VANETs). This paper addresses the roadside units (RSUs) placement problem for traffic flow coverage requirement number in vehicular ad hoc networks (VANETs). Given a set of road segments, some traffic flows and a coverage requirement number n, the problem is how to find the optimal placement of RSUs, such that each traffic flow is covered by at least n RSUs. We first investigate full RSUs placement problem, which place all the RSUs on the given road segments totally. We prove that this problem is NP-hard. Then, we propose a greedy algorithm to solve the problem and theoretical analysis is given. We also study incremental RSUs placement problem, which place the partial RSUs based on the deployed RSUs on the given road segments. Based on the proposed greedy algorithm, we also propose a algorithm to solve the incremental RSUs placement problem. Extensive simulations have been conducted to show the performance of our proposed algorithms is superior to the other algorithms.

Emerging as the effective strategy of intelligent transportation system (ITS), vehicular ad hoc networks (VANETs) have the capacity of drastically improving the driving experience and road safety. In typical VANET scenarios, high mobility and volatility of vehicles result in dynamic topology of vehicular networks. That is, individual vehicle may pass through the effective domain of multiple neighboring road-side-units (RSUs) during a comparatively short time interval. Hence, efficient and low-latency cross-domain verification with all the successive RSUs is of significance. Recently, a lot of research on VANET authentication and key distribution was presented, while the critical cross-domain authentication (CDA) issue has not been properly addressed. Particularly, the existing CDA solutions mainly reply on the acquired confidential keying information from the neighboring entities (RSUs and vehicles), while too much trustworthiness is granted to the involved RSUs. Please note that the RSUs are distributively located and may be compromised or disabled by adversary, thus vital vehicle information may be revealed. Furthermore, frequent data interactions between RSUs and cloud server are always the major requisite so as to achieve mutual authentication with cross-domain vehicles, which leads to heavy bandwidth consumption and high latency. In this paper, we address the above VANET cross-domain authentication issue under the novel RSU edge networks assumption. Please note that RSUs are assumed to be semi-trustworthy entity in our design, where critical vehicular keying messages remain secrecy. Homomorphic encryption design is applied for all involved RSUs and vehicles. In this way, successive RSUs could efficiently verify the cross-domain vehicle with the transited certificate from the neighbor RSUs and vehicle itself, while the identity and secrets of each vehicle is hidden all the time. Afterwards, dynamic updating towards the anonymous vehicle identity is conducted upon validation, where conditional privacy preserving is available. Moreover, pairing-free mutual authentication method is used for efficiency consideration. Formal security analysis is given, proving that the HCDA mechanism yields desirable security properties on VANET cross domain authentication issue. Performance discussions demonstrate efficiency of the proposed HCDA scheme compared with the state-of-the-art.

Vehicular ad hoc networks have played a key role in intelligent transportation systems that considerably improve road safety and management. This new technology allows vehicles to communicate and share road information. However, malicious users may inject false emergency alerts into vehicular ad hoc networks, preventing nodes from accessing accurate road information. In order to assure the reliability and trustworthiness of information through the networks, assessing the credibility of nodes has become a critical task in vehicular ad hoc networks. A new scheme for malicious node detection is proposed in this work. Multiple factors are fed into a fuzzy logic model for evaluating the trust for each node. Vehicles are divided into clusters in our approach, and a road side unit manages each cluster. The road side unit assesses the credibility of nodes before accessing vehicular ad hoc networks. The road side unit evicts a malicious node based on trust value. Simulations are used to validate our technique. We demonstrate that our scheme can detect and evict all malicious nodes in the vehicular ad hoc network over time, lowering the ratio of malicious nodes. Furthermore, it has a positive impact on selfish node participation. The scheme increases the success rate of delivered data to the same level as the ideal cases when no selfish node is present.

The incorporation of electronics by embedding the relevant sensors in the physical devices in home and office, vehicles of all types, buildings in the smart cities and in all possible spheres of life form a network of devices termed as internet of things (IoT). It is being realized that vehicular ad-hoc networks (VANETs) which are responsible for the reliable and secure communication among vehicles is a primary area of research in IoT and hence ensuring security in this area is essential. Thus, this work introduces a novel approach to improve the existing authentication support to VANETs. In this proposed framework, first an anonymous authentication approach for preserving the privacy is proposed which not only performs the vehicle user’s anonymous authentication but preserves the message integrity of the transmitting messages as well. Although many anonymous authentication schemes have been proposed in VANETs until now, the existing schemes suffer from a high computation cost during the signature and certificate verification process which leads to delayed authentication. Consequently, the vehicles and roadside units (RSUs) cannot authenticate more number of vehicles per second in VANETs. Second, an efficient anonymous group key distribution protocol is proposed in this paper for securely distributing the group key to the group of vehicles in the communication range of an RSU. The RSUs can send location based information to the group of vehicles in a secure manner using this group key. Experimental analysis portrays that the results of this new privacy preserving anonymous authentication and key management schemes are promising and efficient with regard to signature verification cost and computational cost in comparison with the existing schemes.

Vehicular Ad Hoc Network (VANET) technology enables efficient inter-vehicular communications for the broad-casting of public-safety and other critical message flows among unmanned autonomous vehicles. A key challenge in VANET broadcasting is to achieve a high throughput rate while at the same time assure the delivery of packet flows to all the vehicles traveling over a targeted segment of the highway. We have proposed a Vehicular Backbone Network (VBN) protocol for dynamically synthesizing a networking scheme that supports message flows from a Road Side Unit (RSU) to vehicles traveling along a highway. Though proven to achieve significant throughput-rate improvements compared with existing protocols, a design of a VBN that maximizes the end-to-end throughput rate while guaranteeing the coverage scope of message flows has not been addressed. In this paper, we develop an analytical model that accurately characterizes the maximum throughput rate performance achievable under a prescribed outage probability constraint. We consider a spatial-reuse TDMA-based VBN. A joint optimization of inter-relay distances, transmission rates, and spatial-reuse factors, which has not yet been addressed in the existing literatures, is carried out. These results are confirmed by comparison with simulation results. They also serve as essential benchmark and performance upper bounds that characterize the behavior of robust distributed VBN protocols, applicable to VANET systems that provide vehicle-to-vehicle communications among stochastically roaming highway vehicles.

In this paper, we propose a secure data downloading protocol with privacy preservation in vehicular ad hoc networks (VANETs). In the data downloading application, vehicles send requests, such as where is the nearest gas station, at a road side unit (RSU) and receive the corresponding responses from application servers via current or the following RSUs. It would be easy for eavesdroppers to get vehicles' private information if semi-trust RSUs are compromised because both request and response messages are forwarded by them. Therefore, we develop a protocol which enables vehicles to download data securely from RSUs with their privacy under protection even when one or multiple RSUs are compromised. Our protocol guarantees vehicles exclusive access to their requested data while eavesdroppers can not obtain any private information of the vehicles. Possible attacks and the corresponding solutions as well as privacy evaluation are discussed to demonstrate the performance of the proposed protocol.

Vehicular ad-hoc network (VANET) technology enables communication between vehicles, or vehicles and road-side units (RSUs) through wireless communication devices installed on the vehicles. One of the most important goals of VANETs is providing safety applications for passengers. In addition, VANETs provide comfort applications to users. Guaranteeing a reliable and stable routing protocol over VANETs is a very important step. The proposed research attempts to improve routing protocols that decrease the end-to-end delay to suit VANET communication characteristics. In addition, it proposes analysis of the end-to-end delay probability distribution. More specifically, we derive a closed-form expression for the probability distribution of the re-healing delay in a VANET conditioned on the distance between two VANET clusters. Furthermore, we propose a closed-form expression for the probability distribution of the unconditional re-healing delay. Moreover, we develop a mathematical model to calculate the probability distribution of the end-to-end delay. On the other hand, using Unmanned Aerial Vehicles (UAVs) or drones in wireless communications and Vehicular Ad-hoc Networks (VANETs) has started to attract attention. We propose a routing protocol that uses infrastructure drones for boosting VANET communications to achieve a minimum vehicle-to-drone packet delivery delay. In addition, we propose a closed-form expression for the probability distribution of the vehicle-to-drone packet delivery delay on a two-way highway. Moreover, based on that closed-form expression, we can calculate the minimum drone density (maximum separation distance between two adjacent drones) that stochastically limits the worst case of the vehicle-to-drone packet delivery delay. Furthermore, we propose a drones-active service (DAS) that is added to the location service in a VANET. This service dynamically and periodically obtains the required number of active drones based on the current highway connectivity state by obtaining the maximum distance between each two adjacent drones while satisfying a probabilistic constraint for vehicle-todrone packet delivery delay. Our analysis focuses on two-way highway VANET networks with low vehicular density. The simulation results show the accuracy of our analysis and reflect the relation between the drone density, vehicular density and speed, other VANET parameters, and the vehicle-to-drone packet delivery delay. In addition, we propose a new routing protocol called multi-copy intersection-based routing (MCIR) for vehicular ad-hoc networks (VANETs) in urban areas. MCIR is an intersectionbased routing protocol that forwards multiple copies of the packets in different road segments. Moreover, it is a beacon-less routing protocol with a carry-and-forward strategy. We show via simulation that the MCIR protocol is superior to other existing routing protocols, especially in low vehicular density scenarios. The results show that MCIR achieves a shorter end-to-end delay and a higher packet delivery ratio in urban VANET communications.

A new concept such as smart city was introduced in the last years where the Intelligent Transportation system (ITS ) plays a critical role to provide road safety and manage Vehicular Ad Hoc Networks (VANETs) traffic. Nevertheless, VANETs have significant constraints like nodes high mobility, intermittent connectivity, variable network density and heterogeneity. However, the different types of traffic, the different Quality of Service requirements, the need to exchange mobile data, multi-services and data diversity leads mainly to load and time constraints in this specific and stringent type of networks. The main characteristic of this kind of networks is the very changing topology that poses supplementary constraints and makes achieving QoS constraints a very challenging task. In VANET network the vehicle generated traffic will be transferred to the data center from road side unit to the base station by using Long Term Evolution (LTE) in an urban area. Despite LTE has a larger system capacity and it provides a higher transmission speed, the network performance is affected by the implemented scheduling algorithm. In this context, we study the efficiency of LTE scheduler algorithms such as Proportional Fairness, Round Robin, Priority Set Scheduler, Maximum Throughput Scheduler and Throughput to Average Scheduler and Blind Equal Throughput mainly at the road side unit using Network Simulator 3(NS3) to determinate the most suitable scheduler for VANET traffic. Results demonstrate that the round robin algorithm is more effective for volumetric VANET traffic in terms of throughput, delay, packet loss rate and fairness.

Data dissemination among vehicles is an important problem in a Vehicular Ad Hoc Network (VANET). However, all existing works on data dissemination consider transferring small-sized data, where the entire data can be transferred from a roadside unit (RSU) to a vehicle when the vehicle is passing by it. In this paper, we address the problem of large data transfers among vehicles in a VANET using RSUs and vehicles with finite data storage and transfer capacity. In particular, we formulate two problems, the Maximum Successful Transfers Problem Using RSUs (R-MaxSucTrans) that aims to maximize the number of successful transfers between source and destination vehicles using only RSUs as intermediate nodes, and the Maximum Successful Transfers Problem Using RSUs and Vehicles (RV-MaxSucTrans) that aims to do the same while using both RSUs and other vehicles as intermediate nodes. Offline algorithms are proposed for the two problems. Detailed simulation results are presented to evaluate the performance of the algorithms.

Vehicular Ad-Hoc Networks (VANETs) include services such as video streaming for automated safety precautions and autonomous driving. NDN is proposed in VANETs as a solution for the connection breaks, since NDN decouples the content exchange from the location of the host. The combination of NDN and VANETs leads to autonomous ad-hoc network architectures that are self-managed. In this paper, we apply the NDN architecture in VANETs, to retrieve information from other vehicles and to save network resources. We present a Vehicle to Infrastructure (V2I) communication architecture for NDN-VANETs, which consists of vehicles and Road Side Units (RSUs). For installed RSUs along the roads we develop two communication techniques: First, in the centralized approach every node that requests content sends its Interests to the nearest RSU. RSUs are responsible for routing the Interests to the content source. In our second approach, a hybrid communication technique uses RSUs as a backup mechanism and forwards packets to them, if a route to the content source is unavailable. We compare our approaches with our previous work iMMM-VNDN, flooding and AODV. Our results show that we outperform previous works in terms of Interest Satisfaction Ratio and the total amount of Delivered Data in the requester node.

Vehicular ad hoc networks (VANETs) are emerged technology where vehicles and roadside units (RSUs) communicate with each other. VANETs can be categorized as a subbranch of mobile ad hoc networks (MANETs). VANETs help to improve traffic efficiency and safety and provide infotainment facility as well. The dissemination of messages must be relayed through nodes in VANETs. However, it is possible that a node may propagate false information in a network due to its malicious behaviour or selfishness. False information in VANETs can change drivers’ behaviour and create disastrous consequences in the network. Therefore, sometimes false safety messages may endanger human life. To avoid any lass, it is more important to detect and avoid false messages. This paper has explained some important algorithms that can detect false messages in VANETs. The categorization of false message detection schemes based on local and cooperative behaviour has been presented in this article. The limitations and consequences of existing schemes as well as future work has been discussed.

Vehicular Ad Hoc Network (VANET) is a special application of traditional Mobile Ad Hoc Network (MANET) in traffic roads, which has attracted extensive attention due to its important role in intelligent traffic and road services. In order to ensure the safety of road traffic and protect the privacy of users, it is of vital importance to provide effective anonymous authentication in VANET. In this paper, we propose an efficient mutual authentication framework with conditional privacy protection (EMAPP), which can achieve the security authentication from vehicles to infrastructure and vehicles to vehicles. In the proposed framework, we are combined with pseudo ID and temporary pseudonym to protect the privacy of vehicles, and use the identity-based signature scheme to achieve authentication between vehicles and infrastructure. At the same time, with the assistance of the roadside unit (RSU), we utilize an online/offline signature scheme to achieve authentication between vehicles in the same RSU area and different RSU area. Our scheme has reusability, and we have conducted a performance evaluation. Without expensive and time-consuming operations such as bilinear pairing and mapping to point (MTP) functions, our framework can produce better performance and is appropriate for practical application. In addition, we also use the Internet Security Protocol and Application Automatic Authentication (AVISPA) tools to provide formal security analysis.

Fog computing for vehicular Ad-hoc networks: paradigms, scenarios, and issues