Clustering-Based Data Dissemination Protocol Using the Path Similarity for Autonomous Vehicles

Abstract

The VANET (Vehicle Ad Hoc Network) is gathering attention for autonomous vehicles and the MANET (Mobile Ad Hoc Network) is attracting interest as well. Therefore, efforts have been made to overcome the challenges of the VANET in which the topology changes in real time and instability exists due to the difference in speed and physical phase. Particularly in the IoT era, the total amount of network nodes in addition to vehicle nodes is expected to increase dramatically. Therefore, a clustering algorithm for a mesh network capable of autonomous configuration is suitable for reducing the load of the central control device and data redundancy on the network, which is expected to increase as the IoT era progresses. However, since clustering algorithms based on the existing research have been developed for the current traffic situation, inefficiency is inevitable in the future autonomous navigation period in which traveling path prediction can be accurately performed. Therefore, this paper discusses a clustering algorithm and a data propagation algorithm between clusters using path information. The main content of this paper is as follows. First, we propose a clustering algorithm using path information and considering the existing research results. In the autonomous navigation period, if the path is predictable, the probability that the nodes in the same cluster are in the same block for a longer time than the conventional one can converge to 100%. Therefore, the survival time of the cluster can be dramatically improved. Second, we developed a data propagation algorithm that can increase the information propagation rate of the entire network using path information. The cluster temporarily stores the data to be disseminated and then disseminates it when it encounters another cluster of neighbors. Therefore, data can be disseminated even for noncontiguous clusters. To summarize, this paper proposes clustering-based data dissemination algorithms and protocols using vehicle pathways for autonomous navigation and compares them with clustering-based data dissemination algorithms using existing directions.

1. Introduction

In 2020, the number of vehicles in the United States is expected to increase by 247 million [1]. The number of Vehicle-to-everything (V2X) entities is also growing rapidly, and by 2020 more than 70 million vehicles worldwide are expected to utilize V2X communications for weather, traffic congestion, emergency vehicle access, and other purposes, compared to 10 million vehicles using V2X communications in 2015 [2]. Also, according to reference [3], the maximum payload that is required in V2X communications is 1200 bytes. Assuming that 70 million nodes transmit data with these payloads once every 10 seconds, the maximum payload reaches 1,933 PB per month (peta bytes per month). In the IoT era, the total amount of network nodes as well as vehicle nodes is expected to increase significantly. According to reference [4], the IoT installed base is estimated to reach 30.73 billion by 2020. Rather than centrally control this vast amount of traffic through a cellular network, efforts have been made to reduce the load on the control by constructing a mesh network and a VANET between the road side unit (RSU) and the on-board unit (OBU). For example, there is geocast routing using zone of relevance (ZOR), directional data dissemination protocol using angles between nodes, and the distributed and mobility-adaptive clustering algorithm (DMAC) considering the speed difference of nodes [5,6,7].

Therefore, this paper proposes a clustering algorithm using path information and a data dissemination algorithm between clusters. The main content of this paper is as follows.

First, we propose a clustering algorithm using path information by improving the related research. In a related study, it was assumed that each vehicle node is G/G/1 Queue and the vehicle follows Brownian motion. In this case, the authors modeled the node’s successful transmission rate as the probability that nakagami-m fading would not occur at all or would occur within a certain distance [8,9]. However, this model ignores the fact that vehicle traffic can be modeled as a Markov chain Monte Carlo system (MCMC) because the actual road environment does not know the traveling paths of other vehicles [10]. Therefore, the vehicle position cannot be considered to follow the complete Wiener motion, and it is correct to model each intersection with MCMC using numerous iterations.

However, if the path prediction is more accurate than the MCMC in the autonomous mobile era, the probability that nodes in the same cluster are in the same segment for a longer period of time converges close to 100%. As a result, you can dramatically improve the lifetime of your cluster. Additionally, as the lifetime of the cluster increases, the overhead of the cluster reconstructing process decreases and the ratio of lost data dissemination messages during the process can be reduced.

Second, we developed a data propagation algorithm that can increase the information propagation rate of the entire network by using path information. The cluster head is propagated using the member closest to the neighboring cluster as a gateway role, and the neighboring cluster is a cluster directed to another path. The cluster temporarily stores the data to be deployed, and then distributes it when it encounters another neighbor cluster. Since the cluster that receives the data is a cluster with a different path, the cluster that is newly encountered is likely to be a cluster that is encountered in another path. Thus, the data can spread even in non-contiguous clusters.

In summary, this paper proposes clustering-based data dissemination algorithms and protocols that use vehicle paths for autonomous navigation and compares them with existing clustering-based data dissemination algorithms using possibilities.

1.1. Clustering Algorithms

Clustering algorithms have been applied in many fields. For example, some basic algorithms such as from reference [11] and reference [12] are provided as meta-algorithms, and others have been used in software engineering as well [13]. However, the most recently used fields are related to self-organizing networks such as wireless sensor networks (WSN) or ad-hoc networks such as Refs. [14,15,16]. These studies noted the utility of managing clustering when combined with a mesh network. In other words, it has a smaller controller load than central management, but flooding occurs more often than for a fully-connected mesh network. Taking advantage of clustering on the ad-hoc network claimed in these papers, we note that clustering can have similar advantages over V2X mesh networks that share the basic characteristics of mesh networks.

In particular, VANET based on a clustering algorithm is suitable for reducing the load of the central control unit, which will increase during the IoT era, and will reduce the data redundancy on the network [17]. Distributed clustering is also applicable to location-unaware WSN, and VANET belongs in this category [18].

However, the existing clustering algorithms based on the current traffic environment are not optimized for autonomous driving when the accurate path of the vehicle can be known beforehand [19].

Therefore, this paper proposes a clustering algorithm that is specialized for autonomous driving environment.

1.2. Path Similarity

In this paper, path similarity means the degree of similarity between two paths. The path similarity is mainly used for graph matching such as skeleton graph matching as in Refs. [20,21,22].

However, path similarity is often not used in routing algorithms. Similar to the path similarity, geographical data such as directionality are used for routing. For example, Leontiadis [23] and Chen [24] correspond to geographical routing. These geographical routing schemes are suitable for overcoming frequent topology changes in WSNs with high mobility.

The reason why the path similarity is not used in the routing algorithm is that it cannot predict the entire movement path of each object in the system, such as WSN or VANET mentioned above.

Since existing clustering algorithms often target fixed or infrequently moving nodes, it is difficult to apply them directly to V2X with active mobility If path similarity is available, it can increase the connectivity and maintainability of the cluster, but existing vehicles cannot know the full path information. So instead of path similarity, use directionality or the connection rate.

However, this paper focuses on the autonomous vehicle environment. In this case, each node, that is, each vehicle can know all the routes to the destination. Therefore, it is possible to utilize the route information which has been used only in the graph algorithm, which can clearly know the entire route, in the routing. This means that we can utilize path information that is remarkably accurate compared to the directionality or connection rate that can only estimate the path. In other words, it can identify nodes that are moving in a similar path, which contributes to the improvement of the survival of clustering. It is therefore possible to identify the nodes that are moving in a similar path. Thus, by constructing clusters among the nodes going to the same route in the future, the algorithm contributes to improvement of the survival of clustering.

Accordingly, in this paper, we propose a clustering algorithm based on path similarity based on the assumption that each object knows all its paths.

2. Related Works and Problems

2.1. DSRC/WAVE

Dedicated short-range communications (DSRC) is a long-range wireless communication method developed for the intelligent transport system (ITS) and is a protocol published by the US Federal Communications Commission (FCC) [25]. This method was originally developed only for bill collection and used in the 75 MHz frequency band but was changed to the 5.9 GHz frequency band to overcome low performance for V2X communication. Accordingly, it was listed in the IEEE standard as 802.11p with the name WAVE [26].

Figure 1 shows the protocol stack of WAVE [27]. The WAVE PHY layer corresponds to the OSI 1 layer, and WAVE MAC, multichannel operation, and the LLC layer correspond to the OSI 2 layer. The upper layers are similar to normal ethernet layers.

According to a previous research study, WAVE has a decline in transmission success rate depending on the density of nodes [28]. Therefore, if WAVE is used to construct a mesh network for V2X in the future, it is essential to reduce interference by reducing unnecessary retransmissions in the transport layer protocol.

However, WAVE does not respond to such a reduction in redundancy and focuses on smooth communication between vehicles with high speed. Therefore, the utility of a vehicle in a city where the vehicle is crowded is drastically reduced and a solution is needed [29]. Depending on the node density, severe delays may occur [30].

Since the WAVE protocol is now the de facto standard for V2X communication, it is likely to be based on WAVE even in the era of autonomous navigation in the future. Therefore, to use WAVE for V2X communication, it is also essential to compensate for the weakness of WAVE, but related research is not active.

As described above, the clustering-based data dissemination protocol is a solution to this issue. It is possible to configure the cluster autonomously without central management and reduce the redundancy by controlling the cluster head [31].

However, a node in VANET has very strong mobility. Therefore, the link is very unstable and vulnerable, and its topology changes from moment to moment [32]. Because of this, clustering-based algorithms are not easily maintained in a composed cluster. This is particularly the case in urban areas [33].

Thus, in this paper, we discuss how clustering-based data dissemination can increase the survivability of clusters and reduce the redundancy of a future internet environment.

2.2. Data Dissemination Scheme Based on Clustering and Probabilistic Broadcasting

In May 2018, Lei Liu announced the data dissemination scheme using broadcasting and clustering based on connection probability [34]. In this study, the authors proposed clustering and probabilistic broadcasting (CPB), which is the main concept when constructing clusters based on cumulative connection probabilities through continuous connectivity verification.

This paper is significant in that it is a clustering algorithm that maximizes connectivity in unstable V2X environments. However, the data rates they define are not consistent with the actual road environment.

$$P_{ij}^f=1-F_d\left(r_{\tau },m,\psi \right)=e^{-\frac{m{\gamma }_{{\rm T}}}{\Psi }{{\displaystyle \sum }}_{i=1}^m\frac{{\left(\frac{m{\gamma }_{{\rm T}}}{\Psi }\right)}^{i-1}}{\left(i-1\right)!}}$$

(1)

$$\begin{array}{ll}p\left(x|d_0, t\right)& =\mathrm{Pr}\left(x\le D\left(t\right)\le x+dx|d_0\right)\\ & =\frac{1}{\sigma \sqrt{2\pi t}}{\displaystyle \sum _{n=-\infty }^{\infty }}[\exp \{\frac{\mu x_n^{\prime }}{\sigma }-\frac{{[x-d_0-x_n^{\prime }-\mu t]}^2}{2{\sigma }^{2}t}\}\\ & -\exp \{\frac{\mu x_n^{″}}{\sigma }-\frac{{[x-d_0-x_n^{″}-\mu t]}^2}{2{\sigma }^{2}t}\}]\end{array}$$

(2)

The authors define the probability $P_{ij}^f$ that packet transmission between nodes i and j succeeds as Equation (1). In Equation (1), $r_{\tau }$ is the threshold of the signal strength that can be received, $\psi$ is the average signal strength, and $m$ is the fading parameter. $m$ is 1 if the distance between vehicles is more than 150 m, 1.5 when it is more than 50 m and 3 if it is less than 50 m. $F_d$ presents the probability density function of possibility that the nakagami-m fading will occur. That is, the probability that fading due to the nakagami-m distribution will not occur [35].

Additionally, the authors assumed that each vehicle follows the Wiener process. Equation (2) is used to derive the probability $p\left(x|d_0, t\right)$ that the vehicle will be at a certain radius.

$$L{C}_{ij}=F_{i,j}\left(t\right)=1-{{\displaystyle \int }}_0^{R}p\left(x|d_0, t\right)dx$$

(3)

Equation (3) defines the link connectivity $L{C}_{ij}$ using $P_{ij}^f$ derived from Equation (1) and $p\left(x|d_0, t\right)$ derived from Equation (2). The link quality $l{q}_{ij}$ defined in the paper is calculated as Equation (4).

$$l{q}_{ij}=P_{ij}^{f}L{C}_{ij}$$

(4)

After the clusters are configured, they determine the forwarding probability as follows. First, a timer is started for a t_int interval which is a preset data transmission interval. Then, when the cluster member receives a disseminated message while the timer is running, it increments the counter t_c. The transmission probability P is determined according to the numerical value of the counter t_c as shown in Equation (5).

$$P=\{\begin{array}{c}1, C=1\\ \frac{2}{C^2}, 2\le C\le Threshold\\ 0, C>Threshold\end{array}$$

(5)

Note that P is a probabilistic variable that determines whether a cluster member will deliver it probabilistically when it receives a message, and does not mean a transmission success rate. That is, if $P_{ij}^f$ in Equation (1) represents the success rate of the physical transmission of the communication, then P in Equation (5) is a variable of the probabilistic transfer algorithm which is one of the core solutions of CPB.

Here, $Threshold=\lfloor 6V_r\rfloor$, and $V_r$ is the speed ratio, which is the current vehicle speed $V_c$ divided by the vehicle maximum speed $V_f$. The authors estimate this value using the number of vehicles on the road, but in this paper, we used the actual vehicle speed and the maximum speed when reproducing.

However, in reality, V2X communication not only includes various types of fading such as coherent fading, k-type fading as well as nakagami-m fading, but also an environment in which multiple constraints are applied in addition to fading. Therefore, it is difficult to verify the efficiency with simple arithmetic calculations. In this paper, we will compare this with a simulation environment which depicts a real environment rather than efficiency based on simple arithmetic operation.

Also, the authors did not take into account the probability that the route will change to link quality, an option which is favorable in existing environments such as highways, but can be extremely disadvantageous in urban areas with frequent path deviations. Clustering algorithms using a simple path loss model cannot guarantee future connectivity. When the cluster is disconnected frequently, the overhead is increased, and the message to disseminate is more likely to be lost.

Moreover, since all nodes must continuously check the connectivity, flooding may occur due to discovery messages in the city where the vehicle is driven. This is considered to be unsuitable for future Internet environments where there are numerous nodes besides vehicles.

In addition, the conventional algorithm does not consider roads with several lanes when determining the probability that a message is forwarded using density. In an actual driving environment, except for a highway, the lane serves as one of the critical variables that changes the route. Because of these problems, it seems that the existing algorithms are less effective in urban scenarios.

In particular, if we look at the left side of Figure 2, it can be confirmed that only one-dimensional positional variables can be considered since all lanes can be regarded as straight lines when the highway is generalized. However, when we look at the right side of Figure 2 considering roads with many lanes in actual cities, it can be seen that the lane information of the road not only refers to the position information between the left and right, but also affects the density of the node. That is, the number of lanes also affects estimations that utilize density [36].

For example, a vehicle on a left-hand lane and a straight-ahead lane may have high connectivity, but in reality, it only takes a few seconds to move in a different direction. Clustering algorithms based solely on link probabilities are difficult to distinguish. However, if the exact path of each vehicle can be known in advance, it can be seen that the paths are compared with each other and the path changes soon.

Thus, in this paper, we will discuss how to obtain the advantages and overcome the disadvantages of existing research if we assume the above situation and have path information for each node in the future.

3. Proposed Method

In this section, we discuss the path-based clustering protocol proposed in this paper.

3.1. Term Definitions

The definitions of the main terms used in this paper are shown in

Table 1. Term Definition.

Term	Definition
Unclustered node	Node not joined to any cluster
Cluster head	A node that manages the cluster in a cluster
Cluster member	A node belonging to a cluster but not a cluster head
Path distance	Similarity distance between path information of each node
Data dissemination rate	The percentage of messages disseminated across the network
Survivability	The degree to which a cluster member can be maintained as a member of a cluster for a unit of time
Data Dissemination	Delivering messages to the entire network so that as many nodes as possible receive

.

3.2. Path-Based Clustering Model

3.2.1. Concept Definitions

The proposed path-based clustering data dissemination protocol (PCDP) consists of two parts.

The first part is a clustering method that forms clusters based on the expected path of the vehicle. When constructing a cluster, the survivability of the cluster is improved by constructing a cluster between nodes with the smallest difference by comparing the planned paths of the vehicles. In particular, in the city area where the route is frequently used, there is a certain probability that the node will depart due to the change in route, even if the connection rate is high, which accumulates every time the route distribution section includes the intersection passes.

As can be seen in Figure 3, nearby vehicles can point in different directions at the next intersection. If the red vehicle in Figure 3 goes to the left, the yellow car goes straight, and the blue car goes to the right, there is a possibility that all of them belong to the same cluster according to the current communication intensity. However, they are clearly dispersed in other directions, and the cluster will collapse in an instant.

If the survivability of the cluster is low, the clustering process occurs frequently and the overhead increases rapidly. Data dissemination is also delayed due to the clustering process.

According to Yu Guoqiang, road conditions can be defined as a Markov chain in Bayesian terms [37]. This supports the fact that the better the future path, the better survivability of clusters.

In this paper, we propose a method for constructing a cluster that can last for a long time using path information.

The second part is a data dissemination method that can reduce the traffic redundancy and how much data can be delivered to the nodes on the network, that is, maximize the data dissemination rate. In this paper, we try to maximize the data dissemination rate by using the path-based cluster as a medium for message delivery. Each cluster has a high probability of heading to a different path, so there is a high probability that it will head to a path with a cluster that has not received the message. Each cluster moves to store the forwarded message and rebroadcasts the message each time it encounters a new neighbor cluster. This process maximizes the data dissemination rate of the entire network.

3.2.2. Use-Cases of PCDP

The clustering algorithms proposed in this paper are most effective when operating in cities with many intersections. In urban areas, path deviation of the node occasionally occurs, which means that the survivability of the cluster is degraded.

The robustness of the cluster is especially important in urban areas. Figure 4 shows a real part of the downtown area of Seoul, Korea and its implementation in the simulation of urban mobility (SUMO) traffic simulation. It can be seen that there are numerous paths in an area of only 1 km². In other words, there is a high possibility of deviation from the route in the city area. In such a scenario, for example, the following may occur:

There may be situations in which an ambulance crosses several intersections and the survivability of the cluster is expected to drop significantly. In addition, congestion may lead to multiple paths. Most often, there are intermediate destinations and they have different paths.

Moreover, in a situation where the route is controlled by autonomous driving, each vehicle may be assigned different routes in advance to avoid congestion. In such a situation, the path is inevitably staggered.

It is important to give priority to instantaneous connectivity in a situation where a route such as a highway is close to a straight line, but it is more appropriate to use the route information if it can be used in a situation where the route is likely to be divided.

3.3. Clustering Algorithm for Applying the Path-based Clustering Model

In this section, we will discuss the PCDP’s clustering process and the message format required.

3.3.1. Path Distance Algorithm

This protocol uses the Levenshtein distance to find the difference in routes between vehicles. Assuming that the total path of the vehicle node n is p_n, the i-th road ID on p_n is r_ni and the length of p_n is l_n, the algorithm for calculating the distance of the path is shown in Algorithm 1. Also, Algorithm 1 has a time complexity of O (n) because it computes the path distance using the finite n road information that each neighbor has.

Algorithm 1 Path distance algorithm
1.	Set i = 1, j = 1, d = 0
2.	For each rmi and rnj of pm, pn
3.	If rmi is the same as rnj, then
4.	Add 1 to i and j
5.	Else then
6.	Add 1 to i and d
7.	Add (lm − j) to d
8.	Set d as d over max(lm, ln)

The calculated path distance is used as an important factor for determining priority in the clustering process. Clustering can be performed as in Algorithm 2 below using the threshold th, where 0 < th < 1. and having a time complexity of O (n). In addition, Algorithm 2 has a time complexity of O (n) since it calculates Path distance for finite n neighbor nodes.

Algorithm 2 Clustering algorithm with path distance
1.	Set b = 0, flg = false, parameter th, assign p
2.	If there is a cluster head among neighbors, then
3.	While not found proper cluster head and flg not set
4.	For each $m\in \left\{neighbors\right\}$
5.	Calculate path distance dm
6.	If dm < b, then
7.	Set b = dm
8.	Set p = m
9.	If b < th, then
10.	Send cluster assignment request to p
11.	Else then
12.	Set timer t
13.	Else then
14.	Broadcast cluster head announcement
1.	Sub procedure t:
2.	If there is no dm lower than th, then
3.	Send cluster head announcement

In this case, th is derived as Equation (6).

$$th=\frac{M}{N}$$

(6)

In Equation (6), M is the number of neighboring neighbor clusters and N is the number of neighboring nodes. That is, as the number of neighboring clusters is smaller than the number of neighboring nodes in the periphery, the node selects the cluster to join with care. In other words, it means to create a cluster if possible. In contrast, if the number of neighboring clusters is larger than the number of neighboring nodes, there are many clusters in the vicinity.

3.3.2. Clustering Process

The cluster status of this protocol can be divided into three categories: (1) unclustered node, (2) cluster member node, and (3) cluster head node.

Figure 5 shows this in a state machine diagram. Each state and condition that changes with each other is as follows.

First, all nodes are in the unclustered node state after initialization. The cluster head periodically broadcasts a head announcement message instead of a discovery message. When the unclustered node receives this information, it first confirms that it has collected all the neighbor’s path information. Path similarity is measured using the path information of the announced heads in the state where path information exists. After measuring the similarity of the neighboring clusters through the path data, the unclustered node requests to join the specific cluster with the best path distance. If the confirmation is answered, the unclustered node enters the cluster member state.

When becoming a cluster member, a node proves its connectivity by responding to the cluster head announcement periodically requested by the discovery answer. However, if an announcement is not received more than three times from the participating cluster head, we return to the unclustered node and perform discovery. In addition, when the path distance value to the cluster head of the neighbor cluster to which the cluster does not belong is better, the cluster head sends a join request message to the cluster head through the cluster assignment message. When a confirmation is received, it becomes a member of the cluster, just like an unclustered node.

However, if there are no nodes in the vicinity, the node will appoint itself as cluster head and implement cluster head announcement. In this state, if three neighboring nodes have not responded and after three timeouts, they become unclustered nodes again and perform discovery. When the node becomes a cluster head, its ID is used as a cluster ID. The neighboring nodes can confirm that the cluster head is the cluster head by confirming that the cluster ID is the same as the node ID.

If the node responding to the cluster head announcement message is an unclustered node, it requests the path data and performs the cluster head announcement again.

In contrast, if the node responding to the cluster head announcement message is another cluster head node and the cluster size of the other party is large, the path distance is checked. If the path distance is within the threshold, it returns to the unclustered node and performs discovery again.

Each node has a neighbor table as shown in Figure 6, as well as exchanges path information at the first contact. This causes overhead, but since the path information does not change, the exchange can be performed only once. Therefore, in the long term, the ratio of total traffic overhead is small compared to the overhead due to frequent connectivity verification.

3.3.3. Message Format for a Clustering Process

The proposed PCDP has the following general message protocol. Figure 7 illustrates the general message protocol of the PCDP. All protocols of the PCDP are derived from the PCDP general message format. PCDP is a protocol based on WAVE Short Message and is basically an implemented protocol for the transmission method, such as Transmission Control Protocol (TCP) and User Datagram Protocol (UDP).

The discovery message is shown in Figure 8. This is a message used in the discovery process described above, in which a neighbor is identified, or a new neighbor cluster is identified in a situation where a cluster is not assigned. In particular, since members become cluster members, ordinary members do not use discovery messages. This is because the cluster head is connected to 1-hop and the dissemination message is unconditionally forwarded to the head.

The discovery answer message in Figure 9 is the reply to the node when it receives the discovery message. This is used to accumulate the connection probability in the case of the existing CPB, but it is used only in the PCDP to identify the neighboring node.

The head announcement message in Figure 10 is used to notify the neighboring node that it is the head. Members use the discovery answer message to report to the head that they are connected.

If the unclustered node receives it, it asks the subscription according to the priority following the path information, as described above.

Figure 11 illustrates the cluster assignment request message format. For a node receiving an announcement from a neighboring cluster head, generally, an unclustered node determines whether to join by considering the path distance. If the node wants to join, the ID of the cluster head in the cluster ID field of the cluster assignment request message is unicast.

The format of the cluster confirmation message is shown in Figure 12. The cluster head that received the cluster assignment request from the neighbor node normally receives it and informs it through the cluster confirmation message that it will participate as a cluster member.

Figure 13 shows the path announcement message format. When a node encounters a source ID for the first time, it automatically broadcasts a path announcement message, as shown in Figure 13. Each path is an integer of four bytes, which causes a large overhead when the first neighbor is encountered. However, this is a one-time message because the path has not changed. Therefore, it has a small effect in the long term.

3.4. Data Dissemination Protocol

3.4.1. A Data Dissemination Algorithm

As described above, this protocol includes a data dissemination process. The main algorithm of the data dissemination process is given in Algorithm 3. Since Algorithm 3 can be described as a callback procedure that processes a message as it is received by each node, the time complexity is O (1).

Algorithm 3 Data dissemination algorithm
	Parameter m: received message, n: current node
1.	If n is in a cluster, then
2.	If the source’s cluster ID $\ne$ n’s cluster ID, then
3.	Set m’s source and cluster ID field to n’s and broadcast m
4.	Else if n is the cluster head, then
5.	Set m’s source to n’s and broadcast m
6.	Else then
7.	Drop m
8.	Else then
9.	Set m’s source to n’s and broadcast m

When node n receives a dissemination message, it first checks to see if it belongs to a particular cluster. That is, it is verified that n is an unclustered node.

If the node is an unclustered node, the message is retransmitted because it is more important to reduce the redundancy than to increase the data propagation rate. When retransmitting, the source ID of the message is changed to itself and the cluster ID is −1, that is, an unclustered node.

If node n is a cluster head or a cluster member, we verify that the source cluster ID of message m is equal to itself. If it is not the same and if n is a head, we broadcast the field by changing the field of m. Additionally, m is stored in list lst, including the time it was passed. In the case of a message received from the same cluster member, retransmission is performed when there is a neighbor node belonging to another cluster. If not, message m is dropped.

The cluster head receives a neighbor attention message when it encounters a new neighbor cluster from its neighboring member nodes. At this time, if a message not previously transmitted is stored in lst, it is broadcasted. It also updates the timestamp of the message.

If timeout tm has elapsed since the time of the first delivery of the message in lst, the message is deleted from lst. Timeout t_m is calculated as Equation (7).

$$t_m=\frac{2d_l}{v}$$

(7)

In Equation (7), v is the average speed (m/s) measured over the last minute of the head and d_l is the length of the normal block. In other words, this means that the message is stored and transmitted while passing through two blocks. Therefore, more messages are propagated to other clusters, and the information propagation rate of the entire network can be increased.

As shown in Figure 14, messages are stored in the list with the message specific ID. This field is an ID for internal identification, and it does not matter whether it is a non-overlapping line (such as a hash) using a source cluster ID that is first received and a timestamp of the first received time.

Next, whenever a member encounters a new cluster, it forwards the cluster attention message to the head. At this time, the head broadcasts the stored message and records it in the forwarded message table.

Figure 15 shows the forwarded message table, which is described above. A cluster head does not broadcast if there is already a transmission record in the forwarded message table. If the message is timed out, the related record in the forwarded message table is dropped. Through this process, more redundant messages can be reduced.

3.4.2. Message Format for a Data Dissemination Process

Figure 16 shows the packet structure used in the data dissemination process proposed in this protocol. As described above, in the data dissemination process, the receiving node changes the source ID and source cluster ID fields. The receiving node inputs its own ID into the source ID field when retransmitting and inputs the ID of the cluster to which the node belongs in the current cluster ID field.

If the member finds a cluster that is different from the neighbor of the neighbor, it sends a cluster detect message as shown in Figure 17. If it is not the head of the sender, it drops it and the head rebroadcasts the saved message as described above.

4. Results

In this section, we compare the cluster holding time, cluster retention rate, message propagation rate, and overhead of the proposed clustering protocol compared to the existing CPB.

CPB is one of the most effective solutions to date on V2X’s biggest challenge, which is mobility, and regards mobility as the biggest issue in this document. Because this is a problem that we pay attention to, this paper focuses on the comparison with CPB.

If the algorithms and protocols presented in this paper are superior to CPBs, it can be demonstrated that the solution to the autonomous V2X clustering solution using vehicle paths is more effective than the algorithms outlined so far.

4.1. Simulation Environment

Veins (Vehicles in Network Simulation) were used for the experiments. The software is an open source framework for OMNeT ++ and SUMO-based vehicular network simulation [38]. For this experiment, the intersection required for the experiment was constructed using SUMO [39].

Experiments were carried out by setting up a complete grid-shaped virtual zone rather than using actual roads to obtain formalized data. The shape of this area is shown in Figure 18.

Table 2. Simulation Variables.

Variable	Value	Unit
Area Size	36,000	m2
Grid Size	1000	m2
Size of Grid	6 × 6
Maximum Speed	80	km/h
Number of Nodes Per Route	5
Number of Routes	924
Simulation Time	18,000	S
Bitrate	6	Mbps
Signal Strength	−20	dBm

shows the variables used in the experiment. Roads 1000 m in length are arranged as 6 × 6 grids, and the simulation time is approximately 36,000 seconds using the whole route. Vehicles are designed to cross the number of paths that can come from the grid. In each case, five vehicles pass through, and there are 924 total routes.

4.2. Cluster Robustness Evaluation

The survivability of the cluster is confirmed as follows. At the first road in the lattice-shaped experimental environment, 5620 cars start simultaneously. It then stores the first connected cluster members and the number of cluster members that are disconnected each time they cross an intersection.

The number of cluster members that have not been missed is then divided by the number of cluster members that were initially connected to each time they crossed the intersection. Because there are seven intersections in this experimental environment, we measure every seven iterations.

The results are shown in Figure 19. The number of cluster members in the CPB decreased sharply in the experimental environment with many intersections. In contrast, the PCDP showed that the number of members consisted of the first members, even after the intersections were steadily maintained.

Only 64.5% of the CPB maintained the first cluster on the entire network, even after the first iteration, and only 4.632% after the last iteration was the same as the first cluster member.

However, the percentage of PCDP in the same cluster after the first iteration reached 92.5%, and 57.92% remained after the last iteration.

4.3. Overhead Evaluation

The measurement of protocol overhead proceeds as follows. Simulation with two protocols is performed to analyze the accumulated message amount per unit time.

The CPB protocol requires that all nodes send and receive discovery messages periodically, whereas PCDP does not have to do all nodes; only the cluster head periodically issues announcements. However, the PCDP must request and transmit path information whenever it encounters a new node. This is longer than discovery, but it is expected that overhead will be reduced in the long term because it is only required to be performed once per node.

The results are shown in Figure 20. If the node density is very low or the execution time is short, the overhead of the existing CPB may be smaller but insignificant, and the amount of overhead accumulated in the CPB is gradually increased.

4.4. Data Dissemination Rate Evaluation

This section is about an evaluation for the data dissemination rate of the protocols. As previously stated, clustering data dissemination protocols should properly exclude messages from nodes other than their clusters to prevent flooding. If a protocol has been properly prioritized, it will have a higher data dissemination rate across the network compared to other protocols.

In this experiment, an arbitrary node is periodically selected every five seconds, and a dissemination message is sent from the corresponding node. When each message is disseminated and finally dropped and extinguished on the network, the number of nodes that existed in the area at the time of the first message transmission (i.e., the network size and the number of nodes that actually received the message) are measured.

Figure 21 is the message dissemination rate calculated by accumulating the number of nodes that successfully received the message and those that needed to receive the message. We see that the dissolution rate converges gradually as the two algorithms are repeated. Depending on the context within the scenario, the nodes may be close to each other or scattered, but the proposed protocol has a higher propagation rate than CPB. The converged dissemination rate is approximately 22.63% for CPB and 53.03% for the proposed protocol.

5. Conclusions

As the demand for V2X communication increases and the number of IoT entities increases, the need for VANET capable of autonomous configuration between nodes is emerging. Among them, the clustering-based algorithm is widely adopted as a compromise between a fully connected mesh network and a central control network via a controller.

The clustering algorithms can reduce the redundancy and control over the communication nodes without the central control by controlling the cluster head. However, it is fundamentally a method that is largely influenced by the survivability of the cluster. Therefore, there has been significant effort to overcome this problem, and the CPB protocol introduced in this paper is one such strategy.

Despite much effort, however, all the research is based only on the information currently available. Therefore, its effectiveness is greatly reduced in future Internet environments and cannot exceed the limit of the clustering algorithm. Therefore, this paper assumes an autonomous mobile automobile age network and develops algorithms with more efficiency, high robustness, and less overhead.

This paper presents the idea of clustering by using precise path information which has not been utilized or cannot be utilized. It is meaningful that the paper provided a clustering algorithm suitable for the autonomous vehicle era at present. In addition, this paper can be a stimulus to promote research in this field where such research is not yet active.

However, since it is difficult to conduct a large-scale autonomous driving experiment, there are limitations in not verifying efficiency when various kinds of fading are applied on actual roads.

Therefore, in the future, it is necessary to study the algorithm presented in this paper in actual road environment and overcome various physical limitations of vehicle nodes in V2X environment.