# An MSCN-Based Virtual Computing Cell-Oriented BSM Dissemination Mechanism

Authors: Lei Ye; Yuping Wu; Qingwen Han; Xiaoyuan Zhang; Lingqiu Zeng; Yuqing Chen; Xinhai Chen
Journal: Mobile Information Systems
 (2021)

---

## Abstract

With the concept of multiaccess edge computing (MEC) being put forward, Roadside Unit (RSU) is considered as a valid application provider, which not only executes transmission resource allocation and data processing-related computing but also provides real-time applications to road vehicles. However, when fixed roadside nodes communicate with mobile vehicles, the high service migration rate could influence real-time feature of corresponding service. Moreover, vehicle density also affects service performance. Hence, in this paper, a two-processing layer architecture is constructed. A new concept, mobile secondary computing node (MSCN), which is used to compose mobile computing layer, is defined, and the number of MSCN changes dynamically with the vehicle density. Then, MSCN oriented virtual computing cell (VirCC), while corresponding to resource allocation approach and vehicle message dissemination mechanism, is designed. A network simulator (NS-3.28) is employed to investigate the performance of the proposed architecture. The simulation results show that the proposed architecture significantly improves both communication performance and computing efficiency.


---

## Body

## 1. Introduction

C-V2X technology will serve as the foundation for vehicles to communicate with each other and everything around them, providing 360° nonline-of-sight awareness and a higher level of predictability for enhanced road safety and autonomous driving. Both academic and industry researchers agree that vehicle’s real-time data are an important and valuable source for automatic driving applications. Therefore, edge computing nodes, such as multiaccess edge computing nodes (MECNs) [1] and fog computing nodes (FCNs) are introduced to establish an open cloud environment in a close proximity to the radio access network (RAN) accessible by third parties in an effort to overcome the shortcomings of centralized cloud computing in terms of latency and throughput [2]. In this case, vehicle to everything (V2X) network not only serves as a bit pipe that is used to exchange messages but also executes data processing task. Moreover, the real-time and effective performance of data processing task deadly influences application’s performance. MEC oriented data processing performance is decided by two key factors. The one is the performance of vehicle data dissemination, and the other is the rationality of computing resource allocation.RSU, whose main function is to facilitate communication between vehicles and transportation infrastructure by transmitting data, is considered as one of the key computing resources in fog computing infrastructure and also serves as computing node in MEC infrastructure [3, 4]. Both researchers and industries believe that RSU oriented MEC could provide real-time service for autonomous vehicles, such as local driving trajectory plan and regional vehicle distribution information sharing. It is well known that RSUs are installed along roadside. The stability of communication link between RSU and vehicle’s OBU (On-board Unit) is always influenced by Doppler shift, which is defined as the change in frequency of sound wave due to a reflector moving towards or away from an object, which in the case of ultrasound is the transducer. On the other hand, even RSUs collect vehicles information successfully; because of the processing delay of MEC, RSU might not provide valid processing output to corresponding vehicles [5].According to distribution feature of city bus, Chongqing, China, we deduce that bus net could be considered as a full coverage network. Our previous work shows that bus-oriented method is useful to increase data dissemination rate successfully [2, 6]. Hence, buses, equipped with powerful communication and storage capability, are considered as substitute of RSU and serve as mobile sink nodes. Then, in this paper, we propose a two-layer processing infrastructure, in which RSUs act as primary computing nodes, and selected mobile nodes-bus nodes, serve as secondary computing nodes, namely, MSCN, which is the core of virtual computing cell (VirCC) and provides computing resource to road vehicles. In the proposed infrastructure, two research points, namely, MSCN selection method and network resource allocation mechanism, should be considered.Definition 1.
Mobile Assisted Computing Node MSCN Mobile assisted computing nodes (MSCNs) are a set of specific vehicle nodes, such as buses and taxis, which serves as secondary computing node to execute local computing tasks. MSCN provides computing resource to regional road vehicle and upload computing results to RSU to support corresponding service.Due to the instinct features of vehicle nodes, such as dynamic topology, dynamic computing demand, and dynamic cruising speed, two problems are posed for the selection of MSCN. Firstly, the number of MSCN relates to regional vehicle density, which changes dynamic in real-time. Secondly, computing efficiency of MSCN is decided by the relationship between MSCN and surrounding vehicles. Hence, validity of MSCN is associated with investigating the problem of cluster head selection. A composite weight parameter, which considers mobile similarity, position factor, and distance factor, is defined to select MSCN. Then, we consider both regional density feature and intervehicle relationship as the basis of VirCC generation mechanism design.In general, the purpose of layering network structure is to make better use of network resources and transmission media. In the proposed architecture, both RSU and MSCN could provide computing service. The only problem is who acts the role of resource allocator. In general, RSU could be used to allocate frequency points and time slots to regional vehicle nodes. However, in high vehicle density condition, both computing resource and communication resource are inadequate. To relief the crisis of communication resource scarcity, a transmission range control approach should be used, and MSCN should serve as local resource allocator. Then, in this paper, a message dissemination mechanism, which includes both resource allocation method and corresponding BSM transmission cycle design, is proposed.Specifically, the contributions of this paper are as follows:(1)
Mobile secondary computing node (MSCN) is defined to collect and process road vehicle information;(2)
A two-layer processing architecture based on MSCN is proposed, in which RSU serves as the main computing node and the selected mobile node serves as the secondary computing node;(3)
An adaptive VirCC generation mechanism is proposed.(4)
A VirCC-based vehicle message dissemination mechanism is proposed.The rest of this article is organized as follows: Section2 presents the related work, and the proposed two-layer processing architecture is in Section 3. In Section 4, the generation mechanism of VirCC is introduced. The information distribution mechanism inside the virtual area is introduced in Section 5. Section 6 is the analysis of simulation results. The conclusion is given in Section 7.


## 2. Related Work

In the past few years, researchers devote to improving reliability and real-time feature of V2X network and realize that MEC could provide computing capability and real-time service for road vehicles. Hence, MEC-related technologies have attracted many researchers’ attention. In this section, we analysis related works from three aspects, which are network architecture improvement, vehicle cluster management, and rationality of resource allocation.


### 2.1. Network Architecture

In traditional cloud computing architecture, all computing tasks are executed at cloud data center [7]. Communication delay of data uploading and downloading process deadly influences application performance. In order to meet the requirements of autonomous driving, researchers intend to take full advantage of roadside equipment and vehicle on-board equipment, which are considered as edge devices and could provide an approach to overcome the shortcomings of centralized cloud computing in terms of latency and throughput.In terms of architecture, MECs use centralize mode, while fog computing employs distribute mode [8, 9].MEC node, which is defined as an implementer of edge computing, could bring computational and storage capacities to reduce latency and improve context awareness. The MEC nodes are usually co-located with the radio network controller or a macrobase-station [10]. In a vehicle-oriented network, MEC platform can be flexibly deployed on various nodes, such as Roadside Units (RSU) and evolving Node B (eNodeB). In literature [11], an MEC server is deployed at RSU to improve real-time feature. However, both RSU and eNodeB are fixed nodes, which could not provide effectual computing support to mobile vehicle nodes for two reasons. Firstly, V2I communication performance is deadly influenced by Doppler shift. Secondly, due to vehicle node’s high mobility feature, the handover connection between vehicle nodes and MEC platform will be established frequently; this way not only increases the cost of maintaining the handover connection but also reduces the efficiency of computing.On the other hand, fog computing nodes (FCNs) utilize devices such as M2M gateways and wireless routers to provide computing capability. FCNs can be any node between the vehicle terminal and the core cloud architecture used to calculate and store data from vehicle terminal locally. In literature [12], the authors discuss about the feasibility fog node and think that quality of service and application could be greatly improved by making full use of computing capability of vehicular nodes. However, industry doubts the feasibility of FCNs, which have no operation managers to ensure their credibility.As one of the basic service tools, city bus could be considered as a special kind of vehicle nodes, which could provide credible service to social vehicles. Hence, in our previous work [2], we analysis the coverage feature of bus net and proposed a fog computing architecture. The experimental results show that the structure can effectively improve the communication efficiency.Therefore, in this paper, we propose a two-layer processing architecture, in which a new concept, MSCN, is defined.


### 2.2. Vehicle Clustering

Clustering method is a traditional and hot thesis in the field of vehicular network. In the past few years, researchers proposed a large amount of clustering algorithm, which could be divided into three categories: (1) ID-oriented, (2) location-based, and (3) weight-based.ID-oriented clustering algorithm uses node ID as the basis of cluster head selection. In 2002, Lin [13] employed lowest-ID algorithm in mobile node clustering. Fan [14] improved the lowest-ID algorithm and introduced the concept of cluster head working time. However, the stability of clusters should decrease with the increase of cruising speed. Hence, ID-oriented clustering algorithm will always be used in conjunction with other methods, such as location-oriented method and intervehicle relationship-oriented method. Literature [15] proposed a synthesis algorithm, which considers node ID, geographical proximity, and speed difference as the basis for cluster header selection.On the other hand, location-based clustering algorithms concern about intervehicle spatial relationship. In [16], a region-based clustering mechanism is proposed to cluster vehicles according to region location to reduce the contention period introduced by vehicle access channels in the MAC protocol. However, road vehicle clustering is influenced by both spatial relationship and vehicle density feature. Literature [17] employs a density-related factor, number of neighbors, as the cluster head selection criteria. Deng et al. [18] proposed an effective spatial clustering algorithm based on grid and density, which supports multidensity clustering.Obviously, ID-oriented clustering algorithms and location-based clustering algorithms could be considered as the basis of weight clustering algorithms. Then, the algorithm optimization problem is transformed into a weight factor optimization problem.The weighted clustering algorithm (WCA) assigns different weight coefficients to various parameters affecting the performance of the cluster head and finally selects the node as the clustering head according to the weight [19]. Compared with the method of selecting the cluster head based on a single attribute, this algorithm takes into account the influence of different factors on the cluster head, and the generated cluster is more stable. In general, the weight factor is constructed according to a series factor, such as vehicle cruising characteristics (including direction, speed, and acceleration) [20, 21], moving similarity [22], and local vehicle density.In this paper, a comprehensive weight factor, which considers moving similarity, position factor, and distance factor, is defined to select MSCN. A VirCC join index, which denotes the position relationship between MSCN and road vehicle, is used to generate VirCC.


### 2.3. Communication Resource Allocation

Until now, V2X system performance is restricted by communication resource.In general, DSRC nodes use contention-based method to obtain communication resource. However, VANET also supports RSU centric allocation mode [23]. On the other hand, LTE-V employs resource pool mechanism, which supports both centric and distribute allocation mode, to alleviate channel congestion. However, due to vehicle’s mobility feature, RSU could not competent to the task of resource allocation [2]. In this paper, we use specific mobile nodes as the resource allocator. The only question is how to optimize resource allocation method and set transmission priority. The basic approach is to determine transmission priority according to request priority [23]. In the proposed architecture, MSCN, which provides computing resource to regional vehicle and supports RSU’s service providing, should be granted with high priority. Hence, we design a two-step communication resource allocation method. Firstly, RSU allocates transmission resource to MSCN. Then, the remaining resource is allocated to other road vehicles. In [24], mobile similarity is selected as the basis of priority setting. Kim et al. [25] proposed a resource allocation scheme that considers various attributes of the vehicle when allocating resources, such as speed, density, and direction. Aiming to provide computing ability to vehicle nodes, in the proposed architecture, road vehicles are divided into several VirCCs, who’s centric is MSCN. To improve the processing effectiveness of MSCN, we employ a VirCC oriented mechanism, which allocates adjacent time slots to vehicle nodes belonging to the same VirCC.


## 2.1. Network Architecture

In traditional cloud computing architecture, all computing tasks are executed at cloud data center [7]. Communication delay of data uploading and downloading process deadly influences application performance. In order to meet the requirements of autonomous driving, researchers intend to take full advantage of roadside equipment and vehicle on-board equipment, which are considered as edge devices and could provide an approach to overcome the shortcomings of centralized cloud computing in terms of latency and throughput.In terms of architecture, MECs use centralize mode, while fog computing employs distribute mode [8, 9].MEC node, which is defined as an implementer of edge computing, could bring computational and storage capacities to reduce latency and improve context awareness. The MEC nodes are usually co-located with the radio network controller or a macrobase-station [10]. In a vehicle-oriented network, MEC platform can be flexibly deployed on various nodes, such as Roadside Units (RSU) and evolving Node B (eNodeB). In literature [11], an MEC server is deployed at RSU to improve real-time feature. However, both RSU and eNodeB are fixed nodes, which could not provide effectual computing support to mobile vehicle nodes for two reasons. Firstly, V2I communication performance is deadly influenced by Doppler shift. Secondly, due to vehicle node’s high mobility feature, the handover connection between vehicle nodes and MEC platform will be established frequently; this way not only increases the cost of maintaining the handover connection but also reduces the efficiency of computing.On the other hand, fog computing nodes (FCNs) utilize devices such as M2M gateways and wireless routers to provide computing capability. FCNs can be any node between the vehicle terminal and the core cloud architecture used to calculate and store data from vehicle terminal locally. In literature [12], the authors discuss about the feasibility fog node and think that quality of service and application could be greatly improved by making full use of computing capability of vehicular nodes. However, industry doubts the feasibility of FCNs, which have no operation managers to ensure their credibility.As one of the basic service tools, city bus could be considered as a special kind of vehicle nodes, which could provide credible service to social vehicles. Hence, in our previous work [2], we analysis the coverage feature of bus net and proposed a fog computing architecture. The experimental results show that the structure can effectively improve the communication efficiency.Therefore, in this paper, we propose a two-layer processing architecture, in which a new concept, MSCN, is defined.


## 2.2. Vehicle Clustering

Clustering method is a traditional and hot thesis in the field of vehicular network. In the past few years, researchers proposed a large amount of clustering algorithm, which could be divided into three categories: (1) ID-oriented, (2) location-based, and (3) weight-based.ID-oriented clustering algorithm uses node ID as the basis of cluster head selection. In 2002, Lin [13] employed lowest-ID algorithm in mobile node clustering. Fan [14] improved the lowest-ID algorithm and introduced the concept of cluster head working time. However, the stability of clusters should decrease with the increase of cruising speed. Hence, ID-oriented clustering algorithm will always be used in conjunction with other methods, such as location-oriented method and intervehicle relationship-oriented method. Literature [15] proposed a synthesis algorithm, which considers node ID, geographical proximity, and speed difference as the basis for cluster header selection.On the other hand, location-based clustering algorithms concern about intervehicle spatial relationship. In [16], a region-based clustering mechanism is proposed to cluster vehicles according to region location to reduce the contention period introduced by vehicle access channels in the MAC protocol. However, road vehicle clustering is influenced by both spatial relationship and vehicle density feature. Literature [17] employs a density-related factor, number of neighbors, as the cluster head selection criteria. Deng et al. [18] proposed an effective spatial clustering algorithm based on grid and density, which supports multidensity clustering.Obviously, ID-oriented clustering algorithms and location-based clustering algorithms could be considered as the basis of weight clustering algorithms. Then, the algorithm optimization problem is transformed into a weight factor optimization problem.The weighted clustering algorithm (WCA) assigns different weight coefficients to various parameters affecting the performance of the cluster head and finally selects the node as the clustering head according to the weight [19]. Compared with the method of selecting the cluster head based on a single attribute, this algorithm takes into account the influence of different factors on the cluster head, and the generated cluster is more stable. In general, the weight factor is constructed according to a series factor, such as vehicle cruising characteristics (including direction, speed, and acceleration) [20, 21], moving similarity [22], and local vehicle density.In this paper, a comprehensive weight factor, which considers moving similarity, position factor, and distance factor, is defined to select MSCN. A VirCC join index, which denotes the position relationship between MSCN and road vehicle, is used to generate VirCC.


## 2.3. Communication Resource Allocation

Until now, V2X system performance is restricted by communication resource.In general, DSRC nodes use contention-based method to obtain communication resource. However, VANET also supports RSU centric allocation mode [23]. On the other hand, LTE-V employs resource pool mechanism, which supports both centric and distribute allocation mode, to alleviate channel congestion. However, due to vehicle’s mobility feature, RSU could not competent to the task of resource allocation [2]. In this paper, we use specific mobile nodes as the resource allocator. The only question is how to optimize resource allocation method and set transmission priority. The basic approach is to determine transmission priority according to request priority [23]. In the proposed architecture, MSCN, which provides computing resource to regional vehicle and supports RSU’s service providing, should be granted with high priority. Hence, we design a two-step communication resource allocation method. Firstly, RSU allocates transmission resource to MSCN. Then, the remaining resource is allocated to other road vehicles. In [24], mobile similarity is selected as the basis of priority setting. Kim et al. [25] proposed a resource allocation scheme that considers various attributes of the vehicle when allocating resources, such as speed, density, and direction. Aiming to provide computing ability to vehicle nodes, in the proposed architecture, road vehicles are divided into several VirCCs, who’s centric is MSCN. To improve the processing effectiveness of MSCN, we employ a VirCC oriented mechanism, which allocates adjacent time slots to vehicle nodes belonging to the same VirCC.


## 3. System Model

In this section, the proposed MSCN-oriented infrastructure is described in detail. As mentioned earlier, the proposed infrastructure includes two-processing layers, which are roadside processing layer and MSCN processing layer. In this section, the proposed infrastructure is presented firstly. Then, the corresponding service flow is introduced. At last, MSCN-oriented virtual computing cell (VirCC) is defined, and corresponding cases are analyzed.


### 3.1. MSCN-Oriented Infrastructure

The proposed MSCN-oriented infrastructure is shown in Figure1.Figure 1
MSCN-oriented infrastructure.As shown in Figure1, the proposed infrastructure includes three layers, which are general vehicle node layer and the two-processing layer we defined, namely, MEC layer and MSCN layer.(1)
Layer 1: MEC Layer MEC layer, which includes RSUs, corresponding edge computing server, and local database, is used to process regional vehicle information and provide processing results to support vehicle application implementation. RSUs could serve as communication and computing resource allocators.(2)
Layer 2: MSCN Layer MSCN layer includes public operational vehicles, such as city bus, taxi, and other service vehicles. MSCNs are specific mobile nodes, which could provide computing resource to social vehicles and processing results to MEC layer. MSCNs could serve as communication resource allocators on demand.(3)
Layer 3: General Vehicle Node Layer Layer 3 contains all general social vehicles, which communicate with each other via direct connection mode, such as PC5 and DSRC. In this paper, we assume that all road vehicles are equipped with a PC5 interface. Specifically, road vehicles receive application-oriented information through the PC5 interface and update BSMs to distributed computing nodes.


### 3.2. Service Flow

Corresponding service flow is described as follows:Step 1: road vehicles periodically upload BSM messages to local MSCN;Step 2: distributed MSCNs collect and process BSM messages and then upload processing results to upper-level RSU;Step 3: MEC layer collects MSCN message and generates regional traffic information, which could be used to support autonomous vehicle decision making progress;Step 4: according to road vehicle service application, MEC layer provides service information to regional vehicle via PC5 interface.Note that in this architecture, RSUs service as service provider, while MSCNs can be either the source node or the relay node.


### 3.3. Virtual Computing Cell (VirCC)

Here, we assume that vehicle nodes in the geographic area of one RSU coverage belong to one cluster. According to road test results, provided by Chongqing Vehicle Test and Research Institute Co., Ltd., the reliable communication radius of LTE-V is about 150 meters. To ensure all road vehicles find an access RSU, here we assume the radius of basic vehicle cluster as 300 m.Definition 2.
Virtual Computing Cell Virtual computing cell (VirCC) is a group of neighboring vehicles, which includes one MSCN and multiple vehicle nodes. A vehicle cluster could be divided into multiple VirCC, and the number of VirCC is decided by regional vehicle density.Here, two cases, which are low-density case and high-density case, are discussed to explain the generation mechanism of VirCC.


#### 3.3.1. Low-Density Case

At low density, we stipulate that VirCC is evenly arranged in the cluster and select the MSCN corresponding to a certain VirCC as the cluster head. In order to ensure that the communication range of the cluster head is the entire cluster, we set the number of VirCC to 3. Here, the total length of vehicle cluster is assumed asL, while the diameter of three virtual cells is about L/3. Therefore, the MSCN of the middle VirCC is closest to the center of the cluster, and selecting this MSCN as the cluster head can ensure that the cluster head has the best communication coverage. VirCC of low-density case is shown in Figure 2. The red MSCN is considered as the cluster header, who serves as transmission controller for time-slot allocation. The other two MSCNs (blue) in Figure 2 implement computing task only.Figure 2
VirCC of low-density case.


#### 3.3.2. High-Density Case

VirCC of high-density case is shown in Figure3. The whole cluster is divided into 4 VirCCs. Diameter of VirCC is decided by road vehicle distribution factor.Figure 3
VirCC of high-density case.In high-density case, both computing resource and communication resource are insufficient.Obviously, regional computing ability increases with the increase of MSCN number, which should be decided by computing requirements. Hence, number of VirCC relates to regional vehicle density.On the other hand, transmission range control could be used to relief communication resource scarcity by improving resource reuse rate. Here, the transmission radius is calculated as follows:(1)R=−1ρln1−P1/n,where R is the transmission radius, ρ is the local vehicle density, P is the road connectivity probability, and n is the number of vehicle nodes. The relationship between transmission radius and node density under different connected probabilities is shown in Figure 4.Figure 4
The relationship between node density and propagation radius.When the connected probabilities are the same, the higher the node density, the shorter the transmission radius will be.Definition 3.
Density Thresholdρ0Here, we define a density threshold ρ0 to distinguish between high- and low-density scenes of vehicles. According to equation (1), when the density is 0.067 vehicle/m, the communication distance is about 150 m. Therefore, we set the density threshold to 0.067 vehicle/m, when regional vehicle density higher than ρ0, number of VirCC should increase according to vehicle number.


## 3.1. MSCN-Oriented Infrastructure

The proposed MSCN-oriented infrastructure is shown in Figure1.Figure 1
MSCN-oriented infrastructure.As shown in Figure1, the proposed infrastructure includes three layers, which are general vehicle node layer and the two-processing layer we defined, namely, MEC layer and MSCN layer.(1)
Layer 1: MEC Layer MEC layer, which includes RSUs, corresponding edge computing server, and local database, is used to process regional vehicle information and provide processing results to support vehicle application implementation. RSUs could serve as communication and computing resource allocators.(2)
Layer 2: MSCN Layer MSCN layer includes public operational vehicles, such as city bus, taxi, and other service vehicles. MSCNs are specific mobile nodes, which could provide computing resource to social vehicles and processing results to MEC layer. MSCNs could serve as communication resource allocators on demand.(3)
Layer 3: General Vehicle Node Layer Layer 3 contains all general social vehicles, which communicate with each other via direct connection mode, such as PC5 and DSRC. In this paper, we assume that all road vehicles are equipped with a PC5 interface. Specifically, road vehicles receive application-oriented information through the PC5 interface and update BSMs to distributed computing nodes.


## 3.2. Service Flow

Corresponding service flow is described as follows:Step 1: road vehicles periodically upload BSM messages to local MSCN;Step 2: distributed MSCNs collect and process BSM messages and then upload processing results to upper-level RSU;Step 3: MEC layer collects MSCN message and generates regional traffic information, which could be used to support autonomous vehicle decision making progress;Step 4: according to road vehicle service application, MEC layer provides service information to regional vehicle via PC5 interface.Note that in this architecture, RSUs service as service provider, while MSCNs can be either the source node or the relay node.


## 3.3. Virtual Computing Cell (VirCC)

Here, we assume that vehicle nodes in the geographic area of one RSU coverage belong to one cluster. According to road test results, provided by Chongqing Vehicle Test and Research Institute Co., Ltd., the reliable communication radius of LTE-V is about 150 meters. To ensure all road vehicles find an access RSU, here we assume the radius of basic vehicle cluster as 300 m.Definition 2.
Virtual Computing Cell Virtual computing cell (VirCC) is a group of neighboring vehicles, which includes one MSCN and multiple vehicle nodes. A vehicle cluster could be divided into multiple VirCC, and the number of VirCC is decided by regional vehicle density.Here, two cases, which are low-density case and high-density case, are discussed to explain the generation mechanism of VirCC.


### 3.3.1. Low-Density Case

At low density, we stipulate that VirCC is evenly arranged in the cluster and select the MSCN corresponding to a certain VirCC as the cluster head. In order to ensure that the communication range of the cluster head is the entire cluster, we set the number of VirCC to 3. Here, the total length of vehicle cluster is assumed asL, while the diameter of three virtual cells is about L/3. Therefore, the MSCN of the middle VirCC is closest to the center of the cluster, and selecting this MSCN as the cluster head can ensure that the cluster head has the best communication coverage. VirCC of low-density case is shown in Figure 2. The red MSCN is considered as the cluster header, who serves as transmission controller for time-slot allocation. The other two MSCNs (blue) in Figure 2 implement computing task only.Figure 2
VirCC of low-density case.


### 3.3.2. High-Density Case

VirCC of high-density case is shown in Figure3. The whole cluster is divided into 4 VirCCs. Diameter of VirCC is decided by road vehicle distribution factor.Figure 3
VirCC of high-density case.In high-density case, both computing resource and communication resource are insufficient.Obviously, regional computing ability increases with the increase of MSCN number, which should be decided by computing requirements. Hence, number of VirCC relates to regional vehicle density.On the other hand, transmission range control could be used to relief communication resource scarcity by improving resource reuse rate. Here, the transmission radius is calculated as follows:(1)R=−1ρln1−P1/n,where R is the transmission radius, ρ is the local vehicle density, P is the road connectivity probability, and n is the number of vehicle nodes. The relationship between transmission radius and node density under different connected probabilities is shown in Figure 4.Figure 4
The relationship between node density and propagation radius.When the connected probabilities are the same, the higher the node density, the shorter the transmission radius will be.Definition 3.
Density Thresholdρ0Here, we define a density threshold ρ0 to distinguish between high- and low-density scenes of vehicles. According to equation (1), when the density is 0.067 vehicle/m, the communication distance is about 150 m. Therefore, we set the density threshold to 0.067 vehicle/m, when regional vehicle density higher than ρ0, number of VirCC should increase according to vehicle number.


## 3.3.1. Low-Density Case

At low density, we stipulate that VirCC is evenly arranged in the cluster and select the MSCN corresponding to a certain VirCC as the cluster head. In order to ensure that the communication range of the cluster head is the entire cluster, we set the number of VirCC to 3. Here, the total length of vehicle cluster is assumed asL, while the diameter of three virtual cells is about L/3. Therefore, the MSCN of the middle VirCC is closest to the center of the cluster, and selecting this MSCN as the cluster head can ensure that the cluster head has the best communication coverage. VirCC of low-density case is shown in Figure 2. The red MSCN is considered as the cluster header, who serves as transmission controller for time-slot allocation. The other two MSCNs (blue) in Figure 2 implement computing task only.Figure 2
VirCC of low-density case.


## 3.3.2. High-Density Case

VirCC of high-density case is shown in Figure3. The whole cluster is divided into 4 VirCCs. Diameter of VirCC is decided by road vehicle distribution factor.Figure 3
VirCC of high-density case.In high-density case, both computing resource and communication resource are insufficient.Obviously, regional computing ability increases with the increase of MSCN number, which should be decided by computing requirements. Hence, number of VirCC relates to regional vehicle density.On the other hand, transmission range control could be used to relief communication resource scarcity by improving resource reuse rate. Here, the transmission radius is calculated as follows:(1)R=−1ρln1−P1/n,where R is the transmission radius, ρ is the local vehicle density, P is the road connectivity probability, and n is the number of vehicle nodes. The relationship between transmission radius and node density under different connected probabilities is shown in Figure 4.Figure 4
The relationship between node density and propagation radius.When the connected probabilities are the same, the higher the node density, the shorter the transmission radius will be.Definition 3.
Density Thresholdρ0Here, we define a density threshold ρ0 to distinguish between high- and low-density scenes of vehicles. According to equation (1), when the density is 0.067 vehicle/m, the communication distance is about 150 m. Therefore, we set the density threshold to 0.067 vehicle/m, when regional vehicle density higher than ρ0, number of VirCC should increase according to vehicle number.


## 4. VirCC Generation

Obviously, performance of the proposed architecture is mainly determined by the feature of VirCC. In this section, we focus on VirCC generation process. Firstly, MSCN selection criteria are given. Then, the VirCC joining rule is proposed to generate VirCC dynamically.


### 4.1. Number of VirCC

Number of VirCCs is determined by the regional vehicle density and could be calculated as(2)NVirCC=LR,where L is the total length of vehicle cluster; R is the transmission radius. Note here, for low-density case, one vehicle cluster includes three VirCCs.


### 4.2. MSCN Selection Criteria

As mentioned earlier, MSCNs are specific mobile nodes, which could provide computing resource to social vehicles and processing results to MEC layer. The stability of VirCC largely depends on the reasonable selection of MSCN. To make VirCC more stable and sustainable, we define a weight factor, which considers moving similarity feature, relative position, and intervehicle distance, as MSCN selection basis, as follows:(3)W=α1×1−Ssimilarity+α2×fposition+α3×Disi,where Ssimilarity is the mobile similarity factor [2], which is defined as(4)Ssimilarity=∑n=1NSspeed×Sacceleration×SdirectionN,where Sspeed, Sacceleration, and Sdirection are the similarity of speed, acceleration, and heading between candidate MSCN and neighbor node; N is the number of neighbors of candidate MSCN.fposition is the position factor:(5)fposition=xtn−xcn2+ytn−ycn2R,where xtn,ytn is the coordinate of the candidate MSCN, andxcn,ycnare coordinates of the cluster head (CH), and R is the cluster radius.Disi is the distance factor:(6)Disi=∑DijN,where N is the number of neighbors of candidate MSCN, andDij is the normalized distance between node i and node j:(7)Dij=yi−yj2+xi−xj2TR,where xi,yi is the coordinate of i, andxj,yj are coordinates of j, and TR is the radius of coverage area.α1, α2, and α3 are the weighting coefficients of the three attributes. Note here, W∈0,1. The less the W value of MSCN candidate, the more correlative with surrounding vehicles, and correspondingly, the more stable its VirCC is.Then, BSM message is defined as(8)BSMvehicle=ID,Vel,Acce,Dir,Pos,Time.The MSCN selection process is given in Algorithm1, and corresponding variables and functions are explained in Table 1.Algorithm 1: MASN selection.
Input: cluster member set C, bus and taxi set B, center coordinates of the cluster (xcn, ycn), and VirCC number n.Output: MSCN vector: MSCN_vector(1)
For each c ∈ C,do(2)
BSMvehicle_brocast (c)(3)
Tneighbor.pushback (BSMvehicle)(4)
End for(5)
For each b ∈ B,do(6)
W ← cal_MSCNcriteria (Tneighbor)(7)
(xtn, ytn) ← Getposition (b)(8)
VirCCnum ← getVirCC_num ((xtn, ytn), (xcn, ycn))(9)
IfW ≥ getW_min (VirCCnum), then(10)
SetW_min (VirCCnum, W)(11)
MSCNid ← getid (b)(12)
set_MSCN (VirCCnum, MSNCid)(13)
End if(14)
End for(15)
Fori = 1 to n, do(16)
MSCN_vector.pushback (get_MSCN (i))(17)
End for(18)
Return MSCN_vectorTable 1
Explanation for Algorithm1 variables and functions.
Variable/functionExplanationBSMvehicle_brocast (X)VehicleX broadcast BSMvehicle to neighborsTneighborNeighbor table for saving neighbor BSMcal_MSCNcriteria (T)Calculate MSCN selection criteria based on neighbor tableTWThe MSCN selection criteriaGetposition (X)Get the position coordinates of nodeXVirCCnumThe VirCC number that the node belongs togetVirCC_num (X, Y)Obtain the VirCC number of coordinateX according to equation (5)setW_min (X, Y)Set Y to the minimum MSCN selection criteria in VirCCXgetW_min (X)Get the minimum MSCN selection criteria in VirCCXgetid (X)Get the node ID of nodeXMSCNidThe node ID of MSCNSet_MSCN (X, Y)SetY as the MSCN node ID in VirCC Xget_MSCN (X)Get the MSCN node ID in VirCCXnThe number of VirCC calculated according to equation (2)


### 4.3. VirCC Joining Rule

VirCC joining rule is established based on VirCC index, which is calculated as(9)VirCCindex=xi−xj2+yi−yj2+veci−vecj2+accei−accej2+diri−dirj2.Here,xi,yi, veci, accei, and dirirepresent the coordinates, speed, acceleration, and cruising direction of general vehicle nodes, and xj,yj, vecj, accej, and dirj represent the coordinates, speed, acceleration, and cruising direction of MSCN, respectively.After selecting the MSCN, ordinary nodes join the most suitable VirCC. The VirCC joining progress is shown in Algorithm2, while related variables and functions are presented in Table 2.Algorithm 2: VirCC joining rule.
Input: cluster member set C, MSCN vector MSCN_vector.(1)
For each mscn ∈ MSCN_vector, do(2)
BSMvehicle_brocast(mscn)(3)
push_back_BSM (BSMvehicle)(4)
End for(5)
For each c ∈ C,do(6)
indexvector ← cal_VirCCindex (Tc)(7)
VirCCselect ← SelectMin_index (indexvector)(8)
MSCNid ← getMSCNid (VirCCselect)(9)
set_MSCNid (c, MSCN_id)(10)
End forTable 2
Explanation for Algorithm2 variables and functions.
Variable/functionExplanationBSMvehicle_brocast (X)VehicleX broadcasts BSMvehiclepush_back_BSM (BSMvehicle)Put the MSCN’s BSMvehicle into table of neighbor nodeTiTable of nodei for saving BSMvehicle from neighbor MSCNindexvectorThe vector that node stores the VirCC indexcal_VirCCindex (X, Y)The function to calculate VirCC index betweenY and X according to equation (8)SelectMin_index (X)Select the node with the smallest VirCC indexVirCCselectThe VirCC that the node joinsMSCN_idThe node ID of MSCNgetMSCNid (X)Get the MSCN ID of VirCCXSet_MSCNid (X, Y)SetY as the MSCN ID of node X


### 4.4. VirCC Update

Due to the mobility of MSCN or VirCC members, VirCC will also change. The VirCC update procedure is needed to maintain the stability of the VirCC structure according to the changes in the topology. The node perceives the dynamic change of the VirCC structure through periodic messages.


## 4.1. Number of VirCC

Number of VirCCs is determined by the regional vehicle density and could be calculated as(2)NVirCC=LR,where L is the total length of vehicle cluster; R is the transmission radius. Note here, for low-density case, one vehicle cluster includes three VirCCs.


## 4.2. MSCN Selection Criteria

As mentioned earlier, MSCNs are specific mobile nodes, which could provide computing resource to social vehicles and processing results to MEC layer. The stability of VirCC largely depends on the reasonable selection of MSCN. To make VirCC more stable and sustainable, we define a weight factor, which considers moving similarity feature, relative position, and intervehicle distance, as MSCN selection basis, as follows:(3)W=α1×1−Ssimilarity+α2×fposition+α3×Disi,where Ssimilarity is the mobile similarity factor [2], which is defined as(4)Ssimilarity=∑n=1NSspeed×Sacceleration×SdirectionN,where Sspeed, Sacceleration, and Sdirection are the similarity of speed, acceleration, and heading between candidate MSCN and neighbor node; N is the number of neighbors of candidate MSCN.fposition is the position factor:(5)fposition=xtn−xcn2+ytn−ycn2R,where xtn,ytn is the coordinate of the candidate MSCN, andxcn,ycnare coordinates of the cluster head (CH), and R is the cluster radius.Disi is the distance factor:(6)Disi=∑DijN,where N is the number of neighbors of candidate MSCN, andDij is the normalized distance between node i and node j:(7)Dij=yi−yj2+xi−xj2TR,where xi,yi is the coordinate of i, andxj,yj are coordinates of j, and TR is the radius of coverage area.α1, α2, and α3 are the weighting coefficients of the three attributes. Note here, W∈0,1. The less the W value of MSCN candidate, the more correlative with surrounding vehicles, and correspondingly, the more stable its VirCC is.Then, BSM message is defined as(8)BSMvehicle=ID,Vel,Acce,Dir,Pos,Time.The MSCN selection process is given in Algorithm1, and corresponding variables and functions are explained in Table 1.Algorithm 1: MASN selection.
Input: cluster member set C, bus and taxi set B, center coordinates of the cluster (xcn, ycn), and VirCC number n.Output: MSCN vector: MSCN_vector(1)
For each c ∈ C,do(2)
BSMvehicle_brocast (c)(3)
Tneighbor.pushback (BSMvehicle)(4)
End for(5)
For each b ∈ B,do(6)
W ← cal_MSCNcriteria (Tneighbor)(7)
(xtn, ytn) ← Getposition (b)(8)
VirCCnum ← getVirCC_num ((xtn, ytn), (xcn, ycn))(9)
IfW ≥ getW_min (VirCCnum), then(10)
SetW_min (VirCCnum, W)(11)
MSCNid ← getid (b)(12)
set_MSCN (VirCCnum, MSNCid)(13)
End if(14)
End for(15)
Fori = 1 to n, do(16)
MSCN_vector.pushback (get_MSCN (i))(17)
End for(18)
Return MSCN_vectorTable 1
Explanation for Algorithm1 variables and functions.
Variable/functionExplanationBSMvehicle_brocast (X)VehicleX broadcast BSMvehicle to neighborsTneighborNeighbor table for saving neighbor BSMcal_MSCNcriteria (T)Calculate MSCN selection criteria based on neighbor tableTWThe MSCN selection criteriaGetposition (X)Get the position coordinates of nodeXVirCCnumThe VirCC number that the node belongs togetVirCC_num (X, Y)Obtain the VirCC number of coordinateX according to equation (5)setW_min (X, Y)Set Y to the minimum MSCN selection criteria in VirCCXgetW_min (X)Get the minimum MSCN selection criteria in VirCCXgetid (X)Get the node ID of nodeXMSCNidThe node ID of MSCNSet_MSCN (X, Y)SetY as the MSCN node ID in VirCC Xget_MSCN (X)Get the MSCN node ID in VirCCXnThe number of VirCC calculated according to equation (2)


## 4.3. VirCC Joining Rule

VirCC joining rule is established based on VirCC index, which is calculated as(9)VirCCindex=xi−xj2+yi−yj2+veci−vecj2+accei−accej2+diri−dirj2.Here,xi,yi, veci, accei, and dirirepresent the coordinates, speed, acceleration, and cruising direction of general vehicle nodes, and xj,yj, vecj, accej, and dirj represent the coordinates, speed, acceleration, and cruising direction of MSCN, respectively.After selecting the MSCN, ordinary nodes join the most suitable VirCC. The VirCC joining progress is shown in Algorithm2, while related variables and functions are presented in Table 2.Algorithm 2: VirCC joining rule.
Input: cluster member set C, MSCN vector MSCN_vector.(1)
For each mscn ∈ MSCN_vector, do(2)
BSMvehicle_brocast(mscn)(3)
push_back_BSM (BSMvehicle)(4)
End for(5)
For each c ∈ C,do(6)
indexvector ← cal_VirCCindex (Tc)(7)
VirCCselect ← SelectMin_index (indexvector)(8)
MSCNid ← getMSCNid (VirCCselect)(9)
set_MSCNid (c, MSCN_id)(10)
End forTable 2
Explanation for Algorithm2 variables and functions.
Variable/functionExplanationBSMvehicle_brocast (X)VehicleX broadcasts BSMvehiclepush_back_BSM (BSMvehicle)Put the MSCN’s BSMvehicle into table of neighbor nodeTiTable of nodei for saving BSMvehicle from neighbor MSCNindexvectorThe vector that node stores the VirCC indexcal_VirCCindex (X, Y)The function to calculate VirCC index betweenY and X according to equation (8)SelectMin_index (X)Select the node with the smallest VirCC indexVirCCselectThe VirCC that the node joinsMSCN_idThe node ID of MSCNgetMSCNid (X)Get the MSCN ID of VirCCXSet_MSCNid (X, Y)SetY as the MSCN ID of node X


## 4.4. VirCC Update

Due to the mobility of MSCN or VirCC members, VirCC will also change. The VirCC update procedure is needed to maintain the stability of the VirCC structure according to the changes in the topology. The node perceives the dynamic change of the VirCC structure through periodic messages.


## 5. Message Dissemination Mechanism

In the proposed architecture, message dissemination progress varies according to local vehicle density. As mentioned earlier, in this paper, we consider two cases: low-density case and high-density case.


### 5.1. Low-Density Case

For low-density case, cluster header serves as controller, which allocates transmission time slot to all cluster members. The communication resource allocation progress includes three steps, described as follows:(i)
Step 1: RSU allocates time slot to MSCNs, which are given with high transmission priority to communicate with RSU. Note here, RSU should decide MSCN’s occupied time-slot number according to the upload throughput.(ii)
Step 2: RSU transfers allocation right and available resource table to cluster header (CH) via announcement.(iii)
Step 3: CH allocates time slot to other vehicle nodes (excluding MSCN) of cluster.Here, all cluster members share a same SCH channel via TDMA mechanism for BSM dissemination. Corresponding time-slot allocation procedure includes two steps.(i)
Step 1: cluster header divides VeMAC time into three time periods, each of which includes several time slots.(ii)
Step 2: cluster header allocates time slots to VirCC. Vehicle nodes belonging to the same VirCC should be allocated with adjacent time slots. Note here, on the one hand, all MSCNs shall be allocated with two time-slots, the one is used to send local vehicle information, while the other is used to upload computing output to RSU. On the other hand, compared with ordinary road vehicles, MSCN should have higher channel occupancy priority. The dissemination cycle is shown in Figure5.Figure 5
Message dissemination cycle of low-density case.


### 5.2. High-Density Case

When the number of cluster members larger than the allowable time-slot number, a control right hand out procedure should occur. The procedure includes three steps as follows:(i)
Step 1: control right hand out application: cluster header sends control right hand out application message to RSU via unicast mode.(ii)
Step 2: transmission parameter setting: RSU sends message with corresponding transmission parameters, such as transmission power and SCH channel., to all vehicle nodes via the CCH channel.(iii)
Step 3: control right takeover confirmation: MSCNs feedback control right takeover confirmation message to RSU and allocate time slots to vehicle nodes belonging to the corresponding virtual cell. The dissemination cycle is shown in Figure6.Figure 6
Message dissemination cycle of high-density case.Detail of the proposed distribution right scheduling, which includes both low-density case and high-density case is given by Algorithm3, and corresponding variables and functions are explained in Table 3.Algorithm 3: The process of distributing scheduling rights.
Input: vehicle set V, density threshold ρ0, MSCN set mscn_set.(1)
Density ← calculate_density ( )(2)
If density < ρ0,then(3)
Allocation_timeslots (mscn_set)(4)
CH_id ← getCH (mscn_set)(5)
For each v ∈ V,do(6
If CH_id = = getid (v), then(7)
scheduler_flag (CHid, true)(8)
controlright_confirm (v)(9)
Else(10)
scheduler_flag (getid (v),false)(11)
scheduler (CH_id)(12)
End if(13)
End for(14)
Else(15)
Allocation_timeslots (mscn_set)(16)
controlright_handout ( )(17)
parameterbrocast ( )(18)
For each v ∈ V,do(19)
poweradjust (v)(20)
mscnid ← getmscnid (mscn_set)(21)
If mscnid == getid (v), then(22)
scheduler_flag (mscnid, true)(23)
controlright_confirm (v)(24)
Else(25)
scheduler_flag (getid (v), false)(26)
scheduler (mscnid)(27)
End if(28)
End for(29)
End ifTable 3
Explanation for Algorithm3 variables and functions.
Variable/functionExplanationDensityThe vehicle densitycalculate_density ( )Calculate road vehicle densityAllocation_timeslots (X)RSU preferentially allocates time slots to nodes in MSCN setXgetCH (X)Find the cluster head inXCH_idThe node ID of CHControlright_handout ( )CH unicasts control right hand out message to RSUpoweradjust (X)Adjust power size of vehicleXgetmscnid (X)Obtain the MSCN ID of the area where theX vehicle is locatedMscnidThe node ID of MSCNgetid (X)Get node ID of nodeXscheduler_flag (X, Y)Set whether nodeX is used as a resource scheduler by the Boolean value Ycontrolright_confirm (v)X sends control right takeover confirmation message to RSUscheduler (X)SetX as the resource scheduler’s node ID


## 5.1. Low-Density Case

For low-density case, cluster header serves as controller, which allocates transmission time slot to all cluster members. The communication resource allocation progress includes three steps, described as follows:(i)
Step 1: RSU allocates time slot to MSCNs, which are given with high transmission priority to communicate with RSU. Note here, RSU should decide MSCN’s occupied time-slot number according to the upload throughput.(ii)
Step 2: RSU transfers allocation right and available resource table to cluster header (CH) via announcement.(iii)
Step 3: CH allocates time slot to other vehicle nodes (excluding MSCN) of cluster.Here, all cluster members share a same SCH channel via TDMA mechanism for BSM dissemination. Corresponding time-slot allocation procedure includes two steps.(i)
Step 1: cluster header divides VeMAC time into three time periods, each of which includes several time slots.(ii)
Step 2: cluster header allocates time slots to VirCC. Vehicle nodes belonging to the same VirCC should be allocated with adjacent time slots. Note here, on the one hand, all MSCNs shall be allocated with two time-slots, the one is used to send local vehicle information, while the other is used to upload computing output to RSU. On the other hand, compared with ordinary road vehicles, MSCN should have higher channel occupancy priority. The dissemination cycle is shown in Figure5.Figure 5
Message dissemination cycle of low-density case.


## 5.2. High-Density Case

When the number of cluster members larger than the allowable time-slot number, a control right hand out procedure should occur. The procedure includes three steps as follows:(i)
Step 1: control right hand out application: cluster header sends control right hand out application message to RSU via unicast mode.(ii)
Step 2: transmission parameter setting: RSU sends message with corresponding transmission parameters, such as transmission power and SCH channel., to all vehicle nodes via the CCH channel.(iii)
Step 3: control right takeover confirmation: MSCNs feedback control right takeover confirmation message to RSU and allocate time slots to vehicle nodes belonging to the corresponding virtual cell. The dissemination cycle is shown in Figure6.Figure 6
Message dissemination cycle of high-density case.Detail of the proposed distribution right scheduling, which includes both low-density case and high-density case is given by Algorithm3, and corresponding variables and functions are explained in Table 3.Algorithm 3: The process of distributing scheduling rights.
Input: vehicle set V, density threshold ρ0, MSCN set mscn_set.(1)
Density ← calculate_density ( )(2)
If density < ρ0,then(3)
Allocation_timeslots (mscn_set)(4)
CH_id ← getCH (mscn_set)(5)
For each v ∈ V,do(6
If CH_id = = getid (v), then(7)
scheduler_flag (CHid, true)(8)
controlright_confirm (v)(9)
Else(10)
scheduler_flag (getid (v),false)(11)
scheduler (CH_id)(12)
End if(13)
End for(14)
Else(15)
Allocation_timeslots (mscn_set)(16)
controlright_handout ( )(17)
parameterbrocast ( )(18)
For each v ∈ V,do(19)
poweradjust (v)(20)
mscnid ← getmscnid (mscn_set)(21)
If mscnid == getid (v), then(22)
scheduler_flag (mscnid, true)(23)
controlright_confirm (v)(24)
Else(25)
scheduler_flag (getid (v), false)(26)
scheduler (mscnid)(27)
End if(28)
End for(29)
End ifTable 3
Explanation for Algorithm3 variables and functions.
Variable/functionExplanationDensityThe vehicle densitycalculate_density ( )Calculate road vehicle densityAllocation_timeslots (X)RSU preferentially allocates time slots to nodes in MSCN setXgetCH (X)Find the cluster head inXCH_idThe node ID of CHControlright_handout ( )CH unicasts control right hand out message to RSUpoweradjust (X)Adjust power size of vehicleXgetmscnid (X)Obtain the MSCN ID of the area where theX vehicle is locatedMscnidThe node ID of MSCNgetid (X)Get node ID of nodeXscheduler_flag (X, Y)Set whether nodeX is used as a resource scheduler by the Boolean value Ycontrolright_confirm (v)X sends control right takeover confirmation message to RSUscheduler (X)SetX as the resource scheduler’s node ID


## 6. Simulation and Experiment Results

### 6.1. Simulation Setup

In this paper, we conduct experiments on the NS-3.28 simulation platform to study the effectiveness of the message distribution mechanism. The road model parameters are shown in Table4:Table 4
Road simulation parameter.
ParameterValueRoad length600 mLane number3RSU number2Distance between RSUs300 mCluster number2Cluster diameter300 mVehicle’s velocity20 m/s–50 m/sVehicle’s number10∼70As shown in Table4, we select a 600-meter straight road as simulation background. The range of vehicles number is set as [10, 70]. Corresponding vehicle density is 0.017 vehicles/m to 0.117 vehicles/m. Vehicle’s velocity is set as a random number between 20 m/s and 50 m/s. Corresponding communication parameters are set as shown in Table 5.Table 5
Communication simulation parameter.
ParameterValueFrequency band5.9 GHzChannel bandwidth10 MHzData rate6 Mbit/sTransmit power16 mWPacket size200 bytesPacket delivery frequency10–100 HzAllowable time-slot number30The physical layer function is realized based on YANsPHY model. During CCH period, vehicle nodes broadcast emergency and control information via CSMA mode, while SCH period is used to broadcast vehicle node state information via VeMAC mode. Moreover, the processing output of MEC at RSU end side should be feedback to road vehicles via the CCH channel. The allowable time-slot number is set to 30, while BSM packet size is set as 200 bytes.


### 6.2. Simulation Result

#### 6.2.1. VirCC Generation and Maintenance

Here, we analysis VirCC generation and maintenance process to verify the effectiveness of the proposed VirCC working progress.(1) VirCC Generation Time. Here, we use classic minimum ID algorithm and the highest node degree clustering algorithm as contrast. Experiment result is given in Figure 7.Figure 7
VirCC generation time.As shown in Figure7, VirCC generation time of the proposed method is shorter than the other two algorithms and performs a better real-time feature.(2) MSCN Number. As mentioned earlier, MSCN number is decided by regional vehicle density. Moreover, during MSCN selection process, MSCN number changes. Figure 8 presents varying tendency of MSCN number while regional vehicle number changes.Figure 8
VirCC number change trend.(3) VirCC Migration Rate. VirCC migration rate, which denotes the stability and rationality of the VirCC, is defined as the migration frequency of a node between different VirCCs in the same cluster. Simulation results are as shown in Figure 9, while lowest-ID algorithm and the highest-degree clustering algorithm are used as contrast.Figure 9
VirCC migration rate.As shown in Figure9, the node migration rate increases with vehicle speed increase. Comparing with other two methods, the proposed VirCC generation algorithm performs higher stability.


#### 6.2.2. Message Distribution Mechanism Simulation Results

Three performance parameters, which are average backhaul delay, packet delivery rate, and effective feedback ratio, are considered.(1) Average Backhaul Delay. As mentioned earlier, the proposed two-layer MSCN-oriented architecture is used to provide high real-time service to road vehicles. Hence, corresponding real-time feature should consider both transmission delay and computing processing delay. Then, average back haul delay of vehicular service is defined as the time interval between the time point of vehicle’s BSM sent out and the time point that the vehicle obtained corresponding service information, which is generated according to the previous BSM. Simulation results are shown in Figure 10. The average backhaul delay of the two-layer MSCN-oriented static processing architecture proposed in our previous work [22], pure RSU processing architecture, pure CSMA processing architecture, lowest-ID algorithm, and highest-degree algorithm are used as a contrast.Figure 10
Average backhaul delay.As shown in Figure10, comparing with pure RSU and pure CSMA processing architecture, and lowest-ID and highest-degree algorithm, the average backhaul delay of MSCN-oriented architectures, including both static and dynamic architectures, is relatively stable with the increase of road vehicle density. Moreover, average backhaul delay of the proposed dynamic architecture is lower than that of the static architecture.(2) Packet Delivery Rate (PDR). Packet delivery rate (PDR) is the most important parameter to evaluate the performance of message dissemination mechanism. Here, two kinds of no-clustering methods, which are pure CSMA mode and RSU control mode, and three kinds of clustering methods, which are lowest-ID algorithm, highest-degree algorithm, and two-layer MSCN-oriented static processing method, are used as a contrast to verify the effectiveness of the proposed method. Simulation results are shown in Figure 11.Figure 11
Packet delivery rate.As shown in Figure11, PDR performance of no-clustering methods is deadly influenced by local vehicle density, while that of clustering methods is less affected by local vehicle density and changes smoothly. Moreover, the proposed message dissemination mechanism performs a stable packet delivery rate, which is obviously better than the other methods. In addition, the packet delivery rate of the dynamic processing framework is higher than that of the static architecture.(3) Effective Feedback Ratio. Similar to average backhaul delay, effective feedback ratio also is a parameter that denotes service performance. There might be a situation that the responsible vehicle could not receive valid service information. For example, a vehicle node sent BSM to RSU, and the service information feeding back from RSU could not receive by the vehicle, which already moves out of coverage area of the previous RSU. Here, we define the effective feedback ratio as the ratio of the received effective service message number to upload BSM number. Simulation results are shown in Figure 12. The effective feedback ratio of pure RSU and two-layer MSCN-oriented static processing architecture is used as a contrast.Figure 12
Effective feedback ratio.As shown in Figure12, the higher the vehicle velocity is, the lower the effective feedback ratio should be. Moreover, overall, the effective feedback ratio of MSCN-oriented architecture is higher than that of the static processing architecture and pure RSU processing architecture.


## 6.1. Simulation Setup

In this paper, we conduct experiments on the NS-3.28 simulation platform to study the effectiveness of the message distribution mechanism. The road model parameters are shown in Table4:Table 4
Road simulation parameter.
ParameterValueRoad length600 mLane number3RSU number2Distance between RSUs300 mCluster number2Cluster diameter300 mVehicle’s velocity20 m/s–50 m/sVehicle’s number10∼70As shown in Table4, we select a 600-meter straight road as simulation background. The range of vehicles number is set as [10, 70]. Corresponding vehicle density is 0.017 vehicles/m to 0.117 vehicles/m. Vehicle’s velocity is set as a random number between 20 m/s and 50 m/s. Corresponding communication parameters are set as shown in Table 5.Table 5
Communication simulation parameter.
ParameterValueFrequency band5.9 GHzChannel bandwidth10 MHzData rate6 Mbit/sTransmit power16 mWPacket size200 bytesPacket delivery frequency10–100 HzAllowable time-slot number30The physical layer function is realized based on YANsPHY model. During CCH period, vehicle nodes broadcast emergency and control information via CSMA mode, while SCH period is used to broadcast vehicle node state information via VeMAC mode. Moreover, the processing output of MEC at RSU end side should be feedback to road vehicles via the CCH channel. The allowable time-slot number is set to 30, while BSM packet size is set as 200 bytes.


## 6.2. Simulation Result

### 6.2.1. VirCC Generation and Maintenance

Here, we analysis VirCC generation and maintenance process to verify the effectiveness of the proposed VirCC working progress.(1) VirCC Generation Time. Here, we use classic minimum ID algorithm and the highest node degree clustering algorithm as contrast. Experiment result is given in Figure 7.Figure 7
VirCC generation time.As shown in Figure7, VirCC generation time of the proposed method is shorter than the other two algorithms and performs a better real-time feature.(2) MSCN Number. As mentioned earlier, MSCN number is decided by regional vehicle density. Moreover, during MSCN selection process, MSCN number changes. Figure 8 presents varying tendency of MSCN number while regional vehicle number changes.Figure 8
VirCC number change trend.(3) VirCC Migration Rate. VirCC migration rate, which denotes the stability and rationality of the VirCC, is defined as the migration frequency of a node between different VirCCs in the same cluster. Simulation results are as shown in Figure 9, while lowest-ID algorithm and the highest-degree clustering algorithm are used as contrast.Figure 9
VirCC migration rate.As shown in Figure9, the node migration rate increases with vehicle speed increase. Comparing with other two methods, the proposed VirCC generation algorithm performs higher stability.


### 6.2.2. Message Distribution Mechanism Simulation Results

Three performance parameters, which are average backhaul delay, packet delivery rate, and effective feedback ratio, are considered.(1) Average Backhaul Delay. As mentioned earlier, the proposed two-layer MSCN-oriented architecture is used to provide high real-time service to road vehicles. Hence, corresponding real-time feature should consider both transmission delay and computing processing delay. Then, average back haul delay of vehicular service is defined as the time interval between the time point of vehicle’s BSM sent out and the time point that the vehicle obtained corresponding service information, which is generated according to the previous BSM. Simulation results are shown in Figure 10. The average backhaul delay of the two-layer MSCN-oriented static processing architecture proposed in our previous work [22], pure RSU processing architecture, pure CSMA processing architecture, lowest-ID algorithm, and highest-degree algorithm are used as a contrast.Figure 10
Average backhaul delay.As shown in Figure10, comparing with pure RSU and pure CSMA processing architecture, and lowest-ID and highest-degree algorithm, the average backhaul delay of MSCN-oriented architectures, including both static and dynamic architectures, is relatively stable with the increase of road vehicle density. Moreover, average backhaul delay of the proposed dynamic architecture is lower than that of the static architecture.(2) Packet Delivery Rate (PDR). Packet delivery rate (PDR) is the most important parameter to evaluate the performance of message dissemination mechanism. Here, two kinds of no-clustering methods, which are pure CSMA mode and RSU control mode, and three kinds of clustering methods, which are lowest-ID algorithm, highest-degree algorithm, and two-layer MSCN-oriented static processing method, are used as a contrast to verify the effectiveness of the proposed method. Simulation results are shown in Figure 11.Figure 11
Packet delivery rate.As shown in Figure11, PDR performance of no-clustering methods is deadly influenced by local vehicle density, while that of clustering methods is less affected by local vehicle density and changes smoothly. Moreover, the proposed message dissemination mechanism performs a stable packet delivery rate, which is obviously better than the other methods. In addition, the packet delivery rate of the dynamic processing framework is higher than that of the static architecture.(3) Effective Feedback Ratio. Similar to average backhaul delay, effective feedback ratio also is a parameter that denotes service performance. There might be a situation that the responsible vehicle could not receive valid service information. For example, a vehicle node sent BSM to RSU, and the service information feeding back from RSU could not receive by the vehicle, which already moves out of coverage area of the previous RSU. Here, we define the effective feedback ratio as the ratio of the received effective service message number to upload BSM number. Simulation results are shown in Figure 12. The effective feedback ratio of pure RSU and two-layer MSCN-oriented static processing architecture is used as a contrast.Figure 12
Effective feedback ratio.As shown in Figure12, the higher the vehicle velocity is, the lower the effective feedback ratio should be. Moreover, overall, the effective feedback ratio of MSCN-oriented architecture is higher than that of the static processing architecture and pure RSU processing architecture.


## 6.2.1. VirCC Generation and Maintenance

Here, we analysis VirCC generation and maintenance process to verify the effectiveness of the proposed VirCC working progress.(1) VirCC Generation Time. Here, we use classic minimum ID algorithm and the highest node degree clustering algorithm as contrast. Experiment result is given in Figure 7.Figure 7
VirCC generation time.As shown in Figure7, VirCC generation time of the proposed method is shorter than the other two algorithms and performs a better real-time feature.(2) MSCN Number. As mentioned earlier, MSCN number is decided by regional vehicle density. Moreover, during MSCN selection process, MSCN number changes. Figure 8 presents varying tendency of MSCN number while regional vehicle number changes.Figure 8
VirCC number change trend.(3) VirCC Migration Rate. VirCC migration rate, which denotes the stability and rationality of the VirCC, is defined as the migration frequency of a node between different VirCCs in the same cluster. Simulation results are as shown in Figure 9, while lowest-ID algorithm and the highest-degree clustering algorithm are used as contrast.Figure 9
VirCC migration rate.As shown in Figure9, the node migration rate increases with vehicle speed increase. Comparing with other two methods, the proposed VirCC generation algorithm performs higher stability.


## 6.2.2. Message Distribution Mechanism Simulation Results

Three performance parameters, which are average backhaul delay, packet delivery rate, and effective feedback ratio, are considered.(1) Average Backhaul Delay. As mentioned earlier, the proposed two-layer MSCN-oriented architecture is used to provide high real-time service to road vehicles. Hence, corresponding real-time feature should consider both transmission delay and computing processing delay. Then, average back haul delay of vehicular service is defined as the time interval between the time point of vehicle’s BSM sent out and the time point that the vehicle obtained corresponding service information, which is generated according to the previous BSM. Simulation results are shown in Figure 10. The average backhaul delay of the two-layer MSCN-oriented static processing architecture proposed in our previous work [22], pure RSU processing architecture, pure CSMA processing architecture, lowest-ID algorithm, and highest-degree algorithm are used as a contrast.Figure 10
Average backhaul delay.As shown in Figure10, comparing with pure RSU and pure CSMA processing architecture, and lowest-ID and highest-degree algorithm, the average backhaul delay of MSCN-oriented architectures, including both static and dynamic architectures, is relatively stable with the increase of road vehicle density. Moreover, average backhaul delay of the proposed dynamic architecture is lower than that of the static architecture.(2) Packet Delivery Rate (PDR). Packet delivery rate (PDR) is the most important parameter to evaluate the performance of message dissemination mechanism. Here, two kinds of no-clustering methods, which are pure CSMA mode and RSU control mode, and three kinds of clustering methods, which are lowest-ID algorithm, highest-degree algorithm, and two-layer MSCN-oriented static processing method, are used as a contrast to verify the effectiveness of the proposed method. Simulation results are shown in Figure 11.Figure 11
Packet delivery rate.As shown in Figure11, PDR performance of no-clustering methods is deadly influenced by local vehicle density, while that of clustering methods is less affected by local vehicle density and changes smoothly. Moreover, the proposed message dissemination mechanism performs a stable packet delivery rate, which is obviously better than the other methods. In addition, the packet delivery rate of the dynamic processing framework is higher than that of the static architecture.(3) Effective Feedback Ratio. Similar to average backhaul delay, effective feedback ratio also is a parameter that denotes service performance. There might be a situation that the responsible vehicle could not receive valid service information. For example, a vehicle node sent BSM to RSU, and the service information feeding back from RSU could not receive by the vehicle, which already moves out of coverage area of the previous RSU. Here, we define the effective feedback ratio as the ratio of the received effective service message number to upload BSM number. Simulation results are shown in Figure 12. The effective feedback ratio of pure RSU and two-layer MSCN-oriented static processing architecture is used as a contrast.Figure 12
Effective feedback ratio.As shown in Figure12, the higher the vehicle velocity is, the lower the effective feedback ratio should be. Moreover, overall, the effective feedback ratio of MSCN-oriented architecture is higher than that of the static processing architecture and pure RSU processing architecture.


## 7. Conclusion and Future Work

This work investigates the unique feature of RSU-based service and proposed a service performance enhancement approach, in which a two-layer oriented MSCN information collecting and processing dynamic infrastructure is defined. Moreover, the concept of VirCC is proposed. A MSCN selection criteria and VirCC joining rule are presented, and a MSCN-oriented computing and transmission resource allocation method is given, and corresponding message dissemination mechanism is designed. Then, we analyse VirCC generation and maintenance process; the simulation results prove that the working process of VirCC is stable and effective. Finally, we have built the simulation model and given a comprehensive performance evaluation, which demonstrate that the proposed architecture is able to provide reliable RSU-oriented services. Three performance parameters, which are average backhaul delay, packet delivery rate, and effective feedback ratio, are considered to verify the corresponding service performance.In our future work, the MSCN transfer scenario should be considered. Meanwhile, other road scenarios, such as bends, intersections, and slopes, should be considered in the experimental setting.



---

*Source: 8894106-2021-04-17.xml*