# Context-Aware Multicast Protocol for Emergency Message Dissemination in Vehicular Networks

Authors: Alvin Sebastian; Maolin Tang; Yanming Feng; Mark Looi
Journal: International Journal of Vehicular Technology
 (2012)

---

## Abstract

Road traffic accidents can be reduced by providing early warning to drivers through wireless ad hoc networks. When a vehicle detects an event that may lead to an imminent accident, the vehicle disseminates emergency messages to alert other vehicles that may be endangered by the accident. In many existing broadcast-based dissemination schemes,
emergency messages may be sent to a large number of vehicles in the area and can be propagated to only one direction. This paper presents a more efficient context-aware multicast protocol that disseminates messages only to endangered vehicles that may be affected by the emergency event. The endangered vehicles can be identified by calculating the interaction among vehicles based on their motion properties. To ensure fast delivery, the dissemination follows a routing path obtained by computing a minimum delay tree. The multicast protocol uses a generalized approach that can support any arbitrary road topology. The performance of the multicast protocol is compared with existing broadcast protocols by simulating chain collision accidents on a typical highway. Simulation results show that the multicast protocol outperforms the other protocols in terms of reliability, efficiency, and latency.


---

## Body

## 1. Introduction

Vehicular ad hoc networks (VANETs) are wireless ad hoc networks operating in a vehicular environment that involves communication between vehicle-to-vehicle (V2V) and vehicle-to-roadside infrastructure (V2I). The deployment of VANET is feasible in the near future due to rapid advances in wireless communication technologies, particularly the IEEE 802.11 wireless LAN. The most potential technology that can provide robust and reliable V2V and V2I communication is most likely will be based on the IEEE 802.11p standard [1] and the IEEE 1609 Family of Standards for Wireless Access in Vehicular Environments (WAVE) [2]. VANETs enable the development of vehicular safety applications that can improve road safety significantly. The most prominent safety application that aims to reduce the number of traffic accidents is a cooperative collision warning system (CCWS). A CCWS works by having vehicles exchange safety messages using V2V communication to detect any possible collision and warn the drivers accordingly. Several concepts and prototypes of CCWSs have been proposed and developed [3–6], demonstrating the technical feasibility of CCWS.Several performance evaluations of the IEEE 802.11p standard indicate that the standard is able to achieve promising latency and reliability compared to safety application requirements [7–10]. However, the standard alone can not ensure time-critical message dissemination in dense road traffic conditions, such as in traffic jams. Dense traffic conditions imply a high communication channel load that can significantly deteriorate the communication performance. Therefore, it is necessary to develop application level protocols that use the communication channel more efficiently to ensure fast and reliable safety message dissemination in any traffic conditions.In designing the application level protocols for safety purposes, there are two fundamental types of messages that must be considered:Routine Safety Messages (RSMs) and Event Safety Messages (ESMs) [11]. RSMs, also known as beacons, are status update messages regularly sent by vehicles, so that every vehicle can realize the state of neighbor vehicles and warn the driver of any possible collision. ESMs, or emergency warning messages, are notification messages sent by a vehicle to warn other vehicles when certain endangering events occur. To improve the overall communication performance, it is important to have efficient communication protocols for both types of messages. However, this work particularly focuses on the problem of disseminating ESMs in a reliable, efficient, and timely manner.ESMs are especially useful to mitigate a multivehicle chain collision because they can propagate faster than visual indicators such as tail brake lights [12]. An example of safety applications designed to prevent such accidents by using ESMs is an Electronic Emergency Brake Light (EEBL) application [10, 13]. An EEBL application will trigger ESM dissemination if it detects a deceleration that exceeds a certain threshold. A vehicle that decelerates rapidly may endanger its following vehicles and therefore must send ESMs to other endangered vehicles in a timely manner with the highest priority. Upon receiving an ESM, any endangered vehicle informs its driver of the possible dangerous situation through on-board interfaces (audio, visual, etc.). Being made aware of the dangerous situation, the driver can perform an evasive action accordingly.Depending on the road traffic conditions, ESMs may need to be disseminated along a roadway beyond the coverage area of the original sender. There are many cases where a multivehicle collision involves a lot of vehicles. As an example, an accident in Germany in 2009 involved more than 200 vehicles on a 30 km stretch of road [14]. In such cases, the distance required to reach all the relevant vehicles far exceeds the reliable communication range of an IEEE 802.11p compliant radio, which is only 505 m at the maximum [15]. Therefore, multihop ESM dissemination is necessary in some situations to anticipate any possible collision.Existing multihop ESM dissemination protocols generally use a scoped-broadcast technique in which ESM dissemination is limited to a specific area and direction. They are not efficient as they may still send ESMs to vehicles that are not endangered and they cannot prioritize the receivers based on their critical time to avoid collision. In addition, they are designed to operate only in a specific road traffic situation, which is a straight road segment such as a highway, where only two directions are considered: forward or backward. This work presents a more efficient dissemination protocol that can disseminate ESMs to any directions as necessary. The protocol operates in the application layer, which makes it possible to utilize the contextual knowledge such as the state of neighboring vehicles [11].The original contribution of this work is a new context-aware multicast routing strategy that can disseminate ESMs efficiently. The objective is to reduce unnecessary transmissions and to deliver ESMs to endangered vehicles as fast as possible to prevent vehicle collisions. The multicast routing strategy combines a tree-based routing method with a contention-based method. The strategy uses context information processed from the states of neighboring vehicles that are obtained via RSMs. Using the context information, a multicast tree is generated by finding the most efficient routes from a sender node to all the receiver nodes. The problem of finding the multicast tree is formulated as a minimum delay tree problem, which can be solved using Dijkstra’s shortest path algorithm [16]. To the best of our knowledge, this multicast concept for an ESM protocol has never been proposed previously in the literature. The performance of the multicast protocol is evaluated by simulation and compared with existing broadcast protocols. The simulation results show that using the multicast protocol resulted in fewer vehicles collisions in some scenarios compared to the other protocols.The rest of this paper is organized as follows. Section2 presents an overview of relevant protocols that address the problem of multihop ESM dissemination. Section 3 introduces a multicast approach in optimizing the multihop ESM dissemination and proposes a new context-aware multicast protocol that can efficiently disseminate ESMs. Section 4 describes the performance evaluation of the proposed protocol and Section 5 analyzes the simulation result and the advantages of the proposed multicast protocol. Finally, Section 6 concludes this work and proposes future research direction.


## 2. Related Work

The ESM dissemination problem is related to routing problems in wireless networks. In general computer networks, there are three basic types of routing schemes: unicast, broadcast, and multicast. Unicast routing is used to deliver a message to a specified node. Broadcast routing is used to deliver a message to all nodes in the network. Multicast routing is used to deliver a message to a group of nodes that have expressed interest in receiving the message. In wireless networks with omnidirectional antennas, one-hop communication is inherently a broadcast at the physical level, and therefore using unicast, broadcast, or multicast routing for one-hop communication consumes the same network resources. However, for multihop communication, multicast routing is more efficient than plain broadcast routing.In VANET, existing routing schemes can be broadly categorized into general purpose and safety purpose routing. General purpose routing is used to disseminate any type of data such as traffic information or multimedia streams. In principle, it requires finding and establishing a route from a sender to a receiver, and using the established route to deliver the data, which may contain many messages. There are two basic approaches to finding the route: (1) areactive approach finds the route on-demand by broadcasting a hello message to all communication nodes (e.g., vehicles) at the time a message needs to be sent; (2) a proactive approach maintains up-to-date network information and uses the information to find the route when needed.Safety purpose routing is used to disseminate data important for road safety, such as ESMs. Safety purpose routing requires lower latency and higher reliability compared to general purpose routing. Existing safety purpose routing schemes use a similar approach to the reactive approach with one significant difference. Given the size of a safety message is relatively small, there is no need to find and establish the route before sending the actual message. Instead, they use a connection-less approach that broadcasts a safety message as a hello message itself. A comprehensive comparison of existing ad hoc routing protocols in vehicular environment shows that the connection-less approach is suitable for safety applications because its relatively low latency [17].The simplest method to disseminate an ESM in a multihop manner is by using a plain broadcast scheme such asflooding. In a flooding scheme, messages are disseminated to all nodes by having all the nodes retransmit or relay received messages. A flooding scheme is highly inefficient and may cause a broadcast storm problem [18]. A broadcast storm can overload the limited channel capacity, causing channel congestion that reduces communication reliability. Therefore, various scoped broadcast schemes that can improve the efficiency of multihop safety communication have been proposed in the literature. The scoped broadcast schemes use various techniques to limit the number of transmissions, reduce unnecessary transmissions, and improve reliability.Yang et al. [19] introduced the concept of an abnormal vehicle and the state transition mechanism to disseminate ESMs. A vehicle becomes an abnormal vehicle when an emergency event is happening to the vehicle itself or when the vehicle is reacting to other abnormal vehicles nearby. As long as a vehicle is marked as an abnormal vehicle, it repeatedly broadcasts the ESMs to increase the successful reception rate. Once an abnormal vehicle resumes its regular movement, the vehicle is no longer an abnormal vehicle and it returns back to its normal state. The dissemination method is not designed to propagate ESMs to all relevant vehicles as fast as possible. In addition, the broadcast repetition may result in unnecessary transmissions.There are several techniques commonly used in the literature to improve the efficiency of ESM dissemination. Most of them are based on an approach in which a vehicle that receives an ESM decides whether to forward, ignore, or use the received ESM. To reduce the number of retransmissions, the number of hops can be minimized by selecting the optimal forwarder. Implicit acknowledgment is another technique to limit the number of repetitions while ensuring reliability. The technique introduces a contention duration before rebroadcasting the same message. When a vehicle detects that the same message has been rebroadcast by another vehicle, it will abort the rebroadcast attempt.The methods used to select a relay and calculate the contention duration can be based on distance only [20–22], distance with a dedicated back-off procedure [27, 29], distance with a random contention window [23], distance with a probability factor [24], directions with a random duration [12], a combination of distance and directions [25], or a predefined area [26]. One of the position-based methods also considers the angle between vehicles [27]. Most of the ESM dissemination protocols in the literature do not consider the use of RSMs. They assume that the information about the receivers and their location is not available. In such a case, the scoped broadcast strategies are the most suitable option. Torrent-Moreno  et al. [28] proposed an ESM protocol that makes use of information obtained from the RSM. The protocol works by nominating a specific forwarder for every transmission to minimize the delay caused by the contention duration.One of the key techniques used by existing schemes is to limit the ESM dissemination into a specific area or direction. The intended receivers (i.e., the endangered vehicles) are assumed to be all the vehicles that are inside a region behind the sender [12, 19, 22, 23, 28, 29], behind the sender but moving in the same direction [27], within a specified message direction [25], or inside a predefined risk zone [20, 26]. All the aforementioned schemes are designed for a highway or straight road scenario and only consider two directions: forwards or backwards. Since interactions among vehicles are not considered, ESMs can be disseminated to irrelevant vehicles and vehicles cannot be prioritized based on their critical time to avoid a collision. Taha and Hasan [30] proposed a scheme that gives more priority to a vehicle in the most danger to become a relay node. The scheme does not reduce redundant transmissions to improve the dissemination efficiency. Priority is determined based on a time headway model, which is one of the car following models, implying that such a scheme can operate only in highways.In contrast to the prior works, this study is based on the idea of a multicast scheme in which an abnormal vehicle should send ESMs only to vehicles that are possibly endangered by the abnormal vehicle’s maneuver. This paper extends our previous work [31] with a different routing strategy, a new protocol description, and a complete performance evaluation that includes direct comparison with existing ESM protocols. The previous work addressed the problem of multicast routing with a dynamic transmission range while this work further investigates the special case of the problem in which the transmission range is static instead of dynamic.


## 3. Context-Aware Multicast Approach

### 3.1. Multihop ESM Dissemination

A vehicle that encounters an emergency situation becomes an abnormal vehicle. To reduce unnecessary transmissions, an abnormal vehicle should send the ESMs only to relevant vehicles instead of all vehicles. The relevant vehicles are vehicles that are endangered by the abnormal vehicle’s maneuver. In wireless communication, this strategy is useful only for multihop transmissions because a single-hop transmission using is basically a broadcast to all vehicles within the radio transmission range. However, to prevent multivehicle chain collisions, multihop transmissions are often needed to propagate ESMs along a roadway longer than a single vehicle’s transmission range.From the perspective of communication, the abnormal vehicle is the sender node and the relevant vehicles are the receiver nodes, which can be considered as a multicast group. For example, in a scenario shown in Figure1, assume that vehicle a performs a sudden movement at time t that endangers vehicles b, c, and g. Therefore, vehicle a sends ESMs to vehicles b, c, and g at time t. Vehicle a does not need to send the ESMs to vehicles d, f, and h because they are not in immediate danger. Although vehicle h is in the same lane as vehicle g, vehicle h may not be endangered if its speed is slower than vehicle g and the distance between them is large enough. A vehicle that is not in danger can receive and relay the ESMs. In this example, vehicle e is the relay node to forward the ESMs to vehicle c.Figure 1
Illustration of multihop routing for ESMs.This study assumes that a driver may or may not overreact to the alert given by a CCWS. Therefore, a vehicle that receives an ESM may react by braking abruptly (very high deceleration) or by braking sensibly (convenience deceleration) to achieve the safe distance from the leading vehicle. In a case when a receiving vehicle brakes abruptly, it will become another abnormal vehicle. To ensure safety, the new abnormal vehicle will send a new ESM to a new up-to-date set of endangered vehicles. In the previous example, vehicleg receives an ESM from vehicle a at time t. Vehicle g will start braking at time t'=t+tr, where tr is the driver’s reaction time. If vehicle g brakes abruptly, it becomes a new abnormal vehicle that triggers a new ESM dissemination. If, for example, vehicle h becomes endangered by the action of vehicle g at time t′, vehicle g will send a new ESM to vehicle h. If there are no endangered vehicles, vehicle g does not need to send a new ESM.An ESM is only useful if it is received within a certain time that allows a vehicle to brake and stop before crashing with its leading vehicle. In order to reduce the number of vehicle collisions, the relay node must be selected in such a way so that the end-to-end delay from the sender node to every receiver node is minimized. In a tree-based multicast routing, a sender computes a multicast tree that represents routing paths from the sender to every receiver. This study proposes the use of a minimum delay multicast tree to provide routing paths with the least end-to-end delay for ESM dissemination.


### 3.2. System Assumptions

The multicast approach is designed for a typical CCWS in which a vehicle can determine its own position on the road using a combination of a Differential Global Positioning System (DGPS) and internal motion sensors. Prior studies with field tests have indicated that current positioning technology can provide centimeter-level accuracy under good conditions [4, 5]. Other technologies such as a relative distributed ad hoc localization can provide relative positioning by measuring the signal strength of wireless communication devices [32, 33]. By using data fusion techniques [34, 35] that combine various localization techniques, it is reasonable to assume that a vehicle can obtain position coordinates relative to other vehicles with an accuracy suitable for safety purposes.In this work, we assume that every vehicle is equipped with a wireless communication device that implements the IEEE 802.11p/WAVE standards, which defines the protocols for PHY, MAC, and network layers. The radio transmission range provided by the device is determined by the transmission power. For practical purposes, our simulations assume a constant transmission power is used by all vehicles. However, the multicast approach is designed by considering that a vehicle may have a different transmission range than others. We also assume that the communication devices operate in ad hoc mode and there is no roadside infrastructure available.


### 3.3. Problem Definitions

The communication network is modeled as a weighted directed graphG=(V,E),   where V is a set of communication nodes representing the vehicles and E is a set of directed edges representing the communication links between the nodes. A directed edge e=〈u,v〉∈E if and only if node v can receive packets from node u, where u,v∈V and u≠v. A nonnegative real-valued function is associated with each node v∈V: δ(v):V→ℝ+, which represents the estimated one-hop delay for every packet relayed through node v. Let s∈V be the initial sender of an ESM, and let R⊆V-{s} be the set of receivers. Nodes belonging to  V∖(R∪{s}) may become relay nodes, that is, they are involved in forwarding the ESM, or they may remain isolated without receiving or transmitting any signal. A multicast tree T(s,R)=(VT,ET), where VT⊆V and ET⊆E, is a tree rooted at s connecting all receiver nodes in R.LetPT(s,r) be a unique path in the tree T from the sender node s to a receiver node r∈R. The set of nodes on the path PT(s,r) is defined as U(PT(s,r)). The total end-to-end delay from sender node s to node r∈R is defined as the sum of the delay of nodes in U(PT(s,r))∖{r}, that is,
(1)δ(PT(s,r))=∑v∈(U(PT(s,r))∖{r})δ(v).The maximum total end-to-end delay of the treeδ(PT(s,R)) is defined as
(2)δ(PT(s,R))=maxr∈Rδ(PT(s,r)).Based on the previous definition, the minimum delay multicast treeT(s,R) can be defined as a tree that has
(3)minδ(PT(s,R)).


### 3.4. Context Information

The minimum delay tree problem requires several input parameters and functions that depend directly or indirectly on the context information. Context information is defined as the road traffic and communication network situation perceived by the abnormal vehicle at the time an ESM needs to be sent. In particular, the context information includes the network topology, end-to-end communication delay, sender node, and receiver nodes. Each vehicle maintains its own context information which may or may not differ to other vehicles.A vehicle generates or updates the context information by processing the tracked state information of the neighboring vehicles. The state information is obtained by listening to the RSMs (beacons) periodically broadcast by other vehicles. An RSM contains a timestamp and a unique identifier (such as a MAC address), the most current motion properties (position, speed, heading, and deceleration capability), and the transmission power of the vehicle. Each time a vehiclev receives an RSM from vehicle u, vehicle v updates its knowledge about vehicle u, which includes the network topology, delay history, and other context information.Depending on the road traffic density and conditions, knowledge about up ton-hop neighboring vehicles may be needed. The number of hops n can be a predetermined constant or a variable dynamically set at real time. There are several existing techniques [22, 36] that can be used to obtain the knowledge of more than one-hop neighbors. To avoid flooding, the n-hop information is aggregated and piggybacked into an extended RSM [28, 37]. This study assumes the use of an existing multihop beaconing scheme [36] to provide up to 4-hop neighbor information, which approximately corresponds to a coverage of two kilometers in each direction on a highway. The scheme is able to efficiently disseminate RSMs over multiple hops by suppressing redundant retransmissions, multiplexing messages, and scheduling transmission times dynamically.


#### 3.4.1. Network Modeling

In a wireless networking environment, a receiver can successfully receive a message if the receiver is located within the sender’s coverage area. For simplicity, the coverage area is modeled as a planar circle where its radius is the transmission range of the sender, as illustrated in Figure2. The state of the network connections, represented by the network graph G, is estimated using the position and the maximum transmission range of each node. The maximum transmission range is the estimated communication range that can be achieved using the maximum transmission power.Figure 2
Illustration of the network modeling.Letduv=dvu be the distance between node u∈V and node v∈V, and Rutx and Rvtx be the maximum transmission range of node u and v, respectively. The distance between node u and node v with Cartesian coordinates (xu,yu) and (xv,yv), respectively, is
(4)duv=(xu-xv)2+(yu-yv)2.
There exists a communication link represented by directed edge 〈u,v〉∈E between node u and node v if duv≤Rutx, which means that node v can receive a message from node u. Given the set of nodes V, the set of edges E can be generated by enumerating all the pairs of nodes in V. Algorithm 1 describes the procedure to generate the network graph.Algorithm 1:Generating the network graph.
input: V—the set of nodes (vehicles)
duv; ∀u; v∈V—the distance between u and v
Rutx,∀u∈V—the maximum transmission range
output: E—the set of edges
(1)E⟵∅
(2)foreachpairofnodes (u; v) in Vdo
(3)ifduv≤RutxthenE⟵E∪{〈u,v〉}
(4)ifduv≤RvtxthenE⟵E∪{〈u,v〉}


#### 3.4.2. Estimating Communication Delay

The total end-to-end delayδ(PT(s,r)) defined in (1) is the sum of the delay at each node between the sender (inclusive) and the receiver (exclusive). It depends on the number of intermediary nodes between them and the delay experienced at each intermediary node (one-hop delay). To measure the one-hop delay, we use an estimation method adopted from existing work in MANET QoS routing [38]. The one-hop delay δ is estimated by measuring the value of actual delays experienced by the RSMs. All of the nodes are assumed to have synchronized clocks via the GPS. Each time an RSM is created, it is timestamped with the current creation time. When a node u receives an RSM from any other node v, node u calculates the one-hop delay δ(v) by subtracting the value of the timestamp from the received time. The measured one-hop delay mostly consists of the MAC queuing and transmission delay caused by the MAC protocol back-off mechanism. Note that the priority of RSMs is assumed to be lower than the priority of ESMs. Therefore, the actual delay experienced by an ESM is expected to be less than the estimated delay.


#### 3.4.3. Identifying the Sender Node

The sender node is an abnormal vehicle that initiates the ESM dissemination. There are two cases where a vehicle needs to send an ESM.(1)
A sudden change of vehicle state or unexpected circumstances experienced by the vehicle. A sudden change of vehicle state can be defined as a change in motion that exceeds a certain threshold, such as rapid deceleration or sudden change of direction. Unexpected circumstances are other dangerous factors that may cause an accident, such as engine breakdown, braking failure, or any other vehicle malfunction.(2)
An inevitable collision with any other vehicle based on the current state of vehicles. It is possible that a collision may happen without any sudden maneuver. For example, in a car following scenario, if the leading vehicle moves slower than the following vehicle, they will eventually collide. This kind of accident is most likely to be caused by inattentive drivers. In a case when a collision involves two or more vehicles, multiple abnormal vehicles may initiate the same ESM dissemination at the same time. To reduce redundant transmission, any abnormal vehicle must wait for a very short random time before sending a new ESM. If another ESM that describes the same event is received from another vehicle within the waiting period, the new ESM is discarded and will not be sent.


#### 3.4.4. Identifying Receiver Nodes

The receiver nodes are vehicles that will be endangered by the course of an abnormal vehicle or the sender node. To identify the receiver nodes, a sender needs to know the relevant or endangered vehicles based on the current road traffic situation. To determine the endangered vehicles, an abnormal vehicle generates or updates a vehicle interaction graph [39] at the time of the emergency event. The interaction graph represents the interaction between multiple vehicles in a specific region and at a point in time. It provides context information on how vehicles interact with each other.The interactions among multiple vehicles are modeled as a directed graph𝒢=(𝒱,ℰ), where 𝒱 is a set of nodes representing vehicles and ℰ⊆{〈vi,vj〉:vi,vj∈𝒱,vi≠vj},1≤i,j≤n is the set of directed edges representing interactions between vehicles. A directed edge 〈vi,vj〉∈ℰ represents an interaction between vi and vj, where vi influences or endangers vj. Each vehicle maintains its own interaction graph 𝒢 by defining the set of vertices 𝒱, which represents the neighboring vehicles, and the set of edges ℰ, which represents the interactions.In an ad hoc environment, each vehicle tracks the motion state of its neighbor vehicles via the exchange of RSMs. Given the set of neighboring vehicles𝒱 tracked by each vehicle, an interaction graph 𝒢 is constructed by generating the set of edges ℰ. Initially, each vehicle v creates a graph 𝒢=(𝒱,ℰ), where 𝒱={v} and ℰ=∅. Every time a vehicle v receives an RSM from other vehicle vi∈𝒱′, vehicle v updates its interaction graph 𝒢 by enumerating each vehicle vj∈𝒱, and calculating the interactions between vi and vj for each pair (vi,vj), i≠j based on the vehicle state information. Depending on the calculation result, an edge 〈vi,vj〉, 〈vj,vi〉, or both edges may be added to the set of edges ℰ.A vehicle interacts with other vehicle if there is a possibility of collision between them. A possible collision is determined by calculating a route contention between a pair of vehicles and an avoidance time based on their motion state such as position coordinates, speed, acceleration, deceleration, heading, and trajectory. The general principle is that there is no interaction defined as long as the driver has more than enough time to evade a collision.There are three distinct cases that need to be considered in order to determine whether there is any interaction between any pair of vehicles. The first case isfollowing, where both vehicles are traveling in the same direction. The second case is opposite, where both vehicles are traveling in the opposite direction. The third case is intersects, for any other conditions besides those previous two cases. The technical details on how to calculate the interaction between vehicles can be found in the paper [39].The interaction graph is responsible to model any possible road traffic scenarios, allowing us to design a generalized communication protocol. Given the interaction graph𝒢 and the sender node s, a set of receiver nodes R can be obtained by performing a breadth-first search (BFS) algorithm from s. As an example, Figure 3 shows a possible interaction graph that represents the traffic situation shown in Figure 1. An arrow from node a to node b means that b is endangered by a. Given the example interaction graph and node a as the sender (abnormal vehicle), the receivers (endangered vehicles) are identified as nodes b, c, and g by following the arrows from node a in the interaction graph.Figure 3
Example of an interaction graph given a traffic situation as shown in Figure1.


### 3.5. Context-Aware Multicast Protocol

A Context-aware multicast routing for ESM dissemination (CMED) protocol has been developed based on the minimum delay multicast tree. To deal with the inherent nature of unreliability in wireless transmission, the tree-based multicast strategy is complemented and combined with contention-based relaying and implicit acknowledgment strategies. The CMED protocol consists of three main procedures:SendInitialMessage, SendMessage, and ReceiveMessage. Algorithm 2 describes the pseudocode of the CMED protocol.Algorithm 2:Pseudo-code of the CMED protocol.
(1)procedureSendInitialMessage()
(2) Compute multicast treeT (s, R)
(3) Create a new ESMm and add T (s, R) to the header
(4)sentMessages⟵0
(5)SendMessage (m)
(6)procedureSendMessage (m)
(7) Transmitm using WSMP
(8)sentMessages⟵sentMessages + 1
(9)ifsentMessages < maxRepeatCountthen
(10)  ExecuteSendMessage (m) after waiting time of repeatInterval
(11)procedureReceiveMessage (m)
(12) Retrieve multicast treeT from the header of m
(13)ifTcontainsmyIdthen
(14)iffirsttimereceptionofthismessagethen
(15)ifreceivingvehicleisendangaredbythiseventthen
(16)    Warn driver to brake
(17)   MarkmessageId as received
(18)countMessages⟵0
(19)if  receiverisarelaynodethen
//Relaymessage
(20)SendMessage (m)
(21)else
(22)    Calculate contention timetc
(23)if
t>0 then
//Startcontention
(24)isContending = true
(25)       ExecuteSendMessage (m) after waiting time of tc
(26)else
//Thesamemessagemhasbeenreceivedpreviosly
(27)countMessages⟵countMessages + 1
(28)ifisContendingOR(countMessages ≥ maxMessages) then
(29)    Cancel contentionAn abnormal vehicle becomes a sender node which initiates the first ESM by invoking theSendInitialMessage procedure. In this procedure, a multicast tree is computed using Dijkstra’s shortest path algorithm [16]. The input values or parameters required by Dijkstra’s algorithm are obtained from the context information(1)
The sender nodes is the abnormal vehicle that can be determined using methods described in Section 3.4.3.(2)
The network graphG=(V,E) is generated using Algorithm 1.(3)
The receiver nodes are the endangered vehicles. The set of receiver nodesR is determined using the vehicle interaction graph, as detailed in Section 3.4.4.(4)
The delayδ(v) for each node v∈V, that can be obtained using a method described in Section 3.4.2. The output of the algorithm is the multicast tree T(s,R), which is used as the routing paths to disseminate the ESMs. Next, a new ESM is created and the tree T(s,R) is then encoded to the ESM. The ESM also contains an originId which is a unique identifier of the initial sender node (abnormal vehicle) and an eventId which is a unique identifier for each emergency event initiated by a node. The pair of originId and eventId represents a unique messageId which is used to identify a particular emergency event. After that, the SendMessage procedure is invoked to send the ESM.TheSendMessage procedure transmits a message using the WAVE Short Message Protocol (WSMP) as defined in the IEEE 1609.3 standard [40]. A node keeps track of the number of messages sent for each unique emergency event. To improve reliability, a sender will send the same message repeatedly with a constant interval of repeatInterval. The repetition is terminated if the same message is received from another node that belongs to the same multicast tree. In addition, a maximum number of repetitions is introduced to further reduce the channel load. The message will not be transmitted more than maxRepeatCount times.TheReceiveMessage procedure is invoked when a node receives an ESM. The multicast tree is first retrieved from the message and the receiving node checks if the tree contains the node’s unique identifier myId (such as a MAC address). The message will only be processed if the tree contains the receiver’s id. If the same message has been received previously, it is then considered as an implicit acknowledgment, and any scheduled transmission for the same message will be canceled. If the message is received for the first time, the received messageId is recorded and the driver will be alerted. If the receiver node is a relay node, as identified from the multicast tree, the node will relay the message immediately. It is possible that a designated relay node may not receive the ESM or may not receive it in time. To ensure reliability, a contention-based method similar to other protocols [27–29] is used. Another receiver node may relay the message as a substitute to a failed relay node. If the receiver node is not a relay node, it will schedule to send the message after a specific contention time, which will be canceled if it receives another message with the same messageId. The contention time is calculated based on its distance to the sender node:
(5)tc=maxContentionTime×(1-dsrdmax),
where maxContentionTime is a parameter of the maximum contention time, dsr is the distance between the sender and the receiver, and dmax is the approximate transmission range.


## 3.1. Multihop ESM Dissemination

A vehicle that encounters an emergency situation becomes an abnormal vehicle. To reduce unnecessary transmissions, an abnormal vehicle should send the ESMs only to relevant vehicles instead of all vehicles. The relevant vehicles are vehicles that are endangered by the abnormal vehicle’s maneuver. In wireless communication, this strategy is useful only for multihop transmissions because a single-hop transmission using is basically a broadcast to all vehicles within the radio transmission range. However, to prevent multivehicle chain collisions, multihop transmissions are often needed to propagate ESMs along a roadway longer than a single vehicle’s transmission range.From the perspective of communication, the abnormal vehicle is the sender node and the relevant vehicles are the receiver nodes, which can be considered as a multicast group. For example, in a scenario shown in Figure1, assume that vehicle a performs a sudden movement at time t that endangers vehicles b, c, and g. Therefore, vehicle a sends ESMs to vehicles b, c, and g at time t. Vehicle a does not need to send the ESMs to vehicles d, f, and h because they are not in immediate danger. Although vehicle h is in the same lane as vehicle g, vehicle h may not be endangered if its speed is slower than vehicle g and the distance between them is large enough. A vehicle that is not in danger can receive and relay the ESMs. In this example, vehicle e is the relay node to forward the ESMs to vehicle c.Figure 1
Illustration of multihop routing for ESMs.This study assumes that a driver may or may not overreact to the alert given by a CCWS. Therefore, a vehicle that receives an ESM may react by braking abruptly (very high deceleration) or by braking sensibly (convenience deceleration) to achieve the safe distance from the leading vehicle. In a case when a receiving vehicle brakes abruptly, it will become another abnormal vehicle. To ensure safety, the new abnormal vehicle will send a new ESM to a new up-to-date set of endangered vehicles. In the previous example, vehicleg receives an ESM from vehicle a at time t. Vehicle g will start braking at time t'=t+tr, where tr is the driver’s reaction time. If vehicle g brakes abruptly, it becomes a new abnormal vehicle that triggers a new ESM dissemination. If, for example, vehicle h becomes endangered by the action of vehicle g at time t′, vehicle g will send a new ESM to vehicle h. If there are no endangered vehicles, vehicle g does not need to send a new ESM.An ESM is only useful if it is received within a certain time that allows a vehicle to brake and stop before crashing with its leading vehicle. In order to reduce the number of vehicle collisions, the relay node must be selected in such a way so that the end-to-end delay from the sender node to every receiver node is minimized. In a tree-based multicast routing, a sender computes a multicast tree that represents routing paths from the sender to every receiver. This study proposes the use of a minimum delay multicast tree to provide routing paths with the least end-to-end delay for ESM dissemination.


## 3.2. System Assumptions

The multicast approach is designed for a typical CCWS in which a vehicle can determine its own position on the road using a combination of a Differential Global Positioning System (DGPS) and internal motion sensors. Prior studies with field tests have indicated that current positioning technology can provide centimeter-level accuracy under good conditions [4, 5]. Other technologies such as a relative distributed ad hoc localization can provide relative positioning by measuring the signal strength of wireless communication devices [32, 33]. By using data fusion techniques [34, 35] that combine various localization techniques, it is reasonable to assume that a vehicle can obtain position coordinates relative to other vehicles with an accuracy suitable for safety purposes.In this work, we assume that every vehicle is equipped with a wireless communication device that implements the IEEE 802.11p/WAVE standards, which defines the protocols for PHY, MAC, and network layers. The radio transmission range provided by the device is determined by the transmission power. For practical purposes, our simulations assume a constant transmission power is used by all vehicles. However, the multicast approach is designed by considering that a vehicle may have a different transmission range than others. We also assume that the communication devices operate in ad hoc mode and there is no roadside infrastructure available.


## 3.3. Problem Definitions

The communication network is modeled as a weighted directed graphG=(V,E),   where V is a set of communication nodes representing the vehicles and E is a set of directed edges representing the communication links between the nodes. A directed edge e=〈u,v〉∈E if and only if node v can receive packets from node u, where u,v∈V and u≠v. A nonnegative real-valued function is associated with each node v∈V: δ(v):V→ℝ+, which represents the estimated one-hop delay for every packet relayed through node v. Let s∈V be the initial sender of an ESM, and let R⊆V-{s} be the set of receivers. Nodes belonging to  V∖(R∪{s}) may become relay nodes, that is, they are involved in forwarding the ESM, or they may remain isolated without receiving or transmitting any signal. A multicast tree T(s,R)=(VT,ET), where VT⊆V and ET⊆E, is a tree rooted at s connecting all receiver nodes in R.LetPT(s,r) be a unique path in the tree T from the sender node s to a receiver node r∈R. The set of nodes on the path PT(s,r) is defined as U(PT(s,r)). The total end-to-end delay from sender node s to node r∈R is defined as the sum of the delay of nodes in U(PT(s,r))∖{r}, that is,
(1)δ(PT(s,r))=∑v∈(U(PT(s,r))∖{r})δ(v).The maximum total end-to-end delay of the treeδ(PT(s,R)) is defined as
(2)δ(PT(s,R))=maxr∈Rδ(PT(s,r)).Based on the previous definition, the minimum delay multicast treeT(s,R) can be defined as a tree that has
(3)minδ(PT(s,R)).


## 3.4. Context Information

The minimum delay tree problem requires several input parameters and functions that depend directly or indirectly on the context information. Context information is defined as the road traffic and communication network situation perceived by the abnormal vehicle at the time an ESM needs to be sent. In particular, the context information includes the network topology, end-to-end communication delay, sender node, and receiver nodes. Each vehicle maintains its own context information which may or may not differ to other vehicles.A vehicle generates or updates the context information by processing the tracked state information of the neighboring vehicles. The state information is obtained by listening to the RSMs (beacons) periodically broadcast by other vehicles. An RSM contains a timestamp and a unique identifier (such as a MAC address), the most current motion properties (position, speed, heading, and deceleration capability), and the transmission power of the vehicle. Each time a vehiclev receives an RSM from vehicle u, vehicle v updates its knowledge about vehicle u, which includes the network topology, delay history, and other context information.Depending on the road traffic density and conditions, knowledge about up ton-hop neighboring vehicles may be needed. The number of hops n can be a predetermined constant or a variable dynamically set at real time. There are several existing techniques [22, 36] that can be used to obtain the knowledge of more than one-hop neighbors. To avoid flooding, the n-hop information is aggregated and piggybacked into an extended RSM [28, 37]. This study assumes the use of an existing multihop beaconing scheme [36] to provide up to 4-hop neighbor information, which approximately corresponds to a coverage of two kilometers in each direction on a highway. The scheme is able to efficiently disseminate RSMs over multiple hops by suppressing redundant retransmissions, multiplexing messages, and scheduling transmission times dynamically.


### 3.4.1. Network Modeling

In a wireless networking environment, a receiver can successfully receive a message if the receiver is located within the sender’s coverage area. For simplicity, the coverage area is modeled as a planar circle where its radius is the transmission range of the sender, as illustrated in Figure2. The state of the network connections, represented by the network graph G, is estimated using the position and the maximum transmission range of each node. The maximum transmission range is the estimated communication range that can be achieved using the maximum transmission power.Figure 2
Illustration of the network modeling.Letduv=dvu be the distance between node u∈V and node v∈V, and Rutx and Rvtx be the maximum transmission range of node u and v, respectively. The distance between node u and node v with Cartesian coordinates (xu,yu) and (xv,yv), respectively, is
(4)duv=(xu-xv)2+(yu-yv)2.
There exists a communication link represented by directed edge 〈u,v〉∈E between node u and node v if duv≤Rutx, which means that node v can receive a message from node u. Given the set of nodes V, the set of edges E can be generated by enumerating all the pairs of nodes in V. Algorithm 1 describes the procedure to generate the network graph.Algorithm 1:Generating the network graph.
input: V—the set of nodes (vehicles)
duv; ∀u; v∈V—the distance between u and v
Rutx,∀u∈V—the maximum transmission range
output: E—the set of edges
(1)E⟵∅
(2)foreachpairofnodes (u; v) in Vdo
(3)ifduv≤RutxthenE⟵E∪{〈u,v〉}
(4)ifduv≤RvtxthenE⟵E∪{〈u,v〉}


### 3.4.2. Estimating Communication Delay

The total end-to-end delayδ(PT(s,r)) defined in (1) is the sum of the delay at each node between the sender (inclusive) and the receiver (exclusive). It depends on the number of intermediary nodes between them and the delay experienced at each intermediary node (one-hop delay). To measure the one-hop delay, we use an estimation method adopted from existing work in MANET QoS routing [38]. The one-hop delay δ is estimated by measuring the value of actual delays experienced by the RSMs. All of the nodes are assumed to have synchronized clocks via the GPS. Each time an RSM is created, it is timestamped with the current creation time. When a node u receives an RSM from any other node v, node u calculates the one-hop delay δ(v) by subtracting the value of the timestamp from the received time. The measured one-hop delay mostly consists of the MAC queuing and transmission delay caused by the MAC protocol back-off mechanism. Note that the priority of RSMs is assumed to be lower than the priority of ESMs. Therefore, the actual delay experienced by an ESM is expected to be less than the estimated delay.


### 3.4.3. Identifying the Sender Node

The sender node is an abnormal vehicle that initiates the ESM dissemination. There are two cases where a vehicle needs to send an ESM.(1)
A sudden change of vehicle state or unexpected circumstances experienced by the vehicle. A sudden change of vehicle state can be defined as a change in motion that exceeds a certain threshold, such as rapid deceleration or sudden change of direction. Unexpected circumstances are other dangerous factors that may cause an accident, such as engine breakdown, braking failure, or any other vehicle malfunction.(2)
An inevitable collision with any other vehicle based on the current state of vehicles. It is possible that a collision may happen without any sudden maneuver. For example, in a car following scenario, if the leading vehicle moves slower than the following vehicle, they will eventually collide. This kind of accident is most likely to be caused by inattentive drivers. In a case when a collision involves two or more vehicles, multiple abnormal vehicles may initiate the same ESM dissemination at the same time. To reduce redundant transmission, any abnormal vehicle must wait for a very short random time before sending a new ESM. If another ESM that describes the same event is received from another vehicle within the waiting period, the new ESM is discarded and will not be sent.


### 3.4.4. Identifying Receiver Nodes

The receiver nodes are vehicles that will be endangered by the course of an abnormal vehicle or the sender node. To identify the receiver nodes, a sender needs to know the relevant or endangered vehicles based on the current road traffic situation. To determine the endangered vehicles, an abnormal vehicle generates or updates a vehicle interaction graph [39] at the time of the emergency event. The interaction graph represents the interaction between multiple vehicles in a specific region and at a point in time. It provides context information on how vehicles interact with each other.The interactions among multiple vehicles are modeled as a directed graph𝒢=(𝒱,ℰ), where 𝒱 is a set of nodes representing vehicles and ℰ⊆{〈vi,vj〉:vi,vj∈𝒱,vi≠vj},1≤i,j≤n is the set of directed edges representing interactions between vehicles. A directed edge 〈vi,vj〉∈ℰ represents an interaction between vi and vj, where vi influences or endangers vj. Each vehicle maintains its own interaction graph 𝒢 by defining the set of vertices 𝒱, which represents the neighboring vehicles, and the set of edges ℰ, which represents the interactions.In an ad hoc environment, each vehicle tracks the motion state of its neighbor vehicles via the exchange of RSMs. Given the set of neighboring vehicles𝒱 tracked by each vehicle, an interaction graph 𝒢 is constructed by generating the set of edges ℰ. Initially, each vehicle v creates a graph 𝒢=(𝒱,ℰ), where 𝒱={v} and ℰ=∅. Every time a vehicle v receives an RSM from other vehicle vi∈𝒱′, vehicle v updates its interaction graph 𝒢 by enumerating each vehicle vj∈𝒱, and calculating the interactions between vi and vj for each pair (vi,vj), i≠j based on the vehicle state information. Depending on the calculation result, an edge 〈vi,vj〉, 〈vj,vi〉, or both edges may be added to the set of edges ℰ.A vehicle interacts with other vehicle if there is a possibility of collision between them. A possible collision is determined by calculating a route contention between a pair of vehicles and an avoidance time based on their motion state such as position coordinates, speed, acceleration, deceleration, heading, and trajectory. The general principle is that there is no interaction defined as long as the driver has more than enough time to evade a collision.There are three distinct cases that need to be considered in order to determine whether there is any interaction between any pair of vehicles. The first case isfollowing, where both vehicles are traveling in the same direction. The second case is opposite, where both vehicles are traveling in the opposite direction. The third case is intersects, for any other conditions besides those previous two cases. The technical details on how to calculate the interaction between vehicles can be found in the paper [39].The interaction graph is responsible to model any possible road traffic scenarios, allowing us to design a generalized communication protocol. Given the interaction graph𝒢 and the sender node s, a set of receiver nodes R can be obtained by performing a breadth-first search (BFS) algorithm from s. As an example, Figure 3 shows a possible interaction graph that represents the traffic situation shown in Figure 1. An arrow from node a to node b means that b is endangered by a. Given the example interaction graph and node a as the sender (abnormal vehicle), the receivers (endangered vehicles) are identified as nodes b, c, and g by following the arrows from node a in the interaction graph.Figure 3
Example of an interaction graph given a traffic situation as shown in Figure1.


## 3.4.1. Network Modeling

In a wireless networking environment, a receiver can successfully receive a message if the receiver is located within the sender’s coverage area. For simplicity, the coverage area is modeled as a planar circle where its radius is the transmission range of the sender, as illustrated in Figure2. The state of the network connections, represented by the network graph G, is estimated using the position and the maximum transmission range of each node. The maximum transmission range is the estimated communication range that can be achieved using the maximum transmission power.Figure 2
Illustration of the network modeling.Letduv=dvu be the distance between node u∈V and node v∈V, and Rutx and Rvtx be the maximum transmission range of node u and v, respectively. The distance between node u and node v with Cartesian coordinates (xu,yu) and (xv,yv), respectively, is
(4)duv=(xu-xv)2+(yu-yv)2.
There exists a communication link represented by directed edge 〈u,v〉∈E between node u and node v if duv≤Rutx, which means that node v can receive a message from node u. Given the set of nodes V, the set of edges E can be generated by enumerating all the pairs of nodes in V. Algorithm 1 describes the procedure to generate the network graph.Algorithm 1:Generating the network graph.
input: V—the set of nodes (vehicles)
duv; ∀u; v∈V—the distance between u and v
Rutx,∀u∈V—the maximum transmission range
output: E—the set of edges
(1)E⟵∅
(2)foreachpairofnodes (u; v) in Vdo
(3)ifduv≤RutxthenE⟵E∪{〈u,v〉}
(4)ifduv≤RvtxthenE⟵E∪{〈u,v〉}


## 3.4.2. Estimating Communication Delay

The total end-to-end delayδ(PT(s,r)) defined in (1) is the sum of the delay at each node between the sender (inclusive) and the receiver (exclusive). It depends on the number of intermediary nodes between them and the delay experienced at each intermediary node (one-hop delay). To measure the one-hop delay, we use an estimation method adopted from existing work in MANET QoS routing [38]. The one-hop delay δ is estimated by measuring the value of actual delays experienced by the RSMs. All of the nodes are assumed to have synchronized clocks via the GPS. Each time an RSM is created, it is timestamped with the current creation time. When a node u receives an RSM from any other node v, node u calculates the one-hop delay δ(v) by subtracting the value of the timestamp from the received time. The measured one-hop delay mostly consists of the MAC queuing and transmission delay caused by the MAC protocol back-off mechanism. Note that the priority of RSMs is assumed to be lower than the priority of ESMs. Therefore, the actual delay experienced by an ESM is expected to be less than the estimated delay.


## 3.4.3. Identifying the Sender Node

The sender node is an abnormal vehicle that initiates the ESM dissemination. There are two cases where a vehicle needs to send an ESM.(1)
A sudden change of vehicle state or unexpected circumstances experienced by the vehicle. A sudden change of vehicle state can be defined as a change in motion that exceeds a certain threshold, such as rapid deceleration or sudden change of direction. Unexpected circumstances are other dangerous factors that may cause an accident, such as engine breakdown, braking failure, or any other vehicle malfunction.(2)
An inevitable collision with any other vehicle based on the current state of vehicles. It is possible that a collision may happen without any sudden maneuver. For example, in a car following scenario, if the leading vehicle moves slower than the following vehicle, they will eventually collide. This kind of accident is most likely to be caused by inattentive drivers. In a case when a collision involves two or more vehicles, multiple abnormal vehicles may initiate the same ESM dissemination at the same time. To reduce redundant transmission, any abnormal vehicle must wait for a very short random time before sending a new ESM. If another ESM that describes the same event is received from another vehicle within the waiting period, the new ESM is discarded and will not be sent.


## 3.4.4. Identifying Receiver Nodes

The receiver nodes are vehicles that will be endangered by the course of an abnormal vehicle or the sender node. To identify the receiver nodes, a sender needs to know the relevant or endangered vehicles based on the current road traffic situation. To determine the endangered vehicles, an abnormal vehicle generates or updates a vehicle interaction graph [39] at the time of the emergency event. The interaction graph represents the interaction between multiple vehicles in a specific region and at a point in time. It provides context information on how vehicles interact with each other.The interactions among multiple vehicles are modeled as a directed graph𝒢=(𝒱,ℰ), where 𝒱 is a set of nodes representing vehicles and ℰ⊆{〈vi,vj〉:vi,vj∈𝒱,vi≠vj},1≤i,j≤n is the set of directed edges representing interactions between vehicles. A directed edge 〈vi,vj〉∈ℰ represents an interaction between vi and vj, where vi influences or endangers vj. Each vehicle maintains its own interaction graph 𝒢 by defining the set of vertices 𝒱, which represents the neighboring vehicles, and the set of edges ℰ, which represents the interactions.In an ad hoc environment, each vehicle tracks the motion state of its neighbor vehicles via the exchange of RSMs. Given the set of neighboring vehicles𝒱 tracked by each vehicle, an interaction graph 𝒢 is constructed by generating the set of edges ℰ. Initially, each vehicle v creates a graph 𝒢=(𝒱,ℰ), where 𝒱={v} and ℰ=∅. Every time a vehicle v receives an RSM from other vehicle vi∈𝒱′, vehicle v updates its interaction graph 𝒢 by enumerating each vehicle vj∈𝒱, and calculating the interactions between vi and vj for each pair (vi,vj), i≠j based on the vehicle state information. Depending on the calculation result, an edge 〈vi,vj〉, 〈vj,vi〉, or both edges may be added to the set of edges ℰ.A vehicle interacts with other vehicle if there is a possibility of collision between them. A possible collision is determined by calculating a route contention between a pair of vehicles and an avoidance time based on their motion state such as position coordinates, speed, acceleration, deceleration, heading, and trajectory. The general principle is that there is no interaction defined as long as the driver has more than enough time to evade a collision.There are three distinct cases that need to be considered in order to determine whether there is any interaction between any pair of vehicles. The first case isfollowing, where both vehicles are traveling in the same direction. The second case is opposite, where both vehicles are traveling in the opposite direction. The third case is intersects, for any other conditions besides those previous two cases. The technical details on how to calculate the interaction between vehicles can be found in the paper [39].The interaction graph is responsible to model any possible road traffic scenarios, allowing us to design a generalized communication protocol. Given the interaction graph𝒢 and the sender node s, a set of receiver nodes R can be obtained by performing a breadth-first search (BFS) algorithm from s. As an example, Figure 3 shows a possible interaction graph that represents the traffic situation shown in Figure 1. An arrow from node a to node b means that b is endangered by a. Given the example interaction graph and node a as the sender (abnormal vehicle), the receivers (endangered vehicles) are identified as nodes b, c, and g by following the arrows from node a in the interaction graph.Figure 3
Example of an interaction graph given a traffic situation as shown in Figure1.


## 3.5. Context-Aware Multicast Protocol

A Context-aware multicast routing for ESM dissemination (CMED) protocol has been developed based on the minimum delay multicast tree. To deal with the inherent nature of unreliability in wireless transmission, the tree-based multicast strategy is complemented and combined with contention-based relaying and implicit acknowledgment strategies. The CMED protocol consists of three main procedures:SendInitialMessage, SendMessage, and ReceiveMessage. Algorithm 2 describes the pseudocode of the CMED protocol.Algorithm 2:Pseudo-code of the CMED protocol.
(1)procedureSendInitialMessage()
(2) Compute multicast treeT (s, R)
(3) Create a new ESMm and add T (s, R) to the header
(4)sentMessages⟵0
(5)SendMessage (m)
(6)procedureSendMessage (m)
(7) Transmitm using WSMP
(8)sentMessages⟵sentMessages + 1
(9)ifsentMessages < maxRepeatCountthen
(10)  ExecuteSendMessage (m) after waiting time of repeatInterval
(11)procedureReceiveMessage (m)
(12) Retrieve multicast treeT from the header of m
(13)ifTcontainsmyIdthen
(14)iffirsttimereceptionofthismessagethen
(15)ifreceivingvehicleisendangaredbythiseventthen
(16)    Warn driver to brake
(17)   MarkmessageId as received
(18)countMessages⟵0
(19)if  receiverisarelaynodethen
//Relaymessage
(20)SendMessage (m)
(21)else
(22)    Calculate contention timetc
(23)if
t>0 then
//Startcontention
(24)isContending = true
(25)       ExecuteSendMessage (m) after waiting time of tc
(26)else
//Thesamemessagemhasbeenreceivedpreviosly
(27)countMessages⟵countMessages + 1
(28)ifisContendingOR(countMessages ≥ maxMessages) then
(29)    Cancel contentionAn abnormal vehicle becomes a sender node which initiates the first ESM by invoking theSendInitialMessage procedure. In this procedure, a multicast tree is computed using Dijkstra’s shortest path algorithm [16]. The input values or parameters required by Dijkstra’s algorithm are obtained from the context information(1)
The sender nodes is the abnormal vehicle that can be determined using methods described in Section 3.4.3.(2)
The network graphG=(V,E) is generated using Algorithm 1.(3)
The receiver nodes are the endangered vehicles. The set of receiver nodesR is determined using the vehicle interaction graph, as detailed in Section 3.4.4.(4)
The delayδ(v) for each node v∈V, that can be obtained using a method described in Section 3.4.2. The output of the algorithm is the multicast tree T(s,R), which is used as the routing paths to disseminate the ESMs. Next, a new ESM is created and the tree T(s,R) is then encoded to the ESM. The ESM also contains an originId which is a unique identifier of the initial sender node (abnormal vehicle) and an eventId which is a unique identifier for each emergency event initiated by a node. The pair of originId and eventId represents a unique messageId which is used to identify a particular emergency event. After that, the SendMessage procedure is invoked to send the ESM.TheSendMessage procedure transmits a message using the WAVE Short Message Protocol (WSMP) as defined in the IEEE 1609.3 standard [40]. A node keeps track of the number of messages sent for each unique emergency event. To improve reliability, a sender will send the same message repeatedly with a constant interval of repeatInterval. The repetition is terminated if the same message is received from another node that belongs to the same multicast tree. In addition, a maximum number of repetitions is introduced to further reduce the channel load. The message will not be transmitted more than maxRepeatCount times.TheReceiveMessage procedure is invoked when a node receives an ESM. The multicast tree is first retrieved from the message and the receiving node checks if the tree contains the node’s unique identifier myId (such as a MAC address). The message will only be processed if the tree contains the receiver’s id. If the same message has been received previously, it is then considered as an implicit acknowledgment, and any scheduled transmission for the same message will be canceled. If the message is received for the first time, the received messageId is recorded and the driver will be alerted. If the receiver node is a relay node, as identified from the multicast tree, the node will relay the message immediately. It is possible that a designated relay node may not receive the ESM or may not receive it in time. To ensure reliability, a contention-based method similar to other protocols [27–29] is used. Another receiver node may relay the message as a substitute to a failed relay node. If the receiver node is not a relay node, it will schedule to send the message after a specific contention time, which will be canceled if it receives another message with the same messageId. The contention time is calculated based on its distance to the sender node:
(5)tc=maxContentionTime×(1-dsrdmax),
where maxContentionTime is a parameter of the maximum contention time, dsr is the distance between the sender and the receiver, and dmax is the approximate transmission range.


## 4. Performance Evaluation

The performance of the CMED protocol was evaluated by simulation. The simulation was implemented in the network simulator ns-3 (version 3.8) [41]. The performance of the CMED protocol was compared with the following ESM protocols.(1)
Intelligent Broadcast with Implicit Acknowledgment (IBIA) protocol [12]: this protocol represents a simple approach to ESM dissemination in which the rebroadcasting strategy is based on random contention and vehicle direction.(2)
Emergency Message Dissemination for Vehicular environment (EMDV) protocol [28]: this protocol employs a distance-based contention strategy complemented with the selection of a next hop forwarder made at transmission time to minimize the delay. All of the protocols were implemented as higher layer protocols that directly interface with the MAC layer protocol in ns-3.


### 4.1. Performance Metrics

The performance is measured in terms of the safety and communication issues. A protocol is better in terms of safety if using the protocol results in the smallest number of vehicle collisions. The communication issues involve the metrics of dissemination latency (or delay) and number of sent messages. The maximum dissemination latency is the time required to disseminate an ESM to all of the intended receivers. A lower dissemination time gives a better chance for a vehicle to avoid a collision. The number of sent messages reflects the efficiency of the protocol. A smaller number of sent messages indicates a more efficient protocol.Vehicle collisions are mainly caused by vehicles that do not receive the ESM in time or do not receive the ESM at all. This means that safety performance is mostly influenced by the dissemination latency and the reliability of the communications. The reliability of a protocol is indirectly measured from the number of vehicle collisions. As a reference, the evaluation includes the results from a theoretical optimal protocol in which ESMs can be disseminated to all relevant vehicles with zero delay or latency.In order to measure those metrics, a vehicle-following logic similar to the work proposed by Biswas et al. [12] has been developed. This was done by extending the ns-3 mobility model and developing a highway scenario module that can simulate road accidents, particularly a chain or multiple collisions on a highway. A chain collision situation is started by triggering an emergency event, in which a vehicle is forced to rapidly decelerate at 8 m/s2. Such a vehicle becomes an abnormal vehicle. The high deceleration rate models an unexpected collision scenario in which a vehicle can stop within a short distance. Immediately after decelerating, the abnormal vehicle will start sending the ESMs. A vehicle that receives an ESM will start braking with a normal deceleration of 4.9 m/s2 after a 1.5 s reaction time. A vehicle is not allowed to change lanes. Existing protocols for ESM dissemination were designed specifically for highway scenarios. Therefore, highway scenarios are chosen to allow a direct comparison with existing protocols.


### 4.2. Simulation Design and Setup

To provide a fair comparison, the simulation parameters and environment are configured to match the ones used by the authors of IBIA and EMDV [12, 28] as closely as possible. In the simulation, all vehicles are equipped with a CCWS. Each vehicle generates RSMs (beacon messages) at a rate of 10 messages per second. Before sending the first RSM, each vehicle calculates a random number from 0 to 100 ms, and uses that number as the time to send the first RSM. The next RSM is then scheduled to be sent periodically every 100 ms. The message size of both ESMs and RSMs is set to 500 bytes, including the application protocol specific headers. A constant message size is used to provide a consistent comparison result. The transmission power is configured to 19 dBm, which corresponds to 1000 m transmission range with around 20% message reception probability and 500 m transmission range with 90% message reception probability. The probabilistic Nakagami distribution is selected as the radio propagation loss model [28]. Real-world tests on highways showed that the Nakagami distribution is suitable to model the radio propagation in highway scenarios. The parameter of m=1 is set to simulate severe fading conditions, therefore, demonstrating the protocols’ performance in the worst case scenario.The lower layer protocol (PHY and MAC) parameters are set according to the IEEE 802.11p standard [1], which operates at 5.9 GHz on a 10 MHz control channel (CCH). The PHY data rate is configured to 6 Mbps, which is the optimal value for safety communication [42]. The channel switching scheme is currently not implemented, which means the whole 10 MHz CCH bandwidth can be used by the CCWS application. The MAC layer is configured to ad hoc mode with QoS support using the EDCA mechanism as described in IEEE 802.11e. The priority for ESMs is set to AC_VO (highest), and the priority for RSMs is set to AC_VI (second highest). Both the ESM and RSM protocols are simulated as extensions to the IEEE 1609 WAVE Short Message Protocol (WSMP) [40]. They are directly implemented on top of the MAC layer.The common configuration details related to lower layer protocols are summarized in Table1. The specific parameters to the IBIA and EMDV protocols are configured by following the given value in the original paper. A minor modification is made to the IBIA protocol by setting a maximum number of repetitions. The specific parameters for the IBIA, EMDV, and CMED protocols are detailed in Table 2.Table 1
Common configuration parameters.
Parameter
Value
PHY and MAC protocol
802.11p
802.11p data rate
6 Mbps
Propagation loss model 1
Three-log distance
Propagation loss model 2
Nakagamim=1
Transmission power
19 dBm
Safety message size
500 bytes
RSM generation rate
10 packets/s
Priority level:
ESM
AC_VO
RSM
AC_VITable 2
Specific protocol parameters.
Parameter
Value
IBIAmessagePeriod
100 ms
IBIArandomWaitTime
(0–10) ms
IBIAmaxRepeatCount
10
EMDVdisseminationAreaLength
2000 m
EMDVforwardingRange
500 m
EMDVmaxMessages
3
EMDVmaxContentionTime
100 ms
EMDVmaxChannelAccessTime
10 ms
CMEDmaxContentionTime
10 ms
CMEDdmax
500 m
CMEDmaxRepeatCount
10
CMEDrepeatInterval
100 ms
CMEDmaxMessages
3The ESM protocol was evaluated in two typical cases of highway scenarios. The first case is a simple highway scenario that represents a typical road traffic scenario with relatively low communication traffic. The second case represents a typical road traffic scenario with high communication traffic density. In the second case, the distance between vehicles is randomized at each simulation run to test how the protocols perform in different highway traffic situations. Table3 provides the common parameters that are used in all scenarios.Table 3
Common parameters for the highway scenario.
Parameter
Value
Driver's reaction time
1.5 s
Vehicle length
4 m
Vehicle speed
32 m/s
Vehicle emergency deceleration
8.0 m/s2
Vehicle normal deceleration
4.9 m/s2


#### 4.2.1. Simple Highway Scenario

This scenario models a single lane highway withn vehicles moving in the same direction with the same speed, similar to the scenario used to evaluate the IBIA protocol [12]. The platoon was formed with uniform intervehicle spacing s, as illustrated in Figure 4(a). To demonstrate the protocols’ performance with different vehicle densities, the simulation is conducted with different numbers of vehicles n ranging from 40 to 200. The distance between the vehicles at the first (v0) and last (vn) positions is fixed to 2000 meters, so a higher number of vehicles would mean a shorter intervehicle spacing. An emergency event was initiated by the abnormal vehicle at the front of the platoon (v0). Without a CCWS, all of the vehicles behind vehicle v0 would be involved in chain collisions. This scenario is useful to evaluate the performance of ESM protocols in a low-density environment with deterministic node topology and mobility. Each simulation was repeated 100 times with a random seed for each run to obtain a statistically significant result. Table 4 indicates the specific parameters used in this scenario.Table 4
Parameters specific to the simple highway scenario.
Parameter
Value
Highway length
2000 m
Number of vehicles
(40–200)
Number of abnormal vehicles
1
Number of lanes
1
Intervehicle spacing
(10–50) mIllustration of highway scenarios used in the simulation.
(a)
Simple highway scenario
(b)
Random highway scenario


#### 4.2.2. Random Highway Scenario

This scenario models a multilane bidirectional highway environment. Figure4(b) illustrates this scenario. The highway consists of 6 lanes with 3 lanes for each direction. The total number of vehicles is 600, and each lane contains 100 vehicles. The starting distance between vehicles was randomized for every simulation run, with a value between 9 and  50 m. N number of abnormal vehicles (initial sender) were randomly selected, which means N emergency events were initiated in the course of the simulation. Those events were triggered consecutively with a 1 ms interval. Experiments are conducted for different values of N ranging from 1 to 6. Each time, the simulation is repeated with a random seed 100 times to obtain a statistically significant result. Table 5 indicates the specific parameters used in this scenario.Table 5
Parameters specific to the random highway scenario.
Parameter
Value
Number of vehicles
600
Number of abnormal vehicles
(1–6)
Number of lanes
6
Inter-vehicle spacing
(9–50) m


### 4.3. Simulation Results

#### 4.3.1.  Simple Highway Scenario

From 100 simulation runs, the average of maximum dissemination latency for scenarios of 40 to 200 vehicles is calculated and plotted in Figure5. The result shows that a higher number of vehicles (higher density) leads to a higher latency. In all of the cases, the CMED protocol can deliver ESMs faster than the IBIA and EMDV protocols. In terms of efficiency, the number of sent messages is plotted in Figure 6. It shows that the number of sent messages for the CMED protocol is just slightly lower than for the EMDV protocol. Both the CMED and EMDV protocols send significantly fewer messages compared to the IBIA protocol. In this scenario, all of the protocols can achieve an optimal number of vehicle collisions in most cases. Table 6 shows that there is no significant difference in the numbers of collisions resulting from this scenario between the three protocols. For example, in a case with 200 vehicles, the total number of collisions averaged from 100 simulation instances was 15.97 for IBIA, 14.14 for EMDV, and 14.11 for CMED. As a reference, the smallest number of collisions that can be achieved is 14. The higher number of collisions for IBIA means that in some instances of the simulation, the protocol has failed to ensure 100% message delivery to all endangered vehicles.Table 6
Number of vehicle collisions in the simple highway scenario.
Number of vehicles
40
60
80
100
120
140
160
180
200
IBIA
1.2
3.24
4.03
5.38
6.7
9.25
11.52
13.49
15.97
EMDV
1.03
3
4
5
6.21
8
10.01
12.01
14.14
CMED
1
3
4
5
6.21
8.01
10
12.01
14.11Figure 5
Average of maximum dissemination latency in the simple highway scenario.Figure 6
Total number of ESMs sent by all vehicles in the simple highway scenario.


#### 4.3.2. Random Highway Scenario

Each simulation instance produces a unique highway scenario that results in different number of vehicle collisions for each run. The lowest possible number of collisions for each unique scenario, which is the optimal result, is obtained by simulating a dummy protocol that can transmit ESMs to all relevant vehicles instantaneously just after an emergency event occurred. The resulting number of vehicle collisions for the other protocols was normalized to the optimal result in order to clearly show the differences between the evaluated protocols.Figure7 shows the number of excess vehicle collisions for different numbers of concurrent events (from 1 to 6). When there are more than one concurrent events, the CMED protocol delivers a lower number of collisions compared to both the IBIA and EMDV protocols. Given only one concurrent event, the CMED protocol delivers an equal number of collisions to the EMDV protocol, but lower than for the IBIA protocol.Figure 7
Number of excess vehicle collisions (normalized to the optimal results)  from 100 instances of the random highway scenario.The number of sent messages for the CMED protocol is the lowest for all of the cases, as shown in Figure8. The overall number was obtained by adding up the number of messages sent by all vehicles from 100 simulation instances.Figure 8
Total number of ESMs sent by all vehicles from 100 instances of the random highway scenario.Figure9 shows the maximum dissemination time required for an ESM to reach all relevant vehicles. The maximum dissemination time was averaged from 100 simulation instances. It shows that, generally, the CMED protocol is always able to disseminate the ESMs faster than either the IBIA and EMDV protocols.Figure 9
Maximum dissemination latency averaged from 100 instances of the random highway scenario.


## 4.1. Performance Metrics

The performance is measured in terms of the safety and communication issues. A protocol is better in terms of safety if using the protocol results in the smallest number of vehicle collisions. The communication issues involve the metrics of dissemination latency (or delay) and number of sent messages. The maximum dissemination latency is the time required to disseminate an ESM to all of the intended receivers. A lower dissemination time gives a better chance for a vehicle to avoid a collision. The number of sent messages reflects the efficiency of the protocol. A smaller number of sent messages indicates a more efficient protocol.Vehicle collisions are mainly caused by vehicles that do not receive the ESM in time or do not receive the ESM at all. This means that safety performance is mostly influenced by the dissemination latency and the reliability of the communications. The reliability of a protocol is indirectly measured from the number of vehicle collisions. As a reference, the evaluation includes the results from a theoretical optimal protocol in which ESMs can be disseminated to all relevant vehicles with zero delay or latency.In order to measure those metrics, a vehicle-following logic similar to the work proposed by Biswas et al. [12] has been developed. This was done by extending the ns-3 mobility model and developing a highway scenario module that can simulate road accidents, particularly a chain or multiple collisions on a highway. A chain collision situation is started by triggering an emergency event, in which a vehicle is forced to rapidly decelerate at 8 m/s2. Such a vehicle becomes an abnormal vehicle. The high deceleration rate models an unexpected collision scenario in which a vehicle can stop within a short distance. Immediately after decelerating, the abnormal vehicle will start sending the ESMs. A vehicle that receives an ESM will start braking with a normal deceleration of 4.9 m/s2 after a 1.5 s reaction time. A vehicle is not allowed to change lanes. Existing protocols for ESM dissemination were designed specifically for highway scenarios. Therefore, highway scenarios are chosen to allow a direct comparison with existing protocols.


## 4.2. Simulation Design and Setup

To provide a fair comparison, the simulation parameters and environment are configured to match the ones used by the authors of IBIA and EMDV [12, 28] as closely as possible. In the simulation, all vehicles are equipped with a CCWS. Each vehicle generates RSMs (beacon messages) at a rate of 10 messages per second. Before sending the first RSM, each vehicle calculates a random number from 0 to 100 ms, and uses that number as the time to send the first RSM. The next RSM is then scheduled to be sent periodically every 100 ms. The message size of both ESMs and RSMs is set to 500 bytes, including the application protocol specific headers. A constant message size is used to provide a consistent comparison result. The transmission power is configured to 19 dBm, which corresponds to 1000 m transmission range with around 20% message reception probability and 500 m transmission range with 90% message reception probability. The probabilistic Nakagami distribution is selected as the radio propagation loss model [28]. Real-world tests on highways showed that the Nakagami distribution is suitable to model the radio propagation in highway scenarios. The parameter of m=1 is set to simulate severe fading conditions, therefore, demonstrating the protocols’ performance in the worst case scenario.The lower layer protocol (PHY and MAC) parameters are set according to the IEEE 802.11p standard [1], which operates at 5.9 GHz on a 10 MHz control channel (CCH). The PHY data rate is configured to 6 Mbps, which is the optimal value for safety communication [42]. The channel switching scheme is currently not implemented, which means the whole 10 MHz CCH bandwidth can be used by the CCWS application. The MAC layer is configured to ad hoc mode with QoS support using the EDCA mechanism as described in IEEE 802.11e. The priority for ESMs is set to AC_VO (highest), and the priority for RSMs is set to AC_VI (second highest). Both the ESM and RSM protocols are simulated as extensions to the IEEE 1609 WAVE Short Message Protocol (WSMP) [40]. They are directly implemented on top of the MAC layer.The common configuration details related to lower layer protocols are summarized in Table1. The specific parameters to the IBIA and EMDV protocols are configured by following the given value in the original paper. A minor modification is made to the IBIA protocol by setting a maximum number of repetitions. The specific parameters for the IBIA, EMDV, and CMED protocols are detailed in Table 2.Table 1
Common configuration parameters.
Parameter
Value
PHY and MAC protocol
802.11p
802.11p data rate
6 Mbps
Propagation loss model 1
Three-log distance
Propagation loss model 2
Nakagamim=1
Transmission power
19 dBm
Safety message size
500 bytes
RSM generation rate
10 packets/s
Priority level:
ESM
AC_VO
RSM
AC_VITable 2
Specific protocol parameters.
Parameter
Value
IBIAmessagePeriod
100 ms
IBIArandomWaitTime
(0–10) ms
IBIAmaxRepeatCount
10
EMDVdisseminationAreaLength
2000 m
EMDVforwardingRange
500 m
EMDVmaxMessages
3
EMDVmaxContentionTime
100 ms
EMDVmaxChannelAccessTime
10 ms
CMEDmaxContentionTime
10 ms
CMEDdmax
500 m
CMEDmaxRepeatCount
10
CMEDrepeatInterval
100 ms
CMEDmaxMessages
3The ESM protocol was evaluated in two typical cases of highway scenarios. The first case is a simple highway scenario that represents a typical road traffic scenario with relatively low communication traffic. The second case represents a typical road traffic scenario with high communication traffic density. In the second case, the distance between vehicles is randomized at each simulation run to test how the protocols perform in different highway traffic situations. Table3 provides the common parameters that are used in all scenarios.Table 3
Common parameters for the highway scenario.
Parameter
Value
Driver's reaction time
1.5 s
Vehicle length
4 m
Vehicle speed
32 m/s
Vehicle emergency deceleration
8.0 m/s2
Vehicle normal deceleration
4.9 m/s2


### 4.2.1. Simple Highway Scenario

This scenario models a single lane highway withn vehicles moving in the same direction with the same speed, similar to the scenario used to evaluate the IBIA protocol [12]. The platoon was formed with uniform intervehicle spacing s, as illustrated in Figure 4(a). To demonstrate the protocols’ performance with different vehicle densities, the simulation is conducted with different numbers of vehicles n ranging from 40 to 200. The distance between the vehicles at the first (v0) and last (vn) positions is fixed to 2000 meters, so a higher number of vehicles would mean a shorter intervehicle spacing. An emergency event was initiated by the abnormal vehicle at the front of the platoon (v0). Without a CCWS, all of the vehicles behind vehicle v0 would be involved in chain collisions. This scenario is useful to evaluate the performance of ESM protocols in a low-density environment with deterministic node topology and mobility. Each simulation was repeated 100 times with a random seed for each run to obtain a statistically significant result. Table 4 indicates the specific parameters used in this scenario.Table 4
Parameters specific to the simple highway scenario.
Parameter
Value
Highway length
2000 m
Number of vehicles
(40–200)
Number of abnormal vehicles
1
Number of lanes
1
Intervehicle spacing
(10–50) mIllustration of highway scenarios used in the simulation.
(a)
Simple highway scenario
(b)
Random highway scenario


### 4.2.2. Random Highway Scenario

This scenario models a multilane bidirectional highway environment. Figure4(b) illustrates this scenario. The highway consists of 6 lanes with 3 lanes for each direction. The total number of vehicles is 600, and each lane contains 100 vehicles. The starting distance between vehicles was randomized for every simulation run, with a value between 9 and  50 m. N number of abnormal vehicles (initial sender) were randomly selected, which means N emergency events were initiated in the course of the simulation. Those events were triggered consecutively with a 1 ms interval. Experiments are conducted for different values of N ranging from 1 to 6. Each time, the simulation is repeated with a random seed 100 times to obtain a statistically significant result. Table 5 indicates the specific parameters used in this scenario.Table 5
Parameters specific to the random highway scenario.
Parameter
Value
Number of vehicles
600
Number of abnormal vehicles
(1–6)
Number of lanes
6
Inter-vehicle spacing
(9–50) m


## 4.2.1. Simple Highway Scenario

This scenario models a single lane highway withn vehicles moving in the same direction with the same speed, similar to the scenario used to evaluate the IBIA protocol [12]. The platoon was formed with uniform intervehicle spacing s, as illustrated in Figure 4(a). To demonstrate the protocols’ performance with different vehicle densities, the simulation is conducted with different numbers of vehicles n ranging from 40 to 200. The distance between the vehicles at the first (v0) and last (vn) positions is fixed to 2000 meters, so a higher number of vehicles would mean a shorter intervehicle spacing. An emergency event was initiated by the abnormal vehicle at the front of the platoon (v0). Without a CCWS, all of the vehicles behind vehicle v0 would be involved in chain collisions. This scenario is useful to evaluate the performance of ESM protocols in a low-density environment with deterministic node topology and mobility. Each simulation was repeated 100 times with a random seed for each run to obtain a statistically significant result. Table 4 indicates the specific parameters used in this scenario.Table 4
Parameters specific to the simple highway scenario.
Parameter
Value
Highway length
2000 m
Number of vehicles
(40–200)
Number of abnormal vehicles
1
Number of lanes
1
Intervehicle spacing
(10–50) mIllustration of highway scenarios used in the simulation.
(a)
Simple highway scenario
(b)
Random highway scenario


## 4.2.2. Random Highway Scenario

This scenario models a multilane bidirectional highway environment. Figure4(b) illustrates this scenario. The highway consists of 6 lanes with 3 lanes for each direction. The total number of vehicles is 600, and each lane contains 100 vehicles. The starting distance between vehicles was randomized for every simulation run, with a value between 9 and  50 m. N number of abnormal vehicles (initial sender) were randomly selected, which means N emergency events were initiated in the course of the simulation. Those events were triggered consecutively with a 1 ms interval. Experiments are conducted for different values of N ranging from 1 to 6. Each time, the simulation is repeated with a random seed 100 times to obtain a statistically significant result. Table 5 indicates the specific parameters used in this scenario.Table 5
Parameters specific to the random highway scenario.
Parameter
Value
Number of vehicles
600
Number of abnormal vehicles
(1–6)
Number of lanes
6
Inter-vehicle spacing
(9–50) m


## 4.3. Simulation Results

### 4.3.1.  Simple Highway Scenario

From 100 simulation runs, the average of maximum dissemination latency for scenarios of 40 to 200 vehicles is calculated and plotted in Figure5. The result shows that a higher number of vehicles (higher density) leads to a higher latency. In all of the cases, the CMED protocol can deliver ESMs faster than the IBIA and EMDV protocols. In terms of efficiency, the number of sent messages is plotted in Figure 6. It shows that the number of sent messages for the CMED protocol is just slightly lower than for the EMDV protocol. Both the CMED and EMDV protocols send significantly fewer messages compared to the IBIA protocol. In this scenario, all of the protocols can achieve an optimal number of vehicle collisions in most cases. Table 6 shows that there is no significant difference in the numbers of collisions resulting from this scenario between the three protocols. For example, in a case with 200 vehicles, the total number of collisions averaged from 100 simulation instances was 15.97 for IBIA, 14.14 for EMDV, and 14.11 for CMED. As a reference, the smallest number of collisions that can be achieved is 14. The higher number of collisions for IBIA means that in some instances of the simulation, the protocol has failed to ensure 100% message delivery to all endangered vehicles.Table 6
Number of vehicle collisions in the simple highway scenario.
Number of vehicles
40
60
80
100
120
140
160
180
200
IBIA
1.2
3.24
4.03
5.38
6.7
9.25
11.52
13.49
15.97
EMDV
1.03
3
4
5
6.21
8
10.01
12.01
14.14
CMED
1
3
4
5
6.21
8.01
10
12.01
14.11Figure 5
Average of maximum dissemination latency in the simple highway scenario.Figure 6
Total number of ESMs sent by all vehicles in the simple highway scenario.


### 4.3.2. Random Highway Scenario

Each simulation instance produces a unique highway scenario that results in different number of vehicle collisions for each run. The lowest possible number of collisions for each unique scenario, which is the optimal result, is obtained by simulating a dummy protocol that can transmit ESMs to all relevant vehicles instantaneously just after an emergency event occurred. The resulting number of vehicle collisions for the other protocols was normalized to the optimal result in order to clearly show the differences between the evaluated protocols.Figure7 shows the number of excess vehicle collisions for different numbers of concurrent events (from 1 to 6). When there are more than one concurrent events, the CMED protocol delivers a lower number of collisions compared to both the IBIA and EMDV protocols. Given only one concurrent event, the CMED protocol delivers an equal number of collisions to the EMDV protocol, but lower than for the IBIA protocol.Figure 7
Number of excess vehicle collisions (normalized to the optimal results)  from 100 instances of the random highway scenario.The number of sent messages for the CMED protocol is the lowest for all of the cases, as shown in Figure8. The overall number was obtained by adding up the number of messages sent by all vehicles from 100 simulation instances.Figure 8
Total number of ESMs sent by all vehicles from 100 instances of the random highway scenario.Figure9 shows the maximum dissemination time required for an ESM to reach all relevant vehicles. The maximum dissemination time was averaged from 100 simulation instances. It shows that, generally, the CMED protocol is always able to disseminate the ESMs faster than either the IBIA and EMDV protocols.Figure 9
Maximum dissemination latency averaged from 100 instances of the random highway scenario.


## 4.3.1.  Simple Highway Scenario

From 100 simulation runs, the average of maximum dissemination latency for scenarios of 40 to 200 vehicles is calculated and plotted in Figure5. The result shows that a higher number of vehicles (higher density) leads to a higher latency. In all of the cases, the CMED protocol can deliver ESMs faster than the IBIA and EMDV protocols. In terms of efficiency, the number of sent messages is plotted in Figure 6. It shows that the number of sent messages for the CMED protocol is just slightly lower than for the EMDV protocol. Both the CMED and EMDV protocols send significantly fewer messages compared to the IBIA protocol. In this scenario, all of the protocols can achieve an optimal number of vehicle collisions in most cases. Table 6 shows that there is no significant difference in the numbers of collisions resulting from this scenario between the three protocols. For example, in a case with 200 vehicles, the total number of collisions averaged from 100 simulation instances was 15.97 for IBIA, 14.14 for EMDV, and 14.11 for CMED. As a reference, the smallest number of collisions that can be achieved is 14. The higher number of collisions for IBIA means that in some instances of the simulation, the protocol has failed to ensure 100% message delivery to all endangered vehicles.Table 6
Number of vehicle collisions in the simple highway scenario.
Number of vehicles
40
60
80
100
120
140
160
180
200
IBIA
1.2
3.24
4.03
5.38
6.7
9.25
11.52
13.49
15.97
EMDV
1.03
3
4
5
6.21
8
10.01
12.01
14.14
CMED
1
3
4
5
6.21
8.01
10
12.01
14.11Figure 5
Average of maximum dissemination latency in the simple highway scenario.Figure 6
Total number of ESMs sent by all vehicles in the simple highway scenario.


## 4.3.2. Random Highway Scenario

Each simulation instance produces a unique highway scenario that results in different number of vehicle collisions for each run. The lowest possible number of collisions for each unique scenario, which is the optimal result, is obtained by simulating a dummy protocol that can transmit ESMs to all relevant vehicles instantaneously just after an emergency event occurred. The resulting number of vehicle collisions for the other protocols was normalized to the optimal result in order to clearly show the differences between the evaluated protocols.Figure7 shows the number of excess vehicle collisions for different numbers of concurrent events (from 1 to 6). When there are more than one concurrent events, the CMED protocol delivers a lower number of collisions compared to both the IBIA and EMDV protocols. Given only one concurrent event, the CMED protocol delivers an equal number of collisions to the EMDV protocol, but lower than for the IBIA protocol.Figure 7
Number of excess vehicle collisions (normalized to the optimal results)  from 100 instances of the random highway scenario.The number of sent messages for the CMED protocol is the lowest for all of the cases, as shown in Figure8. The overall number was obtained by adding up the number of messages sent by all vehicles from 100 simulation instances.Figure 8
Total number of ESMs sent by all vehicles from 100 instances of the random highway scenario.Figure9 shows the maximum dissemination time required for an ESM to reach all relevant vehicles. The maximum dissemination time was averaged from 100 simulation instances. It shows that, generally, the CMED protocol is always able to disseminate the ESMs faster than either the IBIA and EMDV protocols.Figure 9
Maximum dissemination latency averaged from 100 instances of the random highway scenario.


## 5. Discussion

The simulation results demonstrate the advantages of the proposed CMED protocol. In the simple highway scenarios, the IBIA protocol results in lower latency, but a higher number of vehicle collisions, compared to the EMDV protocol. In some simulation instances, the IBIA protocol is not able to deliver warning messages to some endangered vehicles, which means that the IBIA protocol is less reliable compared to the EMDV and CMED protocols. Although the number of vehicle collisions for the CMED protocol is not much different compared to the EMDV protocol, the CMED protocol still shows some advantages in terms of the number of sent message and the maximum dissemination time.The random highway scenarios demonstrate the performance of the protocols in a typical highway environment with high communication traffic density. Using the CMED protocol results in the fewest number of vehicle collisions. The results show that the CMED protocol is more reliable and scalable than the other protocols. It can generally improve the safety performance of the EEBL application. Figure7 shows that for IBIA and EMDV protocols, the difference in the number of vehicle collisions becomes much larger as the number of concurrent events increases. A higher number of concurrent events means higher communication traffic density.The number of sent messages shown in Figure8 demonstrates that the CMED protocol is more efficient compared to both the IBIA and EMDV protocols. The CMED protocol is able to reduce the number of redundant transmissions without compromising safety by sending ESMs only to the relevant vehicles. Depending on the traffic conditions, ESMs may be disseminated only to some vehicles behind an abnormal vehicle. In contrast, the other protocols always disseminate ESMs to all vehicles behind an abnormal vehicle until there is no other vehicle in the radio range of the last relay.The number of sent messages directly correlates with the channel usage level. In the 802.11-based wireless networks, higher channel usage will result in frequent backoffs and higher chance of packet collisions, which will degrade network performance and congest the channel as its capacity is reached [10]. The effect of network performance to safety is measured by the number of vehicle collisions. The simulation results show that the number of excess vehicle collisions increases as the number of sent messages increases. By using the channel efficiently, the CMED protocol is able to significantly improve overall network performance, particularly in the scenarios that can potentially create a very high channel usage.The CMED protocol can achieve the lowest number of vehicle collisions because the protocol can disseminate ESMs with a low latency and a low rate of packet loss. The efficiency of the protocol is one of the factors that contributes to a low latency and a low rate of packet loss. Another factor that improves the latency is the use of routing paths that is based on the least-delay multicast tree. Furthermore, the contention-based method of the CMED protocol addresses the possibility of packet loss and is able to improve the successful packet reception rate.The use of context information in CMED protocol requires a larger computational overhead compared to other protocols. Since ns-3 is a discreet event-based simulator, it is not possible to measure the computational cost of any protocol and to integrate the measurement into the network simulation. Therefore, we have conducted a separate analysis and evaluation of the computational complexity of the CMED protocol. The main costly algorithms are the interaction graph and the multicast tree generations. As the interaction graph is updated regularly every time an RSM is received, its overhead does not directly affect the communication delay and each update is very fast because it has a complexity ofO(𝒱). The multicast tree is generated by running the Dijkstra’s algorithm, that has a complexity of O(|V|2). We have developed a Java-based tool to evaluate and visualize the interaction graph, and performed an experiment using the tool in a personal computer with a 2.5 GHz processor. Given 600 vehicles, each O(𝒱) iteration of interaction graph generation only takes about less than 0.1 milliseconds to process. Our simple implementation of Dijkstra’s algorithm can generate a multicast tree to 100 random receivers within less than 10 milliseconds. Using a more advance implementation can further reduce the complexity of Dijkstra’s algorithm to O(log|V|). Even with 10 milliseconds extra latency, the overall CMED latency in the random scenario is still the lowest one. Based on the analysis and evaluation results, the extra computational cost does not significantly affect the simulation result of CMED.In addition to the advantages in a highway scenario shown by the simulation results, another advantage of the CMED protocol is the applicability in various cases of traffic accidents. Existing ESM protocols only consider a straight road scenario such as a highway and assume that the receivers are those vehicles located within the region behind or in front of the abnormal vehicle that are moving towards the abnormal vehicle. However, some accidents may occur in a more complex road traffic situation such as at a junction, on a curved road, or a roundabout. Another weakness of prior ESM protocols is that for each transmission, only one relay can be selected based on the contention method, resulting in a single dissemination direction.There are possibilities and variations of road traffic scenarios where ESMs must be disseminated in more than one direction. Figure10 shows one example of a junction road topology where the endangered vehicles or broadcast region cannot be determined based on the forward or backward direction of the sender. In this example, assume that vehicle a is the abnormal vehicle and vehicles b, c, d, e, f, and g are the endangered vehicles. Figure 10(a) shows an example of ESM dissemination using the prior approaches. Vehicle a broadcasts the ESM, which is received by vehicles b, c, and e. Vehicle e ignores the received ESM because of its different direction. Vehicle c is chosen as the relay based on the contention rules (e.g., farthest distance from the sender) and forwards the ESM to vehicle d. Vehicle f ignores the received ESM for the same reason as vehicle e. This results in endangered vehicles e, f, and g not receiving the ESM.Comparison of ESM dissemination in a junction road traffic scenario. (a) Using prior approaches. (b) Using the context-aware multicast approach.
(a)
(b)The CMED protocol uses a context-aware strategy to decouple the task of determining the endangered vehicles from the routing algorithm. The interaction graph, which is used to identify the endangered vehicles, can be considered as a separate module from the routing algorithm. Given the set of endangered vehicles as the input parameter, the routing algorithm can find the best possible paths to all of the endangered vehicles. Figure10(b) shows the example of ESM dissemination using the CMED approach. Using this approach, vehicles e and f can recognize themselves as endangered vehicles, and vehicle f is informed to forward the ESM to vehicle g. A protocol designed with this approach will be able to deliver the warning messages effectively in various road traffic scenarios.


## 6. Conclusion and Future Work

In this paper, we have presented a context-aware multicast protocol for ESM dissemination that can reduce the number of accidents or crashed vehicles. Differing from other existing approaches, the proposed multicast approach uses a precomputed routing tree based on the estimated delay and utilizes the vehicle interaction graph to identify receiver nodes. The multicast tree is the minimum delay tree from a sender to the receivers, computed using Dijkstra’s shortest path algorithm with transmission delay as the cost function. The approach improves the wireless channel usage by reducing the number of sent messages and improves the dissemination time by using the least-delay path. Furthermore, the multicast protocol incorporates the contention-based forwarding techniques to improve reliability.The performance of the proposed protocol has been evaluated by experiments conducted using the network simulator ns-3. It has been compared with broadcast protocols in highway traffic scenarios, with a constant beaconing load. Road accident scenarios are simulated by extending ns-3 with a new highway mobility model. The simulation results have shown that the multicast protocol outperforms the existing broadcast protocols in terms of efficiency and reliability. Moreover, the multicast protocol is able to significantly reduce accident casualties in some scenarios. In addition, the multicast approach can disseminate ESMs in any direction depending on the multicast tree, and therefore can support various road traffic scenarios.Currently, the proposed multicast scheme requires context information about neighboring vehicles within more than 1-hop communication range. In future work, we will investigate a different approach that only needs 1-hop information by extending and modifying the proposed multicast scheme. In addition, more experiments are needed to evaluate how the multicast protocol performs on other complex scenarios such as intersection and junction.



---

*Source: 905396-2012-09-18.xml*