Next Article in Journal
Influence of the Antenna Orientation on WiFi-Based Fall Detection Systems
Next Article in Special Issue
ESCOVE: Energy-SLA-Aware Edge–Cloud Computation Offloading in Vehicular Networks
Previous Article in Journal
Fabrication and Characterization of Flexible Capacitive Humidity Sensors Based on Graphene Oxide on Porous PTFE Substrates
Previous Article in Special Issue
Sparse Bayes Tensor and DOA Tracking Inspired Channel Estimation for V2X Millimeter Wave Massive MIMO System
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Novel Road Traffic Management Strategy for Rapid Clarification of the Emergency Vehicle Route Based on V2V Communications

by
Radwa Ahmed Osman
1,*,
Amira I. Zaki
2 and
Ahmed Kadry Abdelsalam
3
1
Basic and Applied Science Department, College of Engineering and Technology, Arab Academy for Science and Technology (AAST), Alexandria 1029, Egypt
2
Electronics and Communications Department, College of Engineering and Technology, Arab Academy for Science and Technology (AAST), Alexandria 1029, Egypt
3
Electrical and Control Engineering Department, College of Engineering and Technology, Arab Academy for Science and Technology (AAST), Alexandria 1029, Egypt
*
Author to whom correspondence should be addressed.
Sensors 2021, 21(15), 5120; https://doi.org/10.3390/s21155120
Submission received: 10 June 2021 / Revised: 26 July 2021 / Accepted: 26 July 2021 / Published: 28 July 2021
(This article belongs to the Special Issue Vehicle-to-Everything (V2X) Communications)

Abstract

:
Vehicle-to-vehicle communication is a promising paradigm that enables all vehicles in the traffic road to communicate with each other to enhance traffic performance and increase road safety. Through vehicle-to-vehicle (V2V) communication, vehicles can understand the traffic conditions based on the information sent among vehicles on the road. Due to the potential delay caused by traffic jams, emergency vehicles may not be able to reach their destination in the required time, leading to severe losses. The case is more severe especially in developing countries where no emergency-vehicle-dedicated lanes are allocated. In this study, a new emergency vehicle route-clarifying strategy is proposed. The new clarifying strategy is based on vehicular traffic management in different interference medium scenarios. The proposed model aims, through V2V communication, to find the nearest vehicle with which to communicate. This vehicle plays an important role in reducing the travel time: as the emergency message is received, this vehicle will immediately communicate with all the neighboring vehicles on the road. Based on V2V communications, all the vehicles in the road will clear from the lane in the road for the emergency vehicle can safely reach its destination with the minimum possible travel time. The maximum distance between the emergency vehicle and the nearest vehicle was determined under different channel conditions. The proposed strategy applied an optimization technique to find the varied road traffic parameters. The proposed traffic management strategy was evaluated and examined through different assumptions and several simulation scenarios. The obtained results validated the effectiveness and the accuracy of the proposed model, and also indicated significant improvement in the network’s performance in terms of packet delivery ratio (PDR) and average end-to-end delay (E2E).

1. Introduction

The last few decades have witnessed a huge rise in the population living in the same metropolitan areas, which has increased the road traffic density and, consequently, has increased the number of accidents year by year. Most governments and the automotive industry invest many resources into increasing road safety and traffic efficiency, and also reducing the harmful effects of the transportation system on the environment. For this reason, vehicle communication and vehicle ad-hoc networks (VANETs) aim to improve road safety, driving comfort, and traffic efficiency [1]. One of the everincreasing problems worldwide is traffic congestion. Congestion increases fuel consumption and travel time due to traffic jams, increases air pollution, reduces the efficiency of the transportation infrastructure, and affects people’s health. Increasing vehicle numbers worldwide have significantly increased the number of accidents and decreased the safety of vehicles and pedestrians [2]. Additionally, they increase the network’s overhead and interference with other vehicles. Vehicle-to-Everything (V2X) is considered as one of the promising techniques for intelligent transportation system (ITS) that would enable vehicles, infrastructure, and people to exchange information. Moreover, V2X mainly includes vehicle-to-vehicle (V2V), vehicle-to-infrastructure (V2I), vehicle-to-device (V2D), vehicle-to-pedestrian (V2P), and vehicle-to-network (V2N) communication. All these applications require efficient, reliable, scalable, and timely communication systems [3].
V2V networks have become a very common technique for improving traffic conditions and safe driving by sharing road and traffic information among vehicles in real time. Additionally, when V2V communications are applied, there is no need for roadside units or infrastructure to transfer the information to other vehicles; hence, vehicles can be used as relays to directly send and exchange the information [4]. Furthermore, to increase road safety and improve road traffic, it is important to link the characteristics of V2V communications with the physical mobility characteristics of the vehicular system through developing new frameworks [5]. Moreover, the detection of the road traffic congestion through V2V communication plays an important role in reducing the network’s overhead by distributing congestion information [6].
Dedicated short-range communication (DSRC) is used to support V2I and V2V communications [7,8]. Based on the IEEE 802.11p, the DSRC system adopts the carrier sense multiple access (CSMA) technique to help vehicles to directly communicate with each other without the need to go through the infrastructure [9]. Additionally, the physical layer of IEEE 802.11p can be implemented to mitigate the effect of imperfect channel state information (CSI) [10]. Furthermore, DSRC can be considered as a very attractive feature through developing a new approach that leads to a cost-effective solution for urban traffic control [11]. Since the performance of DSRC is directly related to human and vehicle safety, its elaborated performance was evaluated in real-world scenarios [12].
During a traffic jam, if an emergency vehicle becomes stuck and its arrival at the accident location is delayed, it may cause victims and loss of property. Thus, this work proposes a new vehicular traffic management system for emergency vehicles such as ambulance vehicles, fire engines, and police cars, based on V2V communication, to solve the problem of travel delays due to traffic jams. The contributions of this article are summarized as follows.
  • The proposed approach allows the emergency vehicles to communicate with the nearest vehicle in the crowded area to effectively send an emergency message to other vehicles, containing the information that there is an emergency vehicle on its way. Upon receiving this information, all the vehicles on the road will change their paths and clear the path for the oncoming emergency vehicle.
  • The proposed approach developed an efficient method to enhance transmission efficiency and system reliability, and reduce the travel time of the emergency vehicles to drive safely to their destination, which saves people’s lives. This can be achieved by finding the nearest vehicles to communicate with and efficiently relay messages to the other vehicles on the road.
  • An optimization problem to ascertain that the communication among all the vehicles is reliable, and to achieve the required system QoS was formulated.
  • The proposed technique was evaluated in terms of packet delivery ratio, average end-to-end delay, and travel time under different conditions, such as differing transmission power, channel conditions (path loss exponent), and interference due to the other transmission sources. The interference can be, for example, from vehicles or devices, vehicle mobility, vehicle density, and vehicle speed. These findings can optimize the system performance for the whole network in a vibrant environment.
The proposed paper is organized into five sections. Following the introduction, Section 2 discusses the relevance of this research to other work. The system model, optimization problem formulation, and the proposed scenario for reducing the travel time are presented in Section 3. Simulation results and discussions are provided in Section 4. Finally, the paper is concluded in Section 5.

2. Literature Review

Different algorithms and protocols have been proposed in literature regarding traffic congestion. A recent evolved criterion called traffic processability, which implies a balance between the traffic demand and traffic capacity, has been presented to mitigate road traffic congestion [13]. This model was implemented based on utilizing the traffic processability of the neighbors, where different weights are assigned to roads in each agent according to their importance or the real-time traffic conditions. Additionally, to decrease travel delays, a traffic guidance method was proposed and a Nash equilibrium optimization scheme was designed, which succeeded in reducing the travel time during the traffic congestion [14]. Furthermore, to improve mobility in large urban traffic systems, a two-level hierarchical model-based predictive control system was presented to improve the whole network’s performance under different traffic scenarios [15]. Moreover, to predict the probability of traffic congestion, discrete-time Markov chain and online traffic monitoring was used to optimize the vehicle routes as presented [16]. Additionally, the traffic signal control strategy proposed in [17] aimed to minimize the vehicle travel time and increase road safety based on implementing a macroscopic model for pedestrian–vehicle mixed-flow networks. Furthermore, machine learning was considered as one of the promising techniques to control traffic congestion and, at the same time, to attempt to guarantee the system’s quality-to-service requirements. Machine learning requires large datasets to be used in the training steps which is solved in [18].
Improving the efficiency of vehicular communications through a traffic jam is another important issue that should be studied and addressed, as traffic jamming causes channel overhead, and congestion reduces the system’s reliability and increases the average end-to-end delay. A dynamic link reliability method, called a link reliability-based adaptive routing algorithm (LRAR), was presented to enhance the transmission efficiency by increasing the packet delivery ratio and reducing the average end-to-end delay [19]. Additionally, to enhance the transmission efficiency of VANETs, a new framework of content delivery was suggested, where each moving vehicle can obtain small-volume content files from either the nearest infrastructure (base station) or roadside unit. Next, a stochastic geometry and point process theory was implemented to establish the profit models for both base stations and roadside units [20]. For improving the quality of service (QoS) across vehicular communications, a model was proposed, based on cooperative communications for a combined vehicle-to-infrastructure (V2I) system in which vehicle-to-vehicle communication was elaborated to increase the system’s reliability and transmission efficiency [21,22].
Furthermore, V2V communication is a promising technique that enhances V2I communication and also helps improve the overall system performance of vehicular communications. Additionally, it helps improve road safety conditions, prevent accidents, and overcome human errors. In addition, through implementing a stochastic model of V2V and V2I communications, the system’s reliability can be enhanced by merging the effects of channel contentions and vehicle mobility [23]. To guarantee the QoS of V2I and V2V communications, a reinforcement learning (RL) framework based on statistical information and a slow fading parameter under different channel conditions succeeded in maximizing the bandwidth of V2I communication and the reliability of V2V links [24].
On the other hand, cooperative communication has been considered as one of the promising techniques for system performance improvement. A new cooperative transmission scheme called cooperative superposed transmission (CST) allows vehicle users to retransmit other users’ V2V packets during their transmission to achieve high system reliability and low latency [25]. Moreover, a cooperative communication scheme with optimized resource utilization has been suggested to increase the system’s throughput through investigating interference management and resource allocation based on a clustering mechanism in the D2D communications underlying VANETs [26]. Furthermore, a cooperative solution for V2X guaranteed both reliability and latency reduction for 5G and V2X, consequently decreasing the transmission collision probability [27]. Additionally, transmission of the information from the source to its destination over multi-hop V2V communication through the best relay vehicle selection was analyzed with the aim of enhancing the system’s performance and the system’s accuracy [28].
This study presents a new traffic management system for traffic congestion based on V2V communication for emergency vehicles. The proposed model aims to allocate the nearest vehicle for the emergency vehicle to communicate with under different conditions such as network capacity and interference. The proposed role of this vehicle is to send emergency vehicle messages to other vehicles in the road with reliable and efficient connection and minimum end-to-end delay. The proposed strategy applies an optimization technique to optimize the maximum distance between any two successive vehicles in the route based on the various road traffic parameters in terms of three aspects: (i) the maximum safe distance between every two successive vehicles, (ii) the required maximum limited velocity, and (iii) the maximum possible number of vehicles in each lane. Thus, based on the received message; all vehicles on the road will follow another path and clear the way for the emergency vehicle. This will enhance the overall vehicular system’s performance and, consequently, decrease the travel time needed for the emergency vehicle to arrive safely at its destination. Different scenarios were investigated to assess and evaluate the overall performance of the proposed approach in terms of packet delivery ratio and average end-to-end delay. The proposed model shows how to achieve the optimized required vehicular communication performance through finding the nearest vehicle to the emergency vehicle for relaying the message to other vehicles. Consequently, the overall communication system’s efficiency and reliability are enhanced. Additionally, the proposed approach guarantees adequate clearing of the path for the emergency vehicles to reach their destinations with minimum travel time. This proposed model is a critical solution for saving people’s lives and property, especially in developing countries, where no dedicated lanes for emergency vehicles are allocated.

3. Proposed Model and Problem Formulation

3.1. System Model

Traffic jams and interference may affect people lives and the reliability of communication. Traffic jams can prohibit emergency vehicles from reaching their destination in minimum travel time. On the other hand, the interference that occurs due to other devices sharing the same spectrum as the sender may lead to reception of inappropriate information. Thus, the objective of the proposed model, as shown in Figure 1, is to reduce the travel time of the emergency vehicles in the traffic jam. Additionally, the proposed model aimed to enhance the V2V connectivity, which could be affected by the interference caused by other vehicles or devices that share the same spectrum. Therefore, the model is capable of evaluating the nearest vehicle to the emergency vehicle with which it can communicate under different conditions such as different network capacity and interference, as shown in Figure 1a. The distance between the nearest vehicle and the emergency vehicle should be affected by different parameters such as channel conditions, interference, path loss, and transmission power. Furthermore, depending on the nearest vehicle’s position to the emergency vehicle, it should be able to relay the emergency message to the vehicles in the traffic jam. After receiving the emergency message, the vehicles in the road will then follow another path and clear a specific path for the emergency vehicle to drive safely and promptly to its destination, as shown in Figure 1b. This should reduce the travel time, which would save peoples’ lives and property. The proposed model was evaluated in terms of packet delivery ratio and average end-to-end-delay via the combined use of V2V communications, vehicle mobility, vehicle density, vehicle speed, and different interference levels.
A vehicular network was considered that consisted of a road with 4 lanes; V2X and D2D communications were considered in the proposed model. The width of a lane ranged from 3.0 to 3.5 m for any road [29]; this width is typically small compared with the transmission communication range. Due to traffic jams, vehicles were present all along the road and the distance between every two vehicles followed the 2 s rule, where the driver should drive at least 2 s behind the vehicle in front during ideal conditions based on the rules of different countries [30].

3.2. Problem Formulation

The goal of the proposed model was to find the nearest vehicle to the emergency vehicle (E2V) with which the emergency vehicle can communicate under different conditions such as different network capacity and interference. Based on the vehicle’s position, it should relay the emergency message to the other vehicles in the traffic road with maximum required quality-of-service (QoS) and maximum interference transmission power to effectively send the information with the highest packet delivery ratio (PDR) and minimal packet average end-to-end delay (E2E), i.e.,
Max Σ dVnVn+1  dVnVn+1: = f(dVnVn+1, Pv, 𝛌, μ)
s.t. C1: {poutpoutmax}
C2: {PvPvmax}
In the formulated optimization problem, C1 is the constraint that the system outage probability (pout) should be less than or equal to the maximum outage probability (poutmax) to satisfy the required QoS. C2 indicates the constraint that the maximum transmission power of any transmission vehicle on the road (Pv) must be lower than the maximum vehicle transmission power (Pvmax). dVnVn+1 is the distance between any two successive vehicles on the road. λ and μ are the non-negative Lagrangian multipliers for C1 and C2, respectively.
The required QoS can be expressed as [31]:
QoS = 1 − pout
Additionally, dVnVn+1 can be derived from the equation given in [32]:
d V n V n + 1 = ( S I N R t h ( P D | h D V n + 1 | 2   P L D V n + 1 + P C | h C V n + 1 | 2   P L C V n + 1 + P v i | h V V n + 1 | 2   P L V V n + 1 + N ) P v | h V n V n + 1 | 2   P L O   l n ( 1 p o u t ) ) 1 α
where pout is the system outage probability. The system outage probability is defined as the probability that the signal-to-interference-plus-noise-ratio (SINR) at the receiver is less than the required threshold (SINRth) which allows error-free decoding. Hence, pout can be given by [33,34]:
  p o u t = p ( S I N R S I N R t h ) = 1 e ( S I N R t h   ( N + I ) P s   | h | 2   γ )
where γ and I are the path loss between the source and destination and the interference which occurs due to the other sources that share the same spectrum. N is the noise power spectral density. h and PS represent the fading channel coefficient between the source and destination, and the transmission power, respectively.
The proposed model tests system efficiency and reliability under various operating conditions using standard benchmarks such as (i) packet delivery ratio, and (ii) average end-to-end delay.
We assume that the transmission signal between V2V links undergoes Rayleigh fading with additive white Gaussian noise (AWGN) with zero mean, variance NO, and propagation path loss [35]. The channel fading is considered to be statistically mutually independent for different links. Furthermore, as a wireless standard for vehicular communications, DSRC has been designed to support the automotive system. DSRC technology involves different types of short-range wireless communication channel, which are one-way and two-way. These two types are designed for automotive communication. The 75 MHz spectrum in the 5.9 GHz band for short-range communications has been allocated by the US Federal Communications Commission (FCC) to be used in intelligent transportation systems (ITS) including V2I and V2V links. Furthermore, 30 MHz of the spectrum in the 5.9 GHz band for ITS has been allocated by the European Telecommunications Standards Institute (ETSI). IEEE 802.11p standardizes the physical and MAC layer of DSRC for vehicular communication. Additionally, it aims to provide a communication range up to 1000 m for both V2V and V2I communications; it also supports transmission rates from 3 to 27 Mb/s over a bandwidth of 10 MHz [10].

3.3. Vehicle Communication Scenario

The vehicular scenario is shown in Figure 1, where there is a traffic jam and where an emergency vehicle needs to reach its destination through this road. Our scenario is divided into two stages. Stage 1 is where the emergency vehicle will send an emergency message to the nearest vehicle asking to clear the path. Consequently, at Stage 2, this vehicle will relay the emergency vehicle message to the nearest vehicles in the road. Next, all the vehicles will relay this message through multi-hop communication. When receiving this message, all the vehicles in the road will divert from their current path for the emergency vehicle and follow another path. Any pair of vehicles can directly communicate with each other if and only if this pair is within the radio range. Thus, the proposed model intends to find the nearest vehicle to the emergency vehicle to send an emergency message and, consequently, this message will be relayed through all the vehicles in the traffic. The proposed model adopts two communication schemes: (i) the first one is the communication between emergency vehicles and the nearest vehicle, and (ii) the second is the communication between the established vehicle (V) and all vehicles on the road, which is V2V communication. For road safety, the distance between all vehicles in the road must follow the 2 s rule, which means that the distance for V2V communication must be equal to 2 times the vehicles’ velocity. The uplink communication between any V2V pair is assumed to be via frequency-flat block-fading Rayleigh channels [36].

3.3.1. First Stage

In the first stage, an algorithm is introduced to determine the nearest vehicle to the emergency vehicle that it can communicate with; this is illustrated in Algorithm 1. The nearest vehicle is determined based on different environmental conditions such as transmission power, path loss, interference, and channel noise. The interference between the required main link and the interference links are assumed to be the same for all main links. Therefore, the signal-to-interference-plus-noise (SINREVN) and the outage probability (poutEVN) between the emergency vehicle and the nearest vehicle is given by:
S I N R E V N = P E | h E V N | 2   P L O   d E V N α   P D | h D V N | 2   P L D V N + P C | h C V N | 2   P L C V N + P v i | h V V N | 2   P L V V N + N
p o u t E V N = 1 e ( S I N R t h ( P D | h D V N | 2   P L D V N + P C | h C V N | 2   P L C V N + P v i | h V V N | 2   P L V V N + N ) P E | h E V N | 2     P L O   d E V N α   )
where PE, hEVN, PLO, and d E V N α are the emergency vehicle’s transmission power, the fading channel coefficient of the vehicle, the path loss constant, and distance between the emergency vehicle and the nearest vehicle, respectively. PD, hDVN, and PLDVN are the interference device’s transmission power and fading channel coefficient, and the path loss between any transmitting device and the nearest vehicle, respectively. PC, hCVN, and PLCVN are the interference cellular user’s transmission power and fading channel coefficient, and the path loss between the transmitted CUE and the nearest vehicle, respectively. Pvi, hVVN, and PLVVN are the interference vehicle’s transmission power and fading channel coefficient, and the path loss between any transmitting vehicle and the nearest vehicle, respectively. Thus, dEVNmax is constrained by the outage probability system target, so it can be deduced from Equation (6) as:
  d E V N m a x = ( S I N R t h ( P D | h D V N | 2   P L D V N + P C | h C V N | 2   P L C V N + P v i | h V V N | 2   P L V V N + N ) P E | h E V N | 2   P L O   l n ( 1 p o u t E V N ) ) 1 α

3.3.2. Second Stage

When the nearest vehicle receives the emergency message from the emergency vehicle, this vehicle will send this data to all the nearest vehicles in the traffic. In the proposed scenario, it is assumed that there are 4 lanes and each lane is occupied by vehicles such that the distance between each of them is assumed to be 2 multiplied by the vehicle velocity in m/s successively. The candidate nearest vehicle will send the emergency message to the nearest vehicles in each lane. Consequently, the receiving vehicles will relay the message through multi-hop communication. During this stage, Algorithm 2 is introduced to determine the vehicle system performance during the traffic congestion from the beginning of the transmission of the emergency message until the reception of this message by the last vehicle. Additionally, it shows the change in traffic conditions after reception of the emergency message by all vehicles. Thus, the outage probability of a traffic jam due to the vehicles in each lane ( p o u t L i ) is given by:
p o u t L i = p o u t E 2 V N V N V 1 + n = 1 K p o u t l i V n V n + 1 p o u t E 2 V N V N V 1 n = 1 K p o u t l i V n V n + 1
where p o u t E 2 V N V N V 1 is the outage probability of the emergency vehicle and the nearest vehicle, and of the nearest vehicle and the first vehicle with which it communicates in the traffic. poutlivnvn+1 is the outage probability of any two successive vehicles on the road. i is the lane number, where i ∈ {1, …, 4}, and n represents the number of vehicles in each lane in the road, where n ∈ {1, …, K}. Thus, p o u t E 2 V N V N V 1 and n = 1 K p o u t L i V n V n + 1 can be expressed as:
p o u t E V N V N V 1 = 1 ( e ( S I N R t h ( P D | h D V N | 2   P L D V N + P C | h C V N | 2   P L C V N + P v i | h V V N | 2   P L V V N + N ) P v | h E V N | 2   P L O   d E V N α + S I N R t h ( P D | h D V 1 | 2   P L D V 1 + P C | h C V 1 | 2   P L C V 1 + P v i | h V V 1 | 2   P L V V 1 + N ) P v | h V N V 1 | 2   P L O   d V N V 1 α ) )
n = 1 K p o u t l i V n V n + 1 = 1 n = 1 K ( 1 e ( S I N R t h ( P D | h D V n + 1 | 2   P L D V n + 1 + P C | h C V n + 1 | 2   P L C V n + 1 + P v i | h V V n + 1 | 2   P L V V n + 1 + N ) P v | h V n V n + 1 | 2   P L O   d V n V n + 1 α ) )
Let:
  • I 1 = P D | h D V N | 2   P L D V N + P C | h C V N | 2   P L C V N + P v i | h V V N | 2   P L V V N ,
  • I 2 = P D | h D V 1 | 2   P L D V 1 + P C | h C V 1 | 2   P L C V 1 + P v i | h V V 1 | 2   P L V V 1 , and
  • I 3 = P D | h D V n + 1 | 2   P L D V n + 1 + P C | h C V n + 1 | 2   P L C V n + 1 + P v i | h V V n + 1 | 2   P L V V n + 1
To ensure the model system’s performance with the road safety requirements, the communication among all the vehicles on the road should be well investigated to maximize the distance between any two vehicles on the road, and also to find the maximum velocity of each vehicle based on the channel and road conditions. Thus, for simplicity, the outage probability of the data sent from the emergency vehicle to the nearest vehicle to all the vehicles in each lane in the road can be expressed as:
p o u t L i = 1 e ( S I N R t h ( I 1 + N ) P v | h E 2 V N | 2   P L O   d E 2 V N α + S I N R t h ( I 2 + N ) P v | h V N V 1 | 2   P L O   d V N V 1 α + n = 1 K S I N R t h ( I 3 + N ) P v | h V n V n + 1 | 2   P L O   d V n V n + 1 α )
For road safety, the distance between any two vehicles must be greater or equal to 2 ∗ v; thus Equation (11) can be written as:
p o u t l i = 1 e ( S I N R t h ( I 1 + N ) P v | h E 2 V N | 2   P L O   d E 2 V N α + S I N R t h ( I 2 + N ) P v | h V N V 1 | 2   P L O   d V N V 1 α + n = 1 K S I N R t h ( I 3 + N ) P v | h V n V n + 1 | 2   P L O   ( 2 v ) α )
where n is the total number of vehicles on the road, which can be defined as:
n = D 2 v + ( 2 V L )
where D and VL are the road length and vehicle length, respectively.
Based on Equations (12) and (13), the maximum vehicle velocity can be given as:
v = 0.5 ( ( ln ( 1 p o u t l i ) (   S I N R t h ( I 1 + N ) d E 2 V α P v | h E 2 V | 2   P L O + S I N R t h ( I 2 + N ) d V N V 1 α P v | h V N V 1 | 2   P L O   ) )   P v | h V 2 V 1 | 2   P L O   D S I N R t h ( I 2 + N ) ) 1 α 1
For the optimization problem specified in Equation (1), the first-order optimality conditions can now be investigated. The Lagrangian of the optimization problem can be calculated as:
L ( p o u t l i , P v , λ , μ ) = f ( p o u t l i ,   P v ) + λ ( p o u t m a x p o u t l i ) + μ ( P v m a x P v ) .
Based on Equation (11), the distance between any two successive vehicles on the road traffic can be deduced as:
d V n V n + 1 = [ P v | h V n V n + 1 | 2   P L O S I N R t h ( I 3 + N ) ( l n ( 1 p o u t l i ) S I N R t h ( I 1 + N ) P v | h E 2 V N | 2   P L O   d E 2 V N α S I N R t h ( I 2 + N ) P v | h V N V 1 | 2   P L O   d V N V 1 α ) ] 1 α
where λ and μ are non-negative Lagrangian multipliers for C1 and C2. By taking the derivative of Equation (16) concerning poutli and Pv, respectively, the optimal solution to Equation (1) can be found as:
L ( p o u t l i , P v , λ , μ ) p o u t l i = 0 d V V p o u t l i λ = 0   λ = 1 α [ P v | h V n V n + 1 | 2   P L O S I N R t h ( I 3 + N ) ( l n ( 1 p o u t l i ) S I N R t h ( I 1 + N ) P v | h E 2 V N | 2   P L O   d E 2 V N α S I N R t h ( I 2 + N ) P v | h V N V 1 | 2   P L O   d V N V 1 α ) ] 1 α 1 ( 1 ( 1 p o u t l i ) )
L ( p o u t l i , P v , λ , μ ) P v = 0 d V V P v μ = 0 μ = 1 α [ P v | h V n V n + 1 | 2   P L O S I N R t h ( I 3 + N ) ( l n ( 1 p o u t l i ) S I N R t h ( I 1 + N ) P v | h E 2 V N | 2   P L O   d E 2 V N α S I N R t h ( I 2 + N ) P v | h V N V 1 | 2   P L O   d V N V 1 α ) ] 1 α 1 ( | h V n V n + 1 | 2   P L O S I N R t h ( I 3 + N ) ( l n ( 1 p o u t l i ) S I N R t h ( I 1 + N ) P v | h E 2 V N | 2   P L O   d E 2 V N α S I N R t h ( I 2 + N ) P v | h V N V 1 | 2   P L O   d V N V 1 α ) ) + P v | h V n V n + 1 | 2   P L O S I N R t h ( I 3 + N ) ( S I N R t h ( I 1 + N ) P v 2 | h E 2 V N | 2   P L O   d E 2 V N α + S I N R t h ( I 2 + N ) P v 2 | h V N V 1 | 2   P L O   d V N V 1 α )
Additionally, for the value of poutli and Pv, by taking the derivative of (14) concerning λ and μ, respectively, it can be found that:
L ( p o u t l i , P v , λ , μ ) λ = 0
L ( p o u t l i , P v , λ , μ ) μ = 0
Next, from the first-order optimality conditions, the following two propositions can be derived.
Proposition 1: To achieve the maximum safety distance after receiving the emergency message with the best required QoS between any two vehicles on the road, the outage probability for each lane (poutli) should be equal to the maximum required the outage probability (poutmax), which is given by:
poutli = poutmax
Proposition 2: To achieve the maximum safety distance after receiving the emergency message with the best required QoS, the transmission power of each vehicle (Pv) should be equal to the maximum vehicle transmission (Pvmax), which is given by:
Pv = Pvmax
The two expressions obtained from Equations (21) and (22) play a significant role in enhancing the system’s performance, determining the required safety distance between vehicles and the maximum required velocity. In addition, determining the maximum required safety distance between vehicles will guide the driver as to which velocity he/she should drive at and which path he/she should follow. Additionally, controlling the vehicle transmission power helps decrease the overall system power consumption and the cost as well; it also decreases the interference among other existing transmission sources.
Algorithm 1: Finding the nearest vehicle with which to communicate
Input: Number of vehicles in the transmission area (V), emergency vehicle position, emergency vheicle transmisson power (PE), channel fade coefficient (hEVN), different interfence devices, interference transmission power (PD, PC, Pvi), interference channel fade coefficient (hDVN, hCVN, hVVN), channel noise (N), the required outage probability (poutEVN), and the path loss exponent (α)
Output: Finding the nearest vehicle with which to communicate
1: Establish the required poutEVN
2: for different values of PE, PD, PC, Pv, hEVN, hDVN, hCVN, hVVN, α do
3: Determine the nearest receiving vehicle using
  d E V N m a x = ( S I N R t h ( P D | h D V N | 2   P L D V N + P C | h C V N | 2   P L C V N + P v i | h V V N | 2   P L V V N + N ) P E | h E V N | 2   P L O   l n ( 1 p o u t E V N ) ) 1 α
4: Send emergency message to the nearest receiver directly
5: end for
Algorithm 2: System performance evaluation
Input: Number of lanes (L), initial number of vehicles (ni) in each lane lane, emergency vehicle position, emergency vehicle transmisson power (PE), vehicle transmisson power (Pv), channel fade coefficient (hEVN, hVNV1), different interfence devices, interference transmission power (PD, PC, Pvi), interference channel fade coefficient (hDV1, hCV1, hVV1), channel noise (N), path loss exponent (α), and the initial vehicle velocity (vi)
Output: PDR, E2E, v, number of vehicles in each lane (n), poutLi, Pv
1: Establish the required p o u t L i
2: Establish L, ni, vi
3: for different values of PE, PD, PC, Pv, hEVN, hDVN, hCVN, hVVN, α, v, N do
4: Calculate the velocity of the vehicles in each lane after receiving the emergency message v = 0.5 ( ( ln ( 1 p o u t l i ) (   S I N R t h ( I 1 + N ) d E 2 V α P v | h E 2 V | 2   P L O + S I N R t h ( I 2 + N ) d V N V 1 α P v | h V N V 1 | 2   P L O   ) )   P v | h V 2 V 1 | 2   P L O   D S I N R t h ( I 2 + N ) ) 1 α 1 ;
5: Calculate required number of vehicles in each lane
n = D 2 v + ( 2 V L )
6: Construct the Lagrange function
    L ( p o u t l i , P v , λ , μ ) = f ( p o u t l i ,   P v ) + λ ( p o u t m a x p o u t l i ) + μ ( P v m a x P v )
7: Calculate the partial derivatives L ( p o u t l i , P v , λ , μ ) λ ,   L ( p o u t l i , P v , λ , μ ) μ ,     L ( p o u t l i , P v , λ , μ ) p o u t l i   , and L ( p o u t l i , P v , λ , μ ) P v
8: Let L ( p o u t l i , P v , λ , μ ) λ = 0 , L ( p o u t l i , P v , λ , μ ) μ = 0 ,   L ( p o u t l i , P v , λ , μ ) p o u t l i = 0 , L ( p o u t l i , P v , λ , μ ) P v = 0
9: Determine 𝛌, μ, poutLi, Pv
10: Calculate PDR
              P D R = # r e c e i v e d _ p a c k e t s # s e n t _ p a c k e t s
11: Calculate E2E
       E 2 E = received   packets time   spent   to   deliver   packets # received _ packets
12: end for
Two metrics have been considered to evaluate the system performance of the proposed model and compare it with the model proposed in [19], which are:
4
Packet delivery ratio (PDR): This is the ratio of the successful number of packets received by the destinations to the total number of the packets sent by the source. The system is considered reliable and efficient when the value of PDR increases. Thus, PDR can be given as [37]:
P D R = # r e c e i v e d _ p a c k e t s # s e n t _ p a c k e t s
5
Average end-to-end delay (E2E): The average end-to-end delay can be defined as the total time needed to successfully receive the transmitted packets over a network. The average end-to-end delay can be measured as the sum of the amount of time spent from sending a packet until it reaches its destination over the total number of packets received by the destination [37]:
E 2 E = received   packets time   spent   to   deliver   packets # received _ packets

4. Numerical Results and Discussion

4.1. Introduction

In this section, the performance of the proposed traffic management technique was evaluated through two different software simulation packages: MATLAB and NS-2.

4.2. Software Tools

The MATLAB software package was used to implement the mathematical model for finding the maximum distance between the emergency vehicle and the first receiving vehicle under different channel conditions such as (i) transmission interference power, (ii) distance to interference, and (iii) signal-to-interference-plus-noise (SINR). Meanwhile, the NS-2 software package is considered as very powerful simulation software, so it was used for evaluating the system performance in terms of (i) packet delivery ratio and (ii) average end-to-end delay.

4.3. Investigated Case Parameters

For avoiding collisions and reducing the rate of accidents, the 2 s rule was followed all over the road [30]. Following this rule, each driver must keep a sufficient distance between his/her vehicle and any other vehicle in front for his/her safety.
NS-2 was used to build the road traffic with its conditions, besides the mobility files generated. Additionally, to evaluate the system performance, an AWK script was implemented to extract the required measured metrics from trace files generated during the simulation. Moreover, in the suggested proposed traffic management technique, all vehicles were running at a fixed speed which was 60 km/h as long as they had not received the emergency message. When the emergency message was received, the vehicles’ velocity changed. Based on road traffic information, the lane width in the road was 3.5 m and the distance between two consecutive vehicles at any stage followed the 2 s rule [30]. The network parameters used for simulation are listed in Table 1 [19,38,39,40,41].

4.4. Results Discussion

Based on Algorithm 1, Figure 2 depicts the distance of the nearest vehicle to the emergency vehicle that it can communicate with versus the interference distance under different conditions such as different interference and SINR. Assuming that there are two scenarios, in the first one, SINR is 5 dB, and the interference transmission power of the CUE, D2D links, and V2V link is 17 dBm, 17 dBm, and 23 dBm, respectively; this case is considered low interference transmission power. However, in the second, the interference transmission power of the CUE, D2D links, and V2V links is 23 dBm, 23 dBm, and 33 dBm, respectively, which is considered high interference transmission power. As can be observed, when both scenarios were considered, the distance to reach the nearest vehicle dramatically increased when the interference distance increased. When the two scenarios were compared, it was found that using low interference transmission power allowed the emergency message to be sent and successfully received with the longest possible distance e.g., when the interference distance was 151 m, the nearest receiving vehicle can be at a distance equal to 96.98 m. However, when using high interference transmission power for the same interference distance, 151 m, the nearest receiving vehicle can be at distance equal to 46.14 m. It can be concluded from this figure that the interference transmission power can prevent the sent message reaching the nearest vehicles and thus prevent the emergency vehicle reaching its destination with minimum travel time.
The distance of the nearest vehicle to the emergency vehicle with which it can communicate is illustrated, again based on Algorithm 1, in Figure 3 with different values of interference transmission. Figure 3 demonstrates that when the transmission power of the interfering devices increased, the emergency message could not be correctly received at very long distances. This means that when the interference transmission power increased the vehicles in the nearest area could not receive the correct message due to the high interference. Two different scenarios have been examined, where the interference distance was assumed to be 40 m with two different required SINR (SINRth) values. It can be noticed that when SINRth was equal to 10 dB and the interference transmission power was 12 dBm, the nearest vehicle’s distance to correctly receive the message under this condition must be 68.29 m. However, when SINRth was equal to 5 dB and the interference transmission power was 12 dBm, the distance to the nearest vehicle should be 99.26 m to correctly receive the emergency message. The result obtained in Figure 3 is correlated with the corresponding performance obtained in Figure 2.
Based on the introduced Algorithm 1, Figure 4 shows the effect of the interference level on the distance that the emergency message travels with different emergency vehicle velocities. It should be mentioned that the distance to reach the nearest vehicle increased when the emergency vehicle’s velocity increased. Additionally, when the interference increased with high SINRth, the distance required to reach the nearest vehicles decreased; e.g., when SINRth was equal to 10 dB, the emergency vehicle’s velocity was 60 km/h, and the system faced high interference, the maximum distance the message could travel was 15.78 m. However, when SINRth was equal to 5 under the same conditions, the message could travel up to 22.79 m. On the other hand, when there was no interference, it could be noticed that the distance that the emergency message traveled became 163.7 m and 241.9 m for when SINRth equaled 10 dB and 5 dB, respectively, with the same channel and road traffic conditions. It can be concluded from Figure 4 that interference can affect the traffic safety and transmission efficiency because if the sent message cannot reach its destination effectively, this could influence the traffic safety because a lack of information and V2V communication will occur. This may lead to a traffic collision and accidents.

4.5. Comparative Analysis

For fair assessment, the proposed traffic management strategy was compared with the recent evaluated model presented in [19]. The model presented in [19] mainly focused on precise vehicle position to decide a suitable route. The model presented in [19] also selected the link with the highest reliability as the transmission path (choosing the path with high SINR) without taking the worst environmental conditions into consideration. Figure 5 demonstrates the packet delivery ratio (PDR) under different numbers of vehicles in the road compared with the multi-level dynamic link model presented in [19]. As can be seen and determined from the proposed Algorithm 2, when the number of vehicles increased, the connectivity of the network was greatly improved, and then the packet delivery ratios of both models increased. It can be also mentioned that the PDR of the proposed model partially increased compared with the other model, which gradually increased, as the main purpose of the proposed model is enhancing the system’s connectivity through V2V communication with an increase in traffic safety. Additionally, it can be seen that the PDR of the proposed model started to decrease when the number of vehicles was 300 but still outperformed the model presented in [19]. This was due to the network’s overhead and the interference caused by the sender vehicles. Furthermore, the model presented in [19] assumed that the SINRth was 20 dB, which means that the interference and the channel contention presented will not effectively affect the network performance. However, in the proposed model, the worst case scenarios were considered, namely that SINRth varied from 5 to 10, only to show how the interference and the channel contention would affect the proposed model.
As proven in Algorithm 2, Figure 6 illustrates the average end-to-end delay (E2E) under different numbers of vehicles with the same channel, network, and traffic conditions. By comparing the proposed model with the presented model in [19], it can be found that the proposed model had a lower average end-to-end delay, as increasing the number of the vehicles under the assumed assumption for both models increased the average end-to-end delay. It is worth mentioning that the increment in the E2E of the proposed model was partially increased compared with the model presented in [19], which gradually increased when the number of vehicles increased. The results obtained show the strength of the proposed model and show how when the number of vehicles increases, the E2E increases slightly, which is an important factor that could affect traffic safety. Additionally, it can also be seen that for the proposed model, when the number of vehicles was 300, the E2E increased gradually; this was due to the decrease in the successfully received packets and the increase in the number of retransmission packets compared with the number of other vehicles. The performance obtained was similar to the packet delivery rate, in that the network interference and channel contention slightly affected the proposed model network performance. Compared with the model presented in [19], the proposed model achieved a better PDR and E2E for different numbers of vehicles under different channel and traffic conditions. Through this performance, the proposed traffic management system showed the effectiveness of the proposed model in terms of network connectivity and traffic safety.
The packet delivery ratio (PDR) with different numbers of vehicles in the road for the proposed traffic management strategy is illustrated in Figure 7, once again based on the introduced Algorithm 2 and evaluated once again for different interference levels, assuming 17 links, 37 links, and 75 links for low, moderate, and high interference, respectively. As demonstrated in Figure 7, when the network faced high interference with an increase in the number of vehicles, the PDR gradually decreased due to the network’s overhead. Furthermore, it can be seen that when the network experienced low and moderate interference, the PDR slightly increased when the number of vehicles increased. The PDR increased when the number of vehicles increased from 100 to 250 due to the increment in the number of packets generated. Thus, when the number of vehicles was 300, the PDR decreased due to the network overhead caused by the number of transmitting and interfering nodes.

4.6. Interference Effect

For the same conditions as mentioned in Figure 7 and following Algorithm 2, the average end-to-end delay (E2E) with different numbers of vehicles in the road is examined in Figure 8 for different interference levels. As illustrated in Figure 8, the E2E of the proposed model decreased when the network faced low and moderate interference compared with high interference. Additionally, for low and moderate interference, the E2E dramatically increased when the number of vehicles was 300 due to the increase in retransmission time caused by the network’s overhead and interference. Furthermore, with high interference, the E2E fluctuated based on the number of received packets, which was strongly influenced by the interference. This result is correlated with the result obtained in Figure 7. It can also be noticed that when the number of vehicles was 300, the E2E with high interference was higher than that with moderate and low interference. In the case of high interference, the number of received packets decreased due to packet loss and the number of retransmission packets. However, in the case of low and moderate interference, the number of received packets increases and then the E2E increased.

4.7. Emergency Vehicle Travel Time

Based on Algorithm 2, the emergency vehicle travel time was evaluated with different emergency vehicle velocities. As can be observed from Figure 9, based on the proposed model, if the distance between the emergency vehicle and its destination was 5000 m. The time taken to reach its destination after applying the proposed model to the traffic road varied based on the emergency vehicle’s velocity; e.g., if the emergency vehicle’s velocity was 100 km/h, which is closer to real life, and the other vehicles in the road clear the path based on the proposed idea, the emergency vehicle would take only 3 min to reach its destination, which is a distance of 5000 m. This result shows how the proposed model could save people’s lives and property, as if the emergency follows the normal road to reach its destination, it may take time more than the result obtained by approximately 25% or more. A delay of 25% or more to reach its destination could make others lose their lives. That is why the proposed model is considered as one of the solutions to solve the problem of congestion, at least for emergency vehicles.

4.8. Proposed Enhancement Adaptive Algorithm

Furthermore, an adaptive algorithm was proposed, based on the introduced Algorithm 2. This adaptive algorithm can be obtained from the derived Equations (13) and (14) stated in Section 3. These derived equations show how the vehicle’s velocity and distance will change in each lane based on the sent information and the environmental conditions. It also shows the required safety distance between any two successive vehicles; this distance is calculated based on the well-known worldwide 2 s rule. Table 2 shows how the vehicle performance varied before and after receiving the emergency message. It can be noticed that when the vehicle velocity was 60 km/h and the road length was 1000 m, based on the 2 s rule, each lane before receiving the emergency message had approximately 26 vehicles and the safety distance between vehicles was approximately 33.33 m. However, when it had received the emergency message, the vehicle’s velocity reduced to 19.8838 km/h to allow other vehicles to follow its lane; each lane had approximately 65 vehicles with a safe distance between each vehicle equal to 10.2 m.
The performance evaluation presented in Figure 2, Figure 3, Figure 4, Figure 5, Figure 6, Figure 7, Figure 8 and Figure 9 shows how the proposed model presented an effective model for V2V communication to increase the system’s reliability and the effectiveness of the connectivity and, at the same time, decrease the travel time for the emergency vehicle to its destination. Furthermore, it was noted that many factors are affecting the V2V connection such as path loss, channel condition, vehicle mobility, density, vehicle velocity, and interference. It was also shown that one of the suitable and adequate solutions is the proposed model, by finding the nearest vehicle to the emergency vehicle with which to communicate to relay the information to the vehicles in the road. Based on the emergency message sent, all the vehicles on the road will adapt their velocity and follow another path to clear the road for the emergency vehicle. The proposed model helps decrease the emergency vehicle travel time; at the same time, it helps increase system reliability and the V2V connectivity. To enhance the system’s performance and achieve the minimum travel time for the emergency vehicle as clarified in this paper, the nearest vehicle to the emergency vehicle with which it can communicate should be determined based on the system conditions and requirements such as the outage probability (Pout), the transmission power Pv and channel quality in terms of α, the vehicles’ mobility, the vehicles’ density, the vehicles’ velocity, and interference. The findings of this work can assist in deciding with which vehicle the connection should be established to relay the emergency information to the other vehicles on the road. Additionally, based on the information sent, some of the vehicles will change their velocity and the rest of the vehicles will decrease their velocity and follow another path. By clearing the path for the emergency vehicle, this will help it to arrive at its destination with the minimum possible travel time.

5. Conclusions

A new traffic management model through V2V communications was proposed to control traffic jams and allow the emergency vehicles to reach their destination safely with the minimum travel time. The nearest vehicle found based on the proposed model helped to reduce the emergency vehicle’s travel time by relaying the emergency message to the other vehicles to clear the road. Additionally, based on the received information, the vehicles in the road adapted their velocity and the maximum distance between any two vehicles to avoid collisions and accidents. Based on the Lagrange optimization technique, the maximum distance between every two vehicles and the maximum velocity for each vehicle was determined under different channel and traffic conditions. Based on the system performance evaluation under the severe channel and traffic conditions, it has been shown that the proposed model can exhibit the best performance under certain environmental conditions compared with other proposed models. The maximum distance between the emergency vehicle and the nearest vehicle can be identified based on the communication environment, such as how many devices can interfere with the E2V communication and the velocity of the vehicle. The results presented in this study can be used to form an adaptive model to control the vehicles’ mobility and direction when receiving an emergency message to achieve the minimum required emergency vehicle travel time with the best V2V transmission efficiency.

Author Contributions

Conceptualization, R.A.O., A.I.Z. and A.K.A.; methodology, R.A.O.; software, R.A.O.; validation, R.A.O.; formal analysis, R.A.O., A.I.Z. and A.K.A.; investigation, R.A.O., A.I.Z. and A.K.A.; resources, R.A.O.; data curation, R.A.O.; writing—original draft preparation, R.A.O.; writing—review and editing, R.A.O., A.I.Z. and A.K.A.; visualization, R.A.O.; supervision, A.I.Z. and A.K.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Symbols

Q o S Quality of service
C1, C2Lagrangian optimization constraints
dVnVn+1Distance between two successive vehicles in the road
PDThe transmission power of any interference device
PDmaxThe maximum transmission power of any transmission device
PCThe transmission power of any interference cellular user’s equipment
PCmaxThe maximum transmission power of any cellular user’s equipment
PvThe transmission power of any vehicle
PviThe transmission power of any interference vehicle
PvmaxThe maximum transmission power of any vehicle
h V n V n + 1 Fading channel coefficient between any two successive vehicles
h D V n + 1 Fading channel coefficient between the interfering device and the receiving vehicle
h C V n + 1 Fading channel coefficient between the interfering CUE and the receiving vehicle
h V V n + 1 Fading channel coefficient between the interfering vehicle and the receiving vehicle
P L D V n + 1 Path loss between any interfering device and the receiving vehicle
P L C V n + 1 Path loss between any interfering CUE and receiving vehicle
P L V V n + 1 Path loss between any interfering vehicle and receiving vehicle
P L V n V n + 1 Path loss between any two V2V links
PDRPacket delivery ratio
E2EAverage end-to-end delay
poutSystem outage probability
poutmaxMaximum system outage probability
S I N R Signal-to-interference-plus-noise ratio
S I N R t h Signal-to-interference-plus-noise ratio threshold
SINREVNSignal-to-interference-plus-noise between the emergency vehicle and the nearest vehicle
poutEVNOutage probability of the emergency vehicle and the nearest vehicle
dEVNDistance between the emergency vehicle and the nearest vehicle
dEVmaxMaximum distance between the emergency vehicle and the nearest vehicle
h Fading channel coefficient
N Noise power spectral density
PSSource transmission power
γ Path loss between the source and destination
P E Emergency vehicle’s transmission power
h E V N Fading channel coefficient between the emergency vehicle and the nearest vehicle
P L E V N Path loss between the emergency vehicle and the nearest vehicle
h D V N Fading channel coefficient between the interfering device and the nearest vehicle
P L D V N Path loss between theinterfering device and the nearest vehicle
h C V N Fading channel coefficient between theinterfering CUE and the nearest vehicle
P L C V N Path loss between the interfering CUE and the nearest vehicle
h V V N Fading channel coefficient between the interfering vehicle and the nearest vehicle
P L V V N Path loss between the interfering vehicle and the nearest vehicle
poutEVNOutage probability of the emergency vehicle and the nearest vehicle
poutliOutage probability of all the communication links in the lane i
p o u t E 2 V N V N V 1 Outage probability of the emergency vehicle and the nearest vehicle, and the nearest vehicle and the first vehicle in the traffic
p o u t l i V n V n + 1 Outage probability of all communicating V2V links in the lane i
h V N V 1 Fading channel coefficient between the nearest vehicle and the first receiving vehicle on the road
P L V N V 1 Path loss between the emergency vehicle and the nearest vehicle
h D V 1 Fading channel coefficient between the nearest vehicle and the first receiving vehicle on the road
P L D V 1 Path loss between the interfering device and first receiving vehicle on the road
h C V 1 Fading channel coefficient between the interfering CUE and the first receiving vehicle on the road
P L C V 1 Path loss between the interfering CUE and the first receiving vehicle on the road
h V V 1 Fading channel coefficient between the interfering vehicle and the first receiving vehicle on the road
P L V V 1 Path loss between the interfering vehicle and the first receiving vehicle on the road
P L O Path loss constant
I Interference
nNumber of vehicles on the road
D Road length
vVehicle velocity
VLVehicle length
λ, µNon-negative Lagrangian multipliers

References

  1. Galarza, M.; Paradells, J. Improving road safety and user experience by employing dynamic in-vehicle information systems. IET Intell. Transp. Syst. 2019, 13, 738–744. [Google Scholar] [CrossRef]
  2. Zhenyu, L.; Lin, P.; Konglin, Z.; Lin, Z. Design and evaluation of V2X communication system for vehicle and pedestrian safety. J. China Univ. Posts Telecommun. 2015, 22, 18–26. [Google Scholar] [CrossRef]
  3. Karagiannis, G.; Altintas, O.; Ekici, E.; Heijenk, G.; Jarupan, B.; Lin, K.; Weil, T. Vehicular Networking: A Survey and Tutorial on Requirements, Architectures, Challenges, Standards and Solutions. IEEE Commun. Surv. Tutor. 2011, 13, 584–616. [Google Scholar] [CrossRef]
  4. Yang, L.; Li, H. Vehicle-to-vehicle communication based on a peer-to-peer network with graph theory and consensus algorithm. IET Intell. Transp. Syst. 2019, 13, 280–285. [Google Scholar] [CrossRef]
  5. Vinel, A.; Lyamin, N.; Isachenkov, P. Modeling of V2V Communications for C-ITS Safety Applications: A CPS Perspective. IEEE Commun. Lett. 2018, 22, 1600–1603. [Google Scholar] [CrossRef]
  6. Wang, R.; Xu, Z.; Zhao, X.; Hu, J. V2V-based method for detection of road traffic congestion. IET Intell. Transp. Syst. 2019, 13, 880–885. [Google Scholar] [CrossRef]
  7. Zheng, K.; Zheng, Q.; Chatzimisios, P.; Xiang, W.; Zhou, Y. Heterogeneous vehicular networking: A survey on architecture, challenges, and solutions. IEEE Commun. Surv. Tutor. 2015, 17, 377–2396. [Google Scholar] [CrossRef]
  8. Ligo, A.K.; Peha, J.M.; Ferreira, P.; Barros, A.J. Throughput and Economics of DSRC-Based Internet of Vehicles. IEEE Access 2018, 6, 7276–7290. [Google Scholar] [CrossRef]
  9. Wu, X.; Subramanian, S.; Guha, R.; White, R.G.; Li, J.; Lu, K.W.; Bucceri, A.; Zhang, T. Vehicular communications using DSRC: Challenges, enhancements, and evolution. IEEE J. Sel. Areas Commun. 2013, 31, 399–408. [Google Scholar]
  10. Yang, Y.; Fei, D.; Dang, S. Inter-Vehicle Cooperation Channel Estimation for IEEE 802.11p V2I Communications. J. Commun. Netw. 2017, 19, 227–238. [Google Scholar] [CrossRef]
  11. Tonguz, O.K.; Zhang, R. Harnessing Vehicular Broadcast Communications: DSRC-Actuated Traffic Control. IEEE Trans. Int. Trans. Syst. 2020, 21, 509–520. [Google Scholar] [CrossRef]
  12. Bae, J.-K.; Park, M.-C.; Yang, E.-J.; Seo, D.-W. Implementation and Performance Evaluation for DSRC-Based Vehicular Communication System. IEEE Access 2021, 9, 6878–6887. [Google Scholar] [CrossRef]
  13. Wu, N.; Li, D.; Xi, Y. Distributed Weighted Balanced Control of Traffic Signals for Urban Traffic Congestion. IEEE Trans. Intell. Transp. Syst. 2019, 20, 3710–3720. [Google Scholar] [CrossRef]
  14. Ma, Q.; Zhang, S.; Qiao, Y.; Feng, M. Traffic Guidance Self-Organization Method for Neighbor Weaving Segments Based on Self-Organized Critical State. IEEE Access 2020, 8, 171784–171795. [Google Scholar] [CrossRef]
  15. Zhou, Z.; Lin, S.; Du, W.; Liang, H. Integration of Regional Demand Management and Signals Control for Urban Traffic Networks. IEEE Access 2019, 7, 20235–20248. [Google Scholar] [CrossRef]
  16. Wang, W.; Chen, J.-C.; Wu, Y.J.; Jim, Y. The Prediction of Freeway Traffic Conditions for Logistics Systems. IEEE Access 2019, 7, 138056–138061. [Google Scholar] [CrossRef]
  17. Zhang, Y.; Zhang, Y.; Su, R. Pedestrian-Safety-Aware Traffic Light Control Strategy for Urban Traffic Congestion Alleviation. IEEE Trans. Int. Trans. Syst. 2021, 22, 178–193. [Google Scholar] [CrossRef]
  18. León, J.P.A.; Rico-Novella, F.J.; Luis, J. Predictive Traffic Control and Differentiation on Smart Grid Neighborhood Area Networks. IEEE Access 2020, 8, 216805–216821. [Google Scholar] [CrossRef]
  19. Xu, C.; Xiong, Z.; Han, Z.; Zhao, G.; Yu, S. Link Reliability-Based Adaptive Routing for Multilevel Vehicular Networks. IEEE Trans. Veh. Technol. 2020, 69, 11771–11785. [Google Scholar] [CrossRef]
  20. Wang, Y.; Lin, Y.; Chen, L.; Shi, J. A Stackelberg Game-Based Caching Incentive Scheme for Roadside Units in VANETs. Sensors 2020, 20, 6625. [Google Scholar] [CrossRef] [PubMed]
  21. Osman, R.A.; Peng, X.-H.; Omar, M. Adaptive cooperative communications for enhancing qos in vehicular networks. Phys. Commun. 2019, 34, 285–294. [Google Scholar] [CrossRef] [Green Version]
  22. Osman, R.A.; Peng, X.-H. QoS-Ensured Cooperative Vehicular Communications. Int. J. Adv. Syst. Measu. 2018, 11, 83–92. [Google Scholar]
  23. Zhou, J.; Tian, D.; Wang, Y.; Sheng, Z.; Duan, X.; Leung, V.C. Reliability-Optimal Cooperative Communication and Computing in Connected Vehicle Systems. IEEE Trans. Mob. Comput. 2019, 19, 1216–1232. [Google Scholar] [CrossRef]
  24. Zhao, D.; Qin, H.; Song, B.; Zhang, Y.; Du, X.; Guizani, M. A Reinforcement Learning Method for Joint Mode Selection and Power Adaptation in the V2V Communication Network in 5G. IEEE Trans. Cogn. Commun. Netw. 2020, 6, 452–463. [Google Scholar] [CrossRef]
  25. Kim, T.; Park, Y.; Kim, H.; Hong, D. Cooperative Superposed Transmission in Cellular-Based V2V Systems. IEEE Trans. Veh. Technol. 2019, 68, 11888–11901. [Google Scholar] [CrossRef]
  26. Yang, F.; Han, J.-H.; Ding, X.; Wei, Z.; Bi, X. Spectral efficiency optimization and interference management for multi-hop D2D communications in VANETs. IEEE Trans. Veh. Technol. 2020, 69, 6422–6436. [Google Scholar] [CrossRef]
  27. Bonjorn, N.; Foukalas, F.; Cañellas, F.; Pop, P. Cooperative Resource Allocation and Scheduling for 5G eV2X Services. IEEE Access 2019, 7, 58212–58220. [Google Scholar] [CrossRef]
  28. Feteiha, M.F.; Ahmed, M.H. Multihop Best-Relay Selection for Vehicular Communication Over Highways Traffic. IEEE Trans. Veh. Technol. 2018, 67, 9845–9855. [Google Scholar] [CrossRef]
  29. Road Engineering Design Guidelines. In Lane Width Guideline; Transportation Services: Toronto, ON, Canada, 2017; pp. 1–11.
  30. CEDR. Safe Distance between Vehicles; CEDR: Santa Monica, CA, USA, 2010; pp. 1–9. [Google Scholar]
  31. Xu, Y. Quality of Service Provisions for Maritime Communications Based on Cellular Networks. IEEE Access 2017, 5, 23881–23890. [Google Scholar] [CrossRef]
  32. Ho, D.H.; Gulliver, A. Power Allocation in Cellular Networks Based on Outage Probability and Normalized SINR. IEEE Trans. Green Commun. Netw. 2020, 4, 783–793. [Google Scholar] [CrossRef]
  33. Zhang, S.; Zhang, H.; He, Q.; Bian, K.; Song, L. Joint Trajectory and Power Optimization for UAV Relay Networks. IEEE Commun. Lett. 2017, 22, 161–164. [Google Scholar] [CrossRef]
  34. Kim, M.; Lee, J. Impact of an Interfering Node on Unmanned Aerial Vehicle Communications. IEEE Trans. Veh. Technol. 2019, 68, 12150–12163. [Google Scholar] [CrossRef]
  35. Wang, S.; Wang, D.; Li, C.; Xu, W. Full Duplex AF and DF Relaying Under Channel Estimation Errors for V2V Communications. IEEE Access 2018, 6, 65321–65332. [Google Scholar] [CrossRef]
  36. Wang, Y.; Sheng, M.; Wang, X.; Wang, L.; Li, J. Mobile-Edge Computing: Partial Computation Offloading Using Dynamic Voltage Scaling. IEEE Trans. Commun. 2016, 64, 4268–4282. [Google Scholar] [CrossRef]
  37. Alkhalifa, I.S.; Almogren, A.S. NSSC: Novel Segment Based Safety Message Broadcasting in Cluster-Based Vehicular Sensor Network. IEEE Access 2020, 8, 34299–34312. [Google Scholar] [CrossRef]
  38. Liu, W.; He, X.; Huang, Z.; Ji, Y. Transmission Capacity Characterization in VANETs with Enhanced Distributed Channel Access. Electronics 2019, 8, 340. [Google Scholar] [CrossRef] [Green Version]
  39. Guo, C.; Liang, L.; Li, G.Y. Resource Allocation for Vehicular Communications With Low Latency and High Reliability. IEEE Trans. Wirel. Commun. 2019, 18, 3887–3902. [Google Scholar] [CrossRef]
  40. Khan, U.A.; Lee, S.S. Three-Dimensional Resource Allocation in D2D-Based V2V Communication. Electronics 2019, 8, 962. [Google Scholar] [CrossRef] [Green Version]
  41. Osman, R.A.; Peng, X.; Omar, M.A.; Gao, Q. Quality of service optimisation of device-to-device communications underlaying cellular networks. IET Commun. 2020, 15, 179–190. [Google Scholar] [CrossRef]
Figure 1. System model for emergency vehicle communications (a) before receiving the emergency message and (b) after receiving the emergency message.
Figure 1. System model for emergency vehicle communications (a) before receiving the emergency message and (b) after receiving the emergency message.
Sensors 21 05120 g001
Figure 2. The distance between the emergency vehicle and the receiving vehicle versus interference distance.
Figure 2. The distance between the emergency vehicle and the receiving vehicle versus interference distance.
Sensors 21 05120 g002
Figure 3. The distance between the emergency vehicle and the receiving vehicle versus interference transmission power.
Figure 3. The distance between the emergency vehicle and the receiving vehicle versus interference transmission power.
Sensors 21 05120 g003
Figure 4. The distance between the emergency vehicle and the receiving vehicle versus the emergency vehicle’s velocity.
Figure 4. The distance between the emergency vehicle and the receiving vehicle versus the emergency vehicle’s velocity.
Sensors 21 05120 g004
Figure 5. Packet delivery ratio [PDR] vs. number of vehicles.
Figure 5. Packet delivery ratio [PDR] vs. number of vehicles.
Sensors 21 05120 g005
Figure 6. Average end-to-end delay [E2E] versus the number of vehicles.
Figure 6. Average end-to-end delay [E2E] versus the number of vehicles.
Sensors 21 05120 g006
Figure 7. Packet delivery ratio versus the number of vehicles.
Figure 7. Packet delivery ratio versus the number of vehicles.
Sensors 21 05120 g007
Figure 8. Average end-to-end delay (E2E) versus the number of vehicles.
Figure 8. Average end-to-end delay (E2E) versus the number of vehicles.
Sensors 21 05120 g008
Figure 9. Emergency vehicle travel time versus emergency vehicle velocity.
Figure 9. Emergency vehicle travel time versus emergency vehicle velocity.
Sensors 21 05120 g009
Table 1. Simulation parameters.
Table 1. Simulation parameters.
ParametersValue
No−144 dBm
B10 MHz
Pvmax33 dBm
PD17 or 23 dBm
PC17 or 23 dBm
Packet size512 bytes
fc5.9 GHz
Simulation time1000 s
Number of vehicles100~300
Speed60 km/h
Traffic agentCBR
QueuePriQueue with a size of 50 packets
Propagation modeTwo-way model
AntennaOmni-directional with a height of 1 m
Routing ProtocolDSRC
Number of seeds3
NoiseAWGN
PLV2V127 + 30 log10(dVV)
PLCBS128.1 + 30 log10(dCBS)
PLD2D148 + 30 log10(dDD)
Table 2. Traffic and vehicle performance before and after receiving the emergency message.
Table 2. Traffic and vehicle performance before and after receiving the emergency message.
Vehicle Performance Before Receiving an Emergency MessageVehicle Performance after Receiving an Emergency Message
Vehicle Velocity (km/h)Number of Vehicles per 1 kmSafe Distance between Vehicles (m)Vehicle Velocity (km/h)Number of Vehicles per 1 kmSafe Distance between Vehicles (m)
3046.153816.6666710.982190.08076.1012
4036.734722.2222213.479080.07497.4883
5030.508527.77777815.696472.88518.7202
6026.087033.33333319.883865.778610.2025
7022.784838.88888922.322062.318811.0465
8020.224744.44444424.572957.467512.4011
9018.18185025.951753.614613.6516
10016.513855.55555628.430751.499714.4176
11015.126161.11111129.603748.088915.7948
12013.953566.666666729.914346.627716.4465
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Osman, R.A.; Zaki, A.I.; Abdelsalam, A.K. Novel Road Traffic Management Strategy for Rapid Clarification of the Emergency Vehicle Route Based on V2V Communications. Sensors 2021, 21, 5120. https://doi.org/10.3390/s21155120

AMA Style

Osman RA, Zaki AI, Abdelsalam AK. Novel Road Traffic Management Strategy for Rapid Clarification of the Emergency Vehicle Route Based on V2V Communications. Sensors. 2021; 21(15):5120. https://doi.org/10.3390/s21155120

Chicago/Turabian Style

Osman, Radwa Ahmed, Amira I. Zaki, and Ahmed Kadry Abdelsalam. 2021. "Novel Road Traffic Management Strategy for Rapid Clarification of the Emergency Vehicle Route Based on V2V Communications" Sensors 21, no. 15: 5120. https://doi.org/10.3390/s21155120

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop