Mobility and Link Reliability Estimation Using CSS And ML In CR VANET

A vehicular ad hoc network (VANET) is a special kind of mobile ad hoc networks (MANET) that supports cooperative driving among communicating cars on the roads. There are several technologies involved in implementation of wireless communication in VANETs. These technologies include 3G cellular systems, long-term evolution (LTE), LTE Advanced, IEEE 802.16, and IEEE 802.11. This chapter focuses on 802.11-based wireless communication in VANETs. It reviews some presented methods for vehicle movement path prediction, and explains some algorithms are explained for performance improvement in opportunistic networks based on the predicted vehicle movements. The chapter considers the fact that communication in VANETs can be infrastructure-based or infrastructureless. It also reviews some methods to apply the predicted vehicles' position for improving communication in infrastructure-based and infrastructureless VANETs, respectively. Opportunistic routing algorithms can be classified according to their dependency on roadside infrastructure. The chapter presents the taxonomy of opportunistic routing in VANETs.

Multi-path routing protocol attracts more and more attention because the routing performance can be improved by making use of advantages of multi-path routing protocol, such as fault-tolerant and load balance. To validate multi-path routing protocol in real environment, the Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol is implemented in Linux based on AODV-UU. The functions of AOMDV protocol are implemented in user space, and the interaction with the kernel is implemented based on Netlink and Netfilter. Experimental results validate the implementation of AOMDV.

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.

Intelligent Transportation Systems (ITS) are nowadays considered very important applications of smart cities. One of the most important technologies that are utilized to support ITS is Vehicular Ad-hoc Networks (VANETs). In VANETs, vehicles communicate with each other (V2V) or with the infrastructure (Roadside Units) (V2I). Roadside Units (RSUs) collect data from vehicles in the coverage area and send it to cloud servers through the Internet. Cloud servers have high performance computational and storage capabilities that ITS applications require for data processing. However, due to the real-time requirements of the ITS applications, cloud approach alone cannot be guaranteed to satisfy the strict time constraints due to long latency access of the centralized cloud server. Fog Computing is an emerging approach that extends the services of cloud computing to the edge of the network. Fog Computing can be utilized in VANETs through deployment of fog nodes into RSUs. One of the major challenges is identifying the optimum number, locations and computational capabilities of the RSUs particularly in urban regions where obstacles exist heavily inside the coverage area of the RSUs. In this paper, we consider the optimization problem of fog-based RSU placement where the objective is to maximize the achieved level of service quality in a cost-effective way. The problem is formulated as a Satisfiability Modulo Theories (SMT) problem and solved using Microsoft Z3. The proposed approach is able to generate a set of solutions as Pareto front. We obtained data from OpenStreetMap for Cairo city. Our approach outperforms other solutions in the literature in terms of cost.

The Vehicular Ad hoc Networks (VANETs) are emerging networks that provide essential services to drivers on the road. To exchange data, vehicles as network nodes route information between source and destination using the V-to-V infrastructure. To retrieve the best path, routing algorithms are used. We focus in this paper on the Ad hoc On-demand Multipath Distance Vector (AOMDV) routing algorithm, which is able to retrieve at least three paths. Despite, its efficiency for VANET, the AOMDV protocol still faces big challenges in terms of security. Because of the lack of security mechanisms, such as cryptography and intrusion detection, the AOMDV protocol is vulnerable to attacks such as the blackhole and the man in the middle attacks. For this purpose, we propose in this work a secure and efficient AOMDV routing protocol for vehicular communications. The security consists of detecting malicious vehicles that are not authenticated and have malicious behavior. Moreover, to guarantee integrity and authentication of Route REPlay packets that are used to retrieve the best and secure paths. The efficiency consists of node disjuncture for RREP packets. Our algorithm is specific to vehicular networks, because it deploys specific vehicle-based authentication. The performance of the proposed protocol is evaluated using the NS2 and compared to AOMDV and then to SAODV and TS-AOMDV. The results prove that our algorithm is more secure and efficient than AOMDV, especially in terms of average end-to-end delay, for high-speed vehicles. The delay reduction is estimated to 1.5 ms for a speed of 108 km/h, which is promising for vehicular communications.

Vehicular ad hoc network (VANET) plays a vital role in the intelligent transportation system (ITS). When a vehicle receives a message through network, the CRL (certificate revocation list) checking process will operate before certificate and signature verification. After successful authentication, a CRL list is created based on authentication. This CRL is used to verify whether a vehicle node can be permitted for communication in the VANET network. But when using CRL, a huge amount of storage space and checking time is needed. So we proposed a method without the CRL list. It mentions a key management list to overcome large storage space and checking time. Even it reduced the access delay. For access permission we can do an authentication system based digital novel signature authentication (DNSA) for each vehicle in the VANET with the RSU unit or with other participant node vehicles in the communication as per the topology. We can perform an efficient and secured communication in VANET.

We develop an on‐demand, multipath distance vector routing protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well‐studied single path routing protocol known as ad hoc on‐demand distance vector (AODV). The resulting protocol is referred to as ad hoc on‐demand multipath distance vector (AOMDV). The protocol guarantees loop freedom and disjointness of alternate paths. Performance comparison of AOMDV with AODV using ns‐2 simulations shows that AOMDV is able to effectively cope with mobility‐induced route failures. In particular, it reduces the packet loss by up to 40% and achieves a remarkable improvement in the end‐to‐end delay (often more than a factor of two). AOMDV also reduces routing overhead by about 30% by reducing the frequency of route discovery operations. Copyright © 2006 John Wiley & Sons, Ltd.

Recent Advances in Machine-Learning Driven Intrusion Detection in Transportation: Survey

Recently, special types of routing protocols are designed for sensor networks. Almost all of these routing protocols have considered the energy efficiency as the ultimate objective in order to maximize the lifetime of the whole network. The different types of routing protocols available in WSN are data centric, hierarchical, and location-based and on demand routing protocols. Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol is one of the best hierarchical clustering protocols with probabilistic model to manage the energy consumption of WSN. However, LEACH uses global information without considering the local information i.e. the residual energy of each node for CH election process. Hence, Deterministic Energy-efficient Clustering protocol (DEC), a deterministic model is developed by using clustering scheme to manage and organize the WSN with mobile scenario. This protocol promises a better election of cluster-heads based on residual energy information and it is more energy efficient than LEACH protocols. Ad hoc on demand Distance Vector (AODV) is another routing protocol used in sensor network to support mobility. AODV is also on demand routing protocol. However, AODV do not provide multipath loop free and has link disjoint path. Hence, Ad hoc On-demand Multipath Distance Vector (AOMDV) is developed for WSN to guarantee loop freedom and disjointness of alternate paths. Frequent route discovery and route failure is occurred in AOMDV protocols due to the involvement of repeated mobile nodes without checking the energy levels of those nodes for packet transmission. To reduce the route failures occurred by the usage of nodes with reduced energy, energy aware ad hoc on-demand multipath distance vector routing protocol (E-AOMDV) is developed by incorporating energy aware concept in AOMDV protocol to increase the network performance. In this paper, the performance analysis namely residual energy of DEC protocol is examined for various packet length and nodes. Delivery ratio analysis of EAOMDV protocol is also done in this paper for various simulation times and nodes. The simulation results shows that DEC has better performance than LEACH and also E-AOMDV has better performance than AOMDV.

A type of ad hoc network formed among moving vehicles that come in one another’s radio transmission range is called Vehicular Ad Hoc Network (VANET). VANET may be deployed using three architectures: pure ad hoc, WLAN and hybrid. Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) are the two modes in VANET used for communication among vehicles. These features not only distinguish a VANET from other ad hoc networks but also make these networks more exposed to attacks and increase their complexity. These networks being the primary mechanism for communication in VANETs, appropriate and timely delivery of information is of prime importance. Due to the existence of various vehicular traffic scenarios, a single category of routing protocols is not sufficient for the VANETs. Therefore, various categories of routing protocols have been tailored to meet specific kinds of routing requirements in this framework. Most significant ones are ad hoc/topology-based, position-based, geocast-based, cluster-based, broadcast-based protocols. There exist a number of attacks that apart from affecting various other parameters also affect the routing protocols in these VANETs. Most of these attacks may be launched in all the above-mentioned three architectures. But, one of the most dangerous attacks is the Sybil attack that may be initiated in pure ad hoc deployment of VANET where vehicles communicate with one another in one to one manner using carry forward approach. In this paper, with the help of illustrative example for each of the five categories of routing protocols, we show how Sybil attack affects these protocols. Considering the ad hoc scenarios in VANETs, we also discuss a prevention mechanism for the Sybil attack briefly.

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.

Vehicular ad hoc networks (VANETs) present an intriguing platform for several applications on e.g., intelligent transportation system (ITS) and infotainment applications aspire to be the main pattern of communication among vehicles while travelling. This can significantly impact on the amount of data exchanged by vehicles, increasing the contention on communication links and thus, degrading the quality of service of these applications. So, discrimination of data becomes imperative and forwarding critical information on suitable routes becomes decisive. Hence, a quality of service (QoS)-driven mechanism is needed to handle and assign network resources according to the stringent application data traffic demands. But, VANETs high node mobility and frequent link failure, stuck a big challenge in implementing an effective policy to meet and enforce these QoS requirements. A promising way to tackle this issue is to enforce QoS at the network layer, since it is the crucial point in VANETs’ communication. So, over the years, many QoS-aware routing protocols were specifically conceived for VANETs. In this paper, we present a comprehensive survey of QoS-aware routing protocols in VANETs’ literature. We examined the protocols based on their ability to support ITS infotainment services, their multi-constraint path problem (MCP), protocol’s functionality and weakness, objectives and design challenges. This way, we outline future directions for VANETs QoS-aware protocol research.

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 (VANETs), an application of the Internet of Things (IoT) providing a better intelligent transportation system (ITS), has received substantial attention from both industry and academia. Heterogeneous vehicular communications in VANETs occur when both vehicles and the infrastructure use different cryptographic technologies to exchange safety messages. However, the safety messages between vehicles and the infrastructure are communicated wirelessly; therefore, security issues are a serious concern in this domain. The existing schemes secure the transmission of safety messages with respect to confidentiality, authentication, and nonrepudiation. However, they are inappropriate with respect to efficiency. They cause computational overhead on the receiver and bandwidth overhead in the communications. To cope with this, we propose an elliptic curve cryptosystem-based hybrid signcryption (ECCHSC) protocol that satisfies the security requirements (i.e., message confidentiality, message’s source authentication, message integrity, nonrepudiation, and identity–anonymity) for heterogeneous vehicle-to-infrastructure (V2I) communications in a single logical step. This protocol allows secure transmission of a safety message from a vehicle using identity-based cryptography (IDC) to a roadside unit (RSU) using public-key infrastructure (PKI). In addition, the ECCHSC protocol enables the RSU to receive multiple ciphertexts, aggregate them, and de-signcrypt them simultaneously through the batch de-signcryption method, which further improves the performance. The ECCHSC protocol has indistinguishability against adaptive chosen ciphertext attacks (IND-CCA2) and existential unforgeability against adaptive chosen message attacks (EUF-CMAs) in the random oracle model (ROM). The performance analysis of our protocol demonstrates a significant reduction in computational overhead and in communication/storage overhead as compared to the state-of-the-art schemes.

Reliability is an important issue for safety-critical broadcast services in vehicular ad hoc networks (VANETs). So far, most investigations of such broadcast networks focus on multihop connectivity, taking all one-hop links for granted. In this paper, four reliability metrics for one-hop broadcast communication in VANETs, including the packet reception rate (PRR), the packet delivery ratio (PDR), the node successful packet delivery probability (PDP), and the effective range (ER), are introduced and evaluated analytically and by simulations. Expressions of these reliability metrics for one-hop broadcast in IEEE-802.11-based 1-D VANETs are derived with consideration of the IEEE 802.11 distributed coordination function (DCF), the hidden terminal problem, and collisions caused by concurrent transmissions. The impacts of network parameters such as distinct transmission, carrier sensing, and interference ranges; the density of nodes in the networks; the distances of receivers to the senders; the message generation rates; the backoff window sizes; and the channel data rates on the reliability of the broadcast communication in VANETs are investigated and discussed. As an example, the proposed model is applied to the evaluation of the dedicated short-range communication (DSRC) safety-critical message propagation in a highway setting. As a result, some important observations to the design and analysis of such communication systems are provided.