Mahmoud Hashem Eiza

An Evolving Graph-Based Reliable Routing Scheme for VANETs

Vehicular ad hoc networks (VANETs) are a special form of wireless networks made by vehicles communicating among themselves on roads. The conventional routing protocols proposed for mobile ad hoc networks (MANETs) work poorly in VANETs. As communication links break more frequently in VANETs than in MANETs, the routing reliability of such highly dynamic networks needs to be paid special attention. To date, very little research has focused on the routing reliability of VANETs on highways. In this paper, we use the evolving graph theory to model the VANET communication graph on a highway. The extended evolving graph helps capture the evolving characteristics of the vehicular network topology and determines the reliable routes preemptively. This paper is the first to propose an evolving graph-based reliable routing scheme for VANETs to facilitate quality-of-service (QoS) support in the routing process. A new algorithm is developed to find the most reliable route in the VANET evolving graph from the source to the destination. We demonstrate, through the simulation results, that our proposed scheme significantly outperforms the related protocols in the literature.

Investigation of routing reliability of vehicular ad hoc networks

In intelligent transportation systems, the cooperation between vehicles and the road side units is essential to bring these systems to fruition. Vehicular ad hoc networks (VANETs) are a promising technology to enable the communications among vehicles on one hand and between vehicles and road side units on the other hand. However, it is a challenging task to develop a reliable routing algorithm for VANETs due to the high mobility and the frequent changes of the network topology. Communication links are highly vulnerable to disconnection in VANETs; hence, the routing reliability of these ever-changing networks needs to be paid special attention. In this paper, we propose a new vehicular reliability model to facilitate the reliable routing in VANETs. The link reliability is defined as the probability that a direct communication link between two vehicles will stay continuously available over a specified time period. Furthermore, the link reliability value is accurately calculated using the location, direction and velocity information of vehicles along the road. We extend the well-known ad hoc on-demand distance vector (AODV) routing protocol to propose our reliable routing protocol AODV-R. Simulation results demonstrate that AODV-R outperforms significantly the AODV routing protocol in terms of better delivery ratio and less link failures while maintaining a reasonable routing control overhead.

Secure and Privacy-Aware Cloud-Assisted Video Reporting Service in 5G-Enabled Vehicular Networks

Vehicular networks are one of the main technologies that will be leveraged by the arrival of future fifth-generation (5G) mobile cellular networks. While scalability and latency are the major drawbacks of IEEE 802.11p and fourth-generation (4G) Long-Term Evolution (LTE)-enabled vehicular communications, respectively, the 5G technology is a promising solution to empower the real-time services offered by vehicular networks. However, the security and privacy of such services in 5G-enabled vehicular networks need to be addressed first. In this paper, we propose a novel system model for a 5G-enabled vehicular network that facilitates a reliable, secure, and privacy-aware real-time video reporting service. This service is designed for participating vehicles to instantly report the videos of traffic accidents to guarantee a timely response from official vehicles and/or ambulances toward accidents. While it provides strong security and privacy guarantees for the participating vehicles identity and the video contents, the proposed service ensures traceability of misbehaving participants through a cooperation scheme among different authorities. We show the feasibility and the fulfillment of the proposed reporting service in 5G-enabled vehicular networks in terms of security, privacy, and efficiency.

Situation-Aware QoS Routing Algorithm for Vehicular Ad Hoc Networks

A wide range of services has been developed for vehicular ad hoc networks (VANETs), ranging from safety to infotainment applications. An essential requirement for such services is that they are offered with quality of service (QoS) guarantees in terms of service reliability and availability. Searching for feasible routes subject to multiple QoS constraints is, in general, an NP-hard problem. Moreover, routing reliability needs to be paid special attention as communication links frequently break in VANETs. In this paper, we propose employing the situational awareness (SA) concept and an ant colony system (ACS)-based algorithm to develop a situation-aware multiconstrained QoS (SAMQ) routing algorithm for VANETs. SAMQ aims to compute feasible routes between the communicating vehicles subject to multiple QoS constraints and pick the best computed route, if such a route exists. To mitigate the risks inherited from selecting the best computed route that may turn out to fail at any moment, SAMQ utilizes the SA levels and ACS mechanisms to prepare certain countermeasures with the aim of assuring a reliable data transmission. Simulation results demonstrate that SAMQ is capable of achieving a reliable data transmission, as compared with the existing QoS routing algorithms, even when the network topology is highly dynamic.

A Reliability-Based Routing Scheme for Vehicular Ad Hoc Networks (VANETs) on Highways

Vehicular ad hoc networks (VANETs) are a special form of networks which enable the communications among vehicles on roads with no need of fixed infrastructure. The special characteristics of VANETs like high mobility and frequent changes of network topology create challenging technical issues, which need to be resolved in order to deploy these networks effectively. Routing reliability is one of the most critical issues where, the established route should be the most reliable one among all other routes to the destination. In this paper, we propose a new reliability-based routing scheme for VANETs in order to facilitate Quality of Service (QoS) support in the routing process. The link reliability is defined as the probability that an active link remains available for a certain time interval. The location and velocity information of vehicles are used to calculate link reliability accurately. We demonstrate that the proposed scheme improves significantly the performance of the standard Ad hoc On-demand Distance Vector (AODV) routing protocol.

Driving with Sharks: Rethinking Connected Vehicles with Vehicle Cybersecurity

In a public service announcement on 17 March 2016, the Federal Bureau of Investigation jointly with the U.S. Department of Transportation and the National Highway Traffic Safety Administration (NHTSA) released a warning regarding the increasing vulnerability of motor vehicles to remote exploits [18]. Engine shutdowns, disabled brakes, and locked doors are a few examples of possible vehicle cybersecurity attacks. Modern cars grow into a new target for cyberattacks as they become increasingly connected. While driving on the road, sharks (i.e., hackers) need only to be within communication range of a vehicle to attack it. However, in some cases, they can hack into it while they are miles away. In this article, we aim to illuminate the latest vehicle cybersecurity threats including malware attacks, on-board diagnostic (OBD) vulnerabilities, and automobile apps threats. We illustrate the in-vehicle network architecture and demonstrate the latest defending mechanisms designed to mitigate such threats.

Secure and privacy-aware proxy mobile IPv6 protocol for vehicle-to-grid networks

Vehicle-to-Grid (V2G) networks have emerged as a new communication paradigm between Electric Vehicles (EVs) and the Smart Grid (SG). In order to ensure seamless communications between mobile EVs and the electric vehicle supply equipment, the support of ubiquitous and transparent mobile IP communications is essential in V2G networks. However, enabling mobile IP communications raises real concerns about the possibility of tracking the locations of connected EVs through their mobile IP addresses. In this paper, we employ certificate-less public key cryptography in synergy with the restrictive partially blind signature technique to construct a secure and privacy-aware proxy mobile IPv6 (SP-PMIPv6) protocol for V2G networks. SP-PMIPv6 achieves low authentication latency while protecting the identity and location privacy of the mobile EV. We evaluate the SP-PMIPv6 protocol in terms of its authentication overhead and the information-theoretic uncertainty derived by the mutual information metric to show the high level of achieved anonymity.

A centralised Wi-Fi management framework for D2D communications in dense Wi-Fi networks

In Wi-Fi networks, Device-to-Device (D2D) communications aim to improve the efficiency of the network by supporting direct communication between users in close proximity. However, in a congested Wi-Fi network, establishing D2D connections through a locally managed self-organising approach will intensify the congestion and reduce the scalability of the solution. Therefore, a centralised management approach must be involved in orchestrating those actions to guarantee the sufficiency of D2D communications. In this paper, we propose a novel management framework for D2D communications in dense Wi-Fi networks. The proposed framework employs a Software-Defined Networking (SDN) based centralised controller in synergy with a novel Access Point (AP) channel assignment process. This framework is designed to proactively establish and manage D2D connections in Wi-Fi networks considering the available radio resources and the effect of the subsequent interference. Thus, improving the overall performance of the network and providing users with higher data rate. Through simulation, we validate the effectiveness of the proposed framework and demonstrate how D2D deployment considerably improves the Wi-Fi network efficiency especially when the data rate requirements are high. Furthermore, we show that our proposed framework achieves better performance than the widely deployed Least Congested Channel selection strategy (LCC).

Secure proximity-based identity pairing using an untrusted signalling service

New protocols such as WebRTC promise seamless in-browser peer-to-peer communications that in theory remove the need for third-party services. In practice, widespread use of Firewalls, NATS and dynamic IP addresses mean that overlay addressing or use of some fixed rendezvous point is still needed. In this paper we describe a proximity-based pairing scheme that uses a signalling service to minimise the trust requirements on the third party, achieving anonymity and avoiding the need for PKI, while still requiring only a simple asymmetric pairing protocol.