# Congestion Attack Detection in Intelligent Traffic Signal System: Combining Empirical and Analytical Methods

Authors: Yingxiao Xiang; Wenjia Niu; Endong Tong; Yike Li; Bowei Jia; Yalun Wu; Jiqiang Liu; Liang Chang; Gang Li
Journal: Security and Communication Networks
 (2021)

---

## Abstract

The intelligent traffic signal (I-SIG) system aims to perform automatic and optimal signal control based on traffic situation awareness by leveraging connected vehicle (CV) technology. However, the current signal control algorithm is highly vulnerable to CV data spoofing attacks. These vulnerabilities can be exploited to create congestion in an intersection and even trigger a cascade failure in the traffic network. To avoid this issue, timely and accurate congestion attack detection and identification are essential. This work proposes a congestion attack detection approach by combining empirical prediction and analytical verification. First, we collect a range of traffic images that correspond to specific traffic snapshots which are vulnerable to potential data spoofing attacks. Based on these traffic images, an improved generative adversarial network is trained to predict whether a forthcoming attack will cause congestion with a high probability. Meanwhile, we define a group of traffic flow features. After exploring features and conducting a thorough analysis, a TGRU (tree-regularized gated recurrent unit)-based approach is proposed to verify whether congestion occurs. When we find a possible attack that can cause congestion with high probability and subsequent traffic flows also prove congestion, we can say there is a congestion attack. Thus, we can realize timely and accurate congestion attack detection by integrating empirical prediction and analytical verification. Extensive experiments demonstrate that our approach performs well in congestion attack detection accuracy and timeliness.


---

## Body

## 1. Introduction

Connected vehicle (CV) technology [1, 2] empowers vehicles to communicate with the surrounding environment (roadside units and traffic signal control infrastructure) and is now transforming today’s transportation systems. As one key component, the intelligent traffic signal (I-SIG) system [3] is responsible for performing dynamic and optimal signal control. It is based on automatic traffic situation awareness by leveraging the emerging communication infrastructure of the space-air-ground integrated network (SAGIN) [4, 5] with the advantages of coverage, flexibility, and so on. For instance, since September 2016, a series of I-SIG systems have been deployed in California, Florida, and New York by the U.S. Department of Transportation (USDOT) as a CV Pilot Program [1]. These systems are currently under testing and not yet widespread.Unfortunately, such dramatically increased connectivity also opens a new door for cyberattacks. Recently, such I-SIG has exposed a vulnerability of the controlled optimization of phases (COP) algorithm [6, 7]. Attackers can compromise the on-board units on their vehicles and send malicious messages (such as those containing speed and location) to influence the traffic control decisions at specific times, thus causing unexpected heavy traffic congestion. Some data show that a single attack vehicle can cause a total delay 11 times greater than the total delay before the attack [8], posing a significant barrier to the development and deployment of I-SIG systems on a wide scale in the future.Previous research [8] reveals such congestion attacks on the COP algorithm, analyzes how congestion attacks affect the COP algorithm decisions, and explains how to launch an attack using data spoofing in SAGIN. However, developers may still lack a deep understanding of such I-SIG attacks and defenses, raising some pressing concerns: (1) What is the effect of different phases where the attack vehicle is located? The different phases of the attack vehicle can cause different congestion effects. (2) What is the quantified correlation between the attack and congestion degree? The quantified correlation refers to the potential relationship between the attack and congestion degree; once identified, we can infer whether the attack occurred according to the congestion degree. (3) Are there any potential features to be utilized for revealing the above correlation? It is necessary to analyze the congestion attack mechanism firstly to solve these issues. The challenges of solving these issues include how to automatically explore multiple and multidimensional features to quantify the traffic flow characteristics under no attack and congestion attack and analyze the correlation between attack features and attack effects. Thus, demystifying the congestion attack based on the COP mechanism through quantified features and exploring new analysis methods will benefit all stakeholders for I-SIG, including transportation, SAGIN, and security specialists.We demystify the attack and corresponding congestion from a machine learning perspective by exploring and utilizing quantified features. We deeply analyze data spoofing in SAGIN and the COP algorithm vulnerability under two different attack strategies. To explore the effect of different phases of the attack vehicle, we consider utilizing high-level image features and design a novel analysis model based on the cycle generative adversarial network (CycleGAN) [9] to reflect the relation between the attack and the congestion caused by the attack. Thus, we can predict whether a forthcoming attack will cause congestion and the congestion effect according to the traffic image at a specific moment. To explore the quantified correlation between the attack and congestion degree, we utilize traffic flow features and the TGRU classification model [10] (an explainable gated recurrent unit-based model [11] with tree regularization) to verify whether a congestion attack occurs based on all vehicles’ trajectory data in an intersection. Following analysis, we also give some promising suggestions for defending I-SIG systems against a congestion attack.We implement the I-SIG and experiment through visualized simulation in VISSIM [12]. The experiment shows the effectiveness of our approach. We find that feature-based machine learning can reflect the correlation between the attack and congestion degree well. Through the deep learning-based training, the CycleGAN-based approach output visualized results with satisfied prediction compared with real values: the MAE and RMSE of the congestion degree are near 0.02 and 0.03, respectively, and the MAE and RMSE of the congestion degree are near 0.94 and 1.14, respectively. TGRU has a 0.84 precision and 0.79 recall on predicting the spoofing attack based on 30 features. Generally, for defenses, we suggest improving the estimation of vehicle location and speed (EVLS) [7] algorithm of I-SIG if we would like to keep a limited cost, which requires fewer authentication mechanisms and SAGIN reinforcement efforts.We summarize our contributions as follows:(1)
We perform the study to demystify the attack to I-SIG and the corresponding congestion from a machine learning perspective by exploring different kinds of features through supervised learning and unsupervised learning.(2)
For predicting the spoofing congestion attack, we automatically explore the image feature to quantify the traffic flow characteristics under no attack and congestion attack. And we propose a CycleGAN-based approach to analyze the potential relationship between the congestion attack and corresponding results two stages later based on the image feature.(3)
For verifying the spoofing congestion attack, we propose a TGRU-based approach to explore the underlying relationship between the congestion attack and traffic flow feature at the current moment based on the traffic flow features, which are firstly defined in this work.(4)
We evaluate our approach empirically from the real COP algorithm through VISSIM. We collect 4476 high-quality image samples and 3600 traffic flow data for the experiment, which enables us to demonstrate the effectiveness of our approach compared with ground truth.


## 2. Preliminaries

### 2.1. SAGIN Infrastructure of I-SIG

Figure1 presents the basic architecture for the space-air-ground integrated network of I-SIG, in which two main segments are included: a space segment and a ground segment. The I-SIG of the CV environment is located in the network-based ground segment. There are three main components within the ground segment: on-board units (OBUs), roadside units (RSUs), and signal planning units. These refer to the devices installed in vehicles, roadside servers, and traffic lights, respectively. Both vehicle-to-vehicle (V2V) [13] communication and vehicle-to-infrastructure (V2I, e.g., roadside servers) [14] communication adopt the dedicated short-range communications (DSRC) [15] transmission protocol as 802.11p-based wireless communication; this provides a channel and enables high-speed direct communication. Every vehicle broadcasts anonymously, and surrounding vehicles receive messages. Messages containing critical information are called basic safety messages (BSMs). These contain core data elements, including vehicle size, position, speed, heading, acceleration, and brake system status. Compared with DSRC, the communication from the RSU to the signal planning unit adopts the US National Transportation Communications for Intelligent Transportation System Protocol (NTCIP) [16]. By providing two-way communication between vehicles and traffic signals, NTCIP is specially designed to achieve interpretability and interchangeability between computers and electronic traffic control equipment from different manufacturers, thus increasing use in smart city initiatives.Figure 1
The architecture for space-air-ground integrated network of I-SIG.


### 2.2. I-SIG Data Flow

The data flow of the I-SIG system is revealed in Figure2. Each OBU of a vehicle sends BSMs to the RSU for real-time trajectory collection. Then, the data are preprocessed to form an arrival table (Table 1) to be used as input for signal planning, which contains COP and EVLS algorithms. If the penetration rate (PR) of OBU for a vehicle is less than 95%, the arrival table will be sent to EVLS for an update. Otherwise, it will be directly sent to the COP algorithm for planning. According to the results of the COP algorithm, a downward signaling command will be transferred to the phase signal controller. After each stage of signal control, the status of the signal will be returned as feedback for continuous COP planning.Figure 2
Data flow of the I-SIG system.Table 1
Arrival table. Numbers 1 to 8 are phases, andT0 to TM are the remaining arrival time of vehicles.
Phase12⋯8T0N01N02⋯N08T1N11N12⋯N18T2N21N22⋯N28⋯⋯⋯⋯⋯TMNM1NM2⋯NM8There are 8 traffic signals in I-SIG, as shown in Figure3, called phases; odd numbers are for left-turn lanes; even numbers are for through lanes. Table 1 is the arrival table which is sent to the signal planning model. In Table 1, Ti=i0≤i≤M denotes the time to arrive at the stop bar from the current location. I-SIG sets M=130 seconds, covering a BSM statistic of over two minutes. Niji∈0,M,j∈1,8 means that in phase j, there will be Nij vehicles that are going to reach the stop bar within Ti seconds. Here, the stop bar is set in front of the traffic light as it is marked in real road intersections.Figure 3
I-SIG signal control scenario, including 8 phases.The EVLS is based on Wiedemann’s car-following model and is used to fill the blank monitoring area of the monitoring segment and insert vehicle data between OBU-equipped vehicles.The key is to estimate the number of queued vehicles. Because it is assumed that a queue always begins at the stop bar, the last vehicle in the queue needs to be found to determine the queue length.First, the historical distances to the stop bar and stop time of the last stopped connected vehicle and the second-to-the-last stopped connected vehicle in the queue are calculated; these are denoted asLq1, Tq1, Lq2, and Tq2, respectively. The current time is Tc, and the estimated queue length is Les. Assuming that the queue propagation speed vq is constant, we have(1)vq=Lq1−Lq2Tq1−Tq2=Les−Lq1TC−Tq1.Then,(2)Les=Lq1+vqTC−Tq1.If the average vehicle length isC, the number N0i of vehicles in queue is then calculated as follows:(3)N0i=LesC,i∈1,8.Although such estimation provides effective support for a low PR, it also introduces a new threat of data spoofing attack to the COP algorithm.


## 2.1. SAGIN Infrastructure of I-SIG

Figure1 presents the basic architecture for the space-air-ground integrated network of I-SIG, in which two main segments are included: a space segment and a ground segment. The I-SIG of the CV environment is located in the network-based ground segment. There are three main components within the ground segment: on-board units (OBUs), roadside units (RSUs), and signal planning units. These refer to the devices installed in vehicles, roadside servers, and traffic lights, respectively. Both vehicle-to-vehicle (V2V) [13] communication and vehicle-to-infrastructure (V2I, e.g., roadside servers) [14] communication adopt the dedicated short-range communications (DSRC) [15] transmission protocol as 802.11p-based wireless communication; this provides a channel and enables high-speed direct communication. Every vehicle broadcasts anonymously, and surrounding vehicles receive messages. Messages containing critical information are called basic safety messages (BSMs). These contain core data elements, including vehicle size, position, speed, heading, acceleration, and brake system status. Compared with DSRC, the communication from the RSU to the signal planning unit adopts the US National Transportation Communications for Intelligent Transportation System Protocol (NTCIP) [16]. By providing two-way communication between vehicles and traffic signals, NTCIP is specially designed to achieve interpretability and interchangeability between computers and electronic traffic control equipment from different manufacturers, thus increasing use in smart city initiatives.Figure 1
The architecture for space-air-ground integrated network of I-SIG.


## 2.2. I-SIG Data Flow

The data flow of the I-SIG system is revealed in Figure2. Each OBU of a vehicle sends BSMs to the RSU for real-time trajectory collection. Then, the data are preprocessed to form an arrival table (Table 1) to be used as input for signal planning, which contains COP and EVLS algorithms. If the penetration rate (PR) of OBU for a vehicle is less than 95%, the arrival table will be sent to EVLS for an update. Otherwise, it will be directly sent to the COP algorithm for planning. According to the results of the COP algorithm, a downward signaling command will be transferred to the phase signal controller. After each stage of signal control, the status of the signal will be returned as feedback for continuous COP planning.Figure 2
Data flow of the I-SIG system.Table 1
Arrival table. Numbers 1 to 8 are phases, andT0 to TM are the remaining arrival time of vehicles.
Phase12⋯8T0N01N02⋯N08T1N11N12⋯N18T2N21N22⋯N28⋯⋯⋯⋯⋯TMNM1NM2⋯NM8There are 8 traffic signals in I-SIG, as shown in Figure3, called phases; odd numbers are for left-turn lanes; even numbers are for through lanes. Table 1 is the arrival table which is sent to the signal planning model. In Table 1, Ti=i0≤i≤M denotes the time to arrive at the stop bar from the current location. I-SIG sets M=130 seconds, covering a BSM statistic of over two minutes. Niji∈0,M,j∈1,8 means that in phase j, there will be Nij vehicles that are going to reach the stop bar within Ti seconds. Here, the stop bar is set in front of the traffic light as it is marked in real road intersections.Figure 3
I-SIG signal control scenario, including 8 phases.The EVLS is based on Wiedemann’s car-following model and is used to fill the blank monitoring area of the monitoring segment and insert vehicle data between OBU-equipped vehicles.The key is to estimate the number of queued vehicles. Because it is assumed that a queue always begins at the stop bar, the last vehicle in the queue needs to be found to determine the queue length.First, the historical distances to the stop bar and stop time of the last stopped connected vehicle and the second-to-the-last stopped connected vehicle in the queue are calculated; these are denoted asLq1, Tq1, Lq2, and Tq2, respectively. The current time is Tc, and the estimated queue length is Les. Assuming that the queue propagation speed vq is constant, we have(1)vq=Lq1−Lq2Tq1−Tq2=Les−Lq1TC−Tq1.Then,(2)Les=Lq1+vqTC−Tq1.If the average vehicle length isC, the number N0i of vehicles in queue is then calculated as follows:(3)N0i=LesC,i∈1,8.Although such estimation provides effective support for a low PR, it also introduces a new threat of data spoofing attack to the COP algorithm.


## 3. Demystifying Attack on COP

### 3.1. Data Spoofing Threat

There are two data spoofing attack strategies proposed in I-SIG (Figure4). The first one is a direct attack on the arrival table without considering PR; the second one is an indirect attack on EVLS when the PR is less than 95%.Figure 4
Two strategies of congestion data spoofing attack. PR is short for penetration rate. (a) Direct attack on arrival table without considering PR. (b) Indirect attack on EVLS when PR is less than 95%.
(a)(b)The first strategy is for arrival time and phase spoofing, for both the full deployment period (PR≥ 95%) and transition period (PR < 95%). The attacker changes the location and speed information in vehicle BSMs to alter the vehicle’s arrival time and requested phase; thus, the corresponding arrival table elements in Table 1 are changed. This attack strategy can directly attack input data flow no matter what the PR is. As shown in Figure 4(a), the attacker adds a spoofed vehicle into the original vehicle queue at any location. The insertion of a spoofed vehicle makes the queue longer. Moreover, there is an increase in the duration of the green light allocated by the COP algorithm for the current phase, which delays the next start time of the green light of all phases, thus increasing the delay for vehicles to pass through the intersection.The second strategy is for queue-length spoofing, for the transition period only. This strategy aims to extend the queue length estimated by the EVLS algorithm by changing the location and speed values in BSMs. Figure4(b) shows that the attacker adds a stopped vehicle with the farthest distance to the stop bar. Owing to the EVLS algorithm estimating the queue length based on the location of the last stopped connected vehicle, this attack causes the estimated queue length Les calculated by equation (2) to increase. Therefore, the number of vehicles in the queue N0i calculated by equation (3) increases as well.


### 3.2. Planning-Level Congestion Analysis

The COP algorithm is responsible for traffic signal planning; thus, it is essential for planning-level congestion analysis of I-SIG.Through reading the published COP-related papers [6, 7] and analyzing the implementation code, we reveal a more complete and detailed COP algorithm for the first time (Algorithms 1 and 2). The authors in [6] first proposed a COP algorithm that allows optimization of various performance indices, including delay, stops, and queue lengths, for the optimal control of a single intersection. However, it did not support flexible or dual ring and phase sequences, and it is difficult to understand for most readers due to the lack of the algorithm flow. Based on the COP algorithm, the authors in [7] presented a real-time adaptive traffic control algorithm by utilizing data from connected vehicles to optimize the phase sequence. However, they did not provide the details of the algorithm. Compared with [6, 7], Algorithm 1 is the first algorithm that provides a complete and detailed flow of signal planning.Algorithm 1: The COP algorithm
//The plan of the optimal green duration and phase sequenceRequire:At,k, Gminr,p, Gmaxr,p, R, T(1)
Setj=0,vj=0(2)
Xjmin=maxGmin0,0+R+Gmin0,1+R,Gmin1,0+R+Gmin1,1+R(3)
Xjmax=minGmax0,0+R+Gmax0,1+R,Gmax1,0+R+Gmax1,1+R(4)
T′=T−sj−1−⋯−s1(5)
forr=0,1do(6)
planPr,0=1+j∗2+r∗4(7)
planPr,1=2+j∗2+r∗4(8)
end for(9)
forsj=1,…,Tdo(10)
ifsj≥Xjmin and sj≤minXjmax,T′then(11)
xj=sj(12)
effectG0 = effect G1=sj−2R(13)
optV0=optV1=99999.0(14)
forr=0,1do(15)
fori=Gminr,0,…,Gmaxr,0do(16)
tGr,0=i(17)
tGr,1=effectGr−tGr,0(18)
iftGr,1≥Gminr,1 and tGr,1≤Gmaxr,1then(19)
Delayr=fr,planPr,0,planPr,1,tGr,0,tGr,1,xj,At,k//Calculated by Algorithm2(20)
ifDelayr<optVrthen(21)
optVr=Delayr(22)
optGr,0=tGr,0(23)
optGr,1=tGr,1(24)
end if(25)
end if(26)
end for(27)
:  end for(28)
else(29)
vj=99999(30)
xj=0(31)
end if(32)
end for(33)
xj∗=optGr,0+R+optGr,1+R(34)
fjxj∗=optV0+optV1(35)
vj=fjxj∗+vj−1Ensure:planPr,p,optGr,p,xj∗,vj(36)
ifj<2then(37)
j=j+1, go to step 2.(38)
end ifAlgorithm 2: The delay calculation algorithm.
//The delay calculation of ringr at stage j//fr,planPr,0,planPr,1,tGr,0,tGr,1,xj,At,kRequire:r,p1,p2,g1,g2,xj,At,k(1)
l0,p1=A0,p1,l0,p2=A0,p2(2)
fori=1,…,xjdo(3)
li,p1=li−1,p1−Di,p1+Ai,p1(4)
li,p2=li−1,p2−Di,p2+Ai,p2(5)
di=li,p1+li,p2(6)
end for(7)
s.t.Di,p1=1,ifi≤g1andi+1%2=0,0,ifg1<i≤xj,Di,p2=1,ifg1+R<i≤g1+R+g2andi+1%2=0,0,ig1+R+g2<i≤xjandi≤g1+R,(8)
Delayr=∑i=1xjdiEnsure:DelayrIn Table2, we list the meanings of the mathematical symbols that appear in the two algorithms.Table 2
Mathematical symbols used in the COP algorithm.
tIndex of arrival timekGlobal phase indexAt,kElement of arrival table denoting the number of vehicle arrivals for phasek at time tpLocal phase indexrRing index in each stageGminr,pMinimum green time of phasep in ring rGmaxr,pMaximum green time of phasep in ring rRDuration of yellow light and red lightTTotal number of discrete time steps in the planning horizon, in secondsjIndex of stagevjValue function given statej which represents the accumulated performance measure for the current and all previous stagesXjminMinimum possible length of stagejXjmaxMaximum possible length of stagejsjState variable denoting the total number of time steps allocated to stagejPlanPr,pPlanned phase of phasep in ring rEffectGrEffective total green light time of ringr in stage jOptVrOptimal delay of ringr in stage jOptGr,pOptimal green duration of phasep in ring rxjLength of stagej under the optimal solutionxj∗Length of stagej under the optimal solutionfjxjPerformance measure at stagejli,kNumber of vehicle departing for phasek at time tDi,kNumber of vehicle departing for phasek at time tDelayrDelay of ringr at stage jThe design of the COP algorithm uses the collaboration of two-stage planning and operation. The COP algorithm plans signals for the next-stage based on the vehicle’s estimation, and such planned signal duration will be operated at the next-stage signal control time. Thus, this is a continuous alternate process in a fixed phase sequence, which means that the I-SIG system cannot change the order and duration of phases in the current stage since this is set in the previous stage. When bringing foresight of planning, such a design also opens the door to attack signal planning in order to affect next-stage operation continuously.The spoofing of the arrival table affects the variablesAt,k and planPr,p and the later calculation of Delayr in line 19 of Algorithms 1. The change in Delayr causes the variables optVr in line 21, optGr,0 in line 22, and optGr,1 in line 23 of Algorithms 1 to change as well. Finally, the outputs planPr,p, optGr,p, xj∗, and vj are changed.


### 3.3. High-Level Image Feature-Based Congestion Attack Prediction

In this subsection, we employ an image feature-based CycleGAN to explain the relationship between the phase where the spoofed vehicle is located and the congestion image features two stages later.As mentioned in the Data Spoofing Threat section, there are two data spoofing attack strategies, but either attack will cause congestion in a period. Different phases of spoofed vehicles lead to different congestion effects. Therefore, the image features of intersection congestion are also different. The CycleGAN model can mine the potential relationship between two different types (X and Y) of images. Through training, CycleGAN can generate the corresponding images Y according to X and generate the related images X according to Y. Therefore, we utilize the CycleGAN model to predict the congestion effects according to the phases of spoofed vehicles, which were considered the attack feature, in order to reveal the relationship between the phase of the spoofed vehicle and the caused congestion image feature.The CycleGAN architecture is illustrated in Figure5. One training sample is a pair of image xi and image yi to form xi,yi,xi∈X, and yi∈Y. xi refers to the processed traffic image at the spoofing time, and yi is the processed traffic congestion image two stages later. The image processing consists of three steps: (1) filter out environment background; (2) extract four images, in which each has 2 phases at one intersection; and (3) join these four images from top to bottom to form one sample image according to the phase order of phase (4,7), phase (8,3), phase (2,5), and phase (6,1). Here, the number of phases is consistent with that shown in Figure 3, which is joined by the four parts of an intersection from top to down to form one sample image.Figure 5
CycleGAN architecture.There are four neural networks in the CycleGAN architecture: two generative networks (G and F) and two discriminant networks (DX and DY). The generator G generates a fake image y˜, which is similar to y given real image x, i.e., G:X⟶Y. Meanwhile, F generates a fake image x˜, which is similar to x given real image y, i.e., F:Y⟶X. The adversarial discriminator DX aims to distinguish whether the input image is x and outputs probability Px. Similarly, DY aims to discriminate whether the input image is y and outputs probability Py.Forx∈X, x⟶Gx⟶FGx≈x is a cycle, called forward cycle consistency. Similarly, for y∈Y, y⟶Fy⟶GFy≈y is a cycle called backward cycle consistency. There are two kinds of losses: adversarial loss and cycle consistency loss. Adversarial loss can only guarantee that the samples generated by the generator are distributed with the real samples, but we want the images between the corresponding domains to correspond one by one. That is, X-Y-X can also be migrated back. So, forward cycle consistency and backward cycle consistency are used to make the samples generated by two generators not contradict each other.Adversarial Loss. This refers to the difference in dataset distribution between generated images and corresponding real images. For discriminators DX and DY, the closer the output value is to 1, the smaller the loss is.The losses ofG and F can be calculated as LG and LF, respectively, as follows:(4)LGG,DY,X,Y=Ey∼PdataylogDYy+Ex∼Pdataxlog1−DYGx,(5)LFF,DX,Y,X=Ex∼PdataxlogDXx+Ey∼Pdataylog1−DYGy.Cycle Consistency Loss. This prevents the learned mappings G and F from contradicting each other, making FGx≈x and Fy≈y. The loss of LcycG,F is calculated by the following equation:(6)LcycG,F=Ex∼PdataxFGx−x1+Ey∼PdatayGFy−y1.The total loss for CycleGAN is(7)LG,F,DX,DY=LGG,DY,X,Y+LFF,DX,Y,X+λLcycG,F,in which λ is an important parameter. Then, the objective function of the CycleGAN is defined as follows:(8)G∗,F∗=argminG,FmaxDX,DYLG,F,DX,DY.The detailed implementation of neural networks in CycleGAN will be described in the following experiment setup.


### 3.4. Traffic Flow Feature-Based Congestion Attack Verification

In this subsection, we use a deep learning-based decision tree model, TGRU, to explain the relationship between the traffic flow features and the congestion attack. This relationship can then be used to verify if congestion is occurring. The TGRU model is an interpretable depth time-series model, which is very suitable for intersection traffic flow features with time characteristics. At the same time, interpretability helps to analyze better the relationship between traffic flow features and the congestion attack.The input of the congestion prediction is the traffic image feature of the intersection, and the prediction model outputs the congestion affects two stages later according to the image feature, which indicates that whether the congestion will occur. However, after the congestion prediction, the verification model is used to verify whether the congestion attack is occurring. The verification input is the defined traffic flow feature that is calculated according to vehicles’ information. When we find a possible attack that can cause congestion with high probability and subsequent traffic flows also verify congestion, then we can predict there exists a congestion attack. Thus, we can realize timely and accurate congestion attack detection by integrating empirical prediction and analytical verification.Feature Definition Based on Traffic Flow. To measure the congestion effects caused by spoofed vehicles, we propose capacity ratio and congestion degree, as well as an attack acceleration and attack amplification ratio based on capacity ratio and congestion degree. We define features as follows:(1)
Vehicle Capacity Ratio (CR). Ckmax is the maximum vehicle capacity of each phase, and the vehicle capacity of all 8 phases is computed as Ctotalmax=∑k=18Ckmax. Then, the vehicle CR can be denoted by CR=∑k=18Nk/Ctotalmax, where Nk is the vehicle number of the kth phase.(2)
Congestion Degree (CD). The number of vehicles queuing in the kth phase is denoted as Qk. Qnormal is the number of vehicles during normal queuing and is a constant. Then, the CD of the kth phase can be computed by PCDk=Qk/Qnormal, and the global CD for an intersection is ICD=∑k=18PCDk.(3)
Attack Acceleration. Let t0 be the start time of the data spoofing attack. Then, the accelerations of CR, PCDk, and ICD at time t are, respectively, calculated by αCRt=CRt−CRt0/t−t0, αPCDt,k=PCDt,k−PCDt0,k/t−t0, and αICDt=ICDt−ICDt0/t−t0.(4)
Attack Amplification Ratio. Let t0 be the start time of the data spoofing attack. Then, the amplification ratio of CR, PCDk, and ICD at time t is, respectively, calculated by βCRt=CRt/CRt0, βPCDt,k=PCDt,k/PCDt0,k, and βICDt=ICDt/ICDt0.Features are divided into macrofeatures and microfeatures for the sake of discussing interpretability, depending on whether they are a feature of the whole intersection or a specific phase (Table3). Macrofeatures measure the congestion characteristics of the whole intersection, and microfeatures measure the phase of a single signal phase. Unlike the traditional traffic flow characteristics, such as traffic flow, traffic density, and speed, the traffic flow features we defined are related to attacks and are divided into the features for all single signal phases and the features of the whole intersection. For a traffic flow of 1800 seconds, we only sample the first 10 seconds of flow head and the last 10 seconds of flow tail. For flow head, we choose features of macro, micro, or both, and then we choose the same features from the flow tail. Therefore, the number of features is from 20 to 600. We use the Z-score as a standardization to adjust feature values. For values x1,x2,…,xn of one feature in all samples, the new value is computed by x′=xi−x¯/s, in which s is the standard deviation and x¯ is the mean value of x1,x2,…,xn.Table 3
Feature composition schema through selecting equal features from traffic flow head and tail.
Flow head (10 s)Flow tail (10 s)MacrofeaturesCR,αCR, βCR, ICD, αICD, βICDCR,αCR, βCR, ICD, αICD, βICDMicrofeaturesPCD1, PCD2, …, PCD8,PCD1, PCD2, …, PCD8,αPCD1, αPCD2, …, αPCD8,αPCD1, αPCD2, …, αPCD8,βPCD1, βPCD2, …, βPCD8βPCD1, βPCD2, …, βPCD8TGRU Model. We try data spoofing exhaustedly using the last vehicle and collect time-sequence samples. For such data, we use TGRU, a time-series model with decision tree regularization, for interpretability. Figure 6 shows the TGRU architecture for end-to-end calculation.Figure 6
TGRU architecture.There are four main calculators: sigm, tanh, plus, and Hadamard product. Sigm refers to the sigmoid function, and tanh refers to the hyperbolic tangent function. The objective function is as follows:(9)minWλψW+∑n=1N∑t=1Tlossynt,y˜ntxn,W,where λλ>0 is the regularization strength, W is the whole parameter space, N is the sample number, and T denotes a sampling frequency in one series. The logistic loss function is binary cross entropy.Next, a single binary decision tree that accurately reproduces the network’s thresholded binary predictionsy˜n given input xn is found. Then, the complexity of this decision tree as the output of ΩW is measured. The complexity is measured by the average decision path length, i.e., the average number of decision nodes that must be touched to make a prediction for an input example xn. A regularization function Ω˜W is used to map W to an estimate of the average path length and is implemented by a multilayer perception (MLP) approximator.Then, tree regularization is conducted, and its objective function is defined as follows:(10)minξ∑i=1JΩWj−Ω˜Wj,ξ2+λξ22,where J is the size of the candidate dataset of W and vector ξ denotes the parameters of this chosen MLP approximator.


## 3.1. Data Spoofing Threat

There are two data spoofing attack strategies proposed in I-SIG (Figure4). The first one is a direct attack on the arrival table without considering PR; the second one is an indirect attack on EVLS when the PR is less than 95%.Figure 4
Two strategies of congestion data spoofing attack. PR is short for penetration rate. (a) Direct attack on arrival table without considering PR. (b) Indirect attack on EVLS when PR is less than 95%.
(a)(b)The first strategy is for arrival time and phase spoofing, for both the full deployment period (PR≥ 95%) and transition period (PR < 95%). The attacker changes the location and speed information in vehicle BSMs to alter the vehicle’s arrival time and requested phase; thus, the corresponding arrival table elements in Table 1 are changed. This attack strategy can directly attack input data flow no matter what the PR is. As shown in Figure 4(a), the attacker adds a spoofed vehicle into the original vehicle queue at any location. The insertion of a spoofed vehicle makes the queue longer. Moreover, there is an increase in the duration of the green light allocated by the COP algorithm for the current phase, which delays the next start time of the green light of all phases, thus increasing the delay for vehicles to pass through the intersection.The second strategy is for queue-length spoofing, for the transition period only. This strategy aims to extend the queue length estimated by the EVLS algorithm by changing the location and speed values in BSMs. Figure4(b) shows that the attacker adds a stopped vehicle with the farthest distance to the stop bar. Owing to the EVLS algorithm estimating the queue length based on the location of the last stopped connected vehicle, this attack causes the estimated queue length Les calculated by equation (2) to increase. Therefore, the number of vehicles in the queue N0i calculated by equation (3) increases as well.


## 3.2. Planning-Level Congestion Analysis

The COP algorithm is responsible for traffic signal planning; thus, it is essential for planning-level congestion analysis of I-SIG.Through reading the published COP-related papers [6, 7] and analyzing the implementation code, we reveal a more complete and detailed COP algorithm for the first time (Algorithms 1 and 2). The authors in [6] first proposed a COP algorithm that allows optimization of various performance indices, including delay, stops, and queue lengths, for the optimal control of a single intersection. However, it did not support flexible or dual ring and phase sequences, and it is difficult to understand for most readers due to the lack of the algorithm flow. Based on the COP algorithm, the authors in [7] presented a real-time adaptive traffic control algorithm by utilizing data from connected vehicles to optimize the phase sequence. However, they did not provide the details of the algorithm. Compared with [6, 7], Algorithm 1 is the first algorithm that provides a complete and detailed flow of signal planning.Algorithm 1: The COP algorithm
//The plan of the optimal green duration and phase sequenceRequire:At,k, Gminr,p, Gmaxr,p, R, T(1)
Setj=0,vj=0(2)
Xjmin=maxGmin0,0+R+Gmin0,1+R,Gmin1,0+R+Gmin1,1+R(3)
Xjmax=minGmax0,0+R+Gmax0,1+R,Gmax1,0+R+Gmax1,1+R(4)
T′=T−sj−1−⋯−s1(5)
forr=0,1do(6)
planPr,0=1+j∗2+r∗4(7)
planPr,1=2+j∗2+r∗4(8)
end for(9)
forsj=1,…,Tdo(10)
ifsj≥Xjmin and sj≤minXjmax,T′then(11)
xj=sj(12)
effectG0 = effect G1=sj−2R(13)
optV0=optV1=99999.0(14)
forr=0,1do(15)
fori=Gminr,0,…,Gmaxr,0do(16)
tGr,0=i(17)
tGr,1=effectGr−tGr,0(18)
iftGr,1≥Gminr,1 and tGr,1≤Gmaxr,1then(19)
Delayr=fr,planPr,0,planPr,1,tGr,0,tGr,1,xj,At,k//Calculated by Algorithm2(20)
ifDelayr<optVrthen(21)
optVr=Delayr(22)
optGr,0=tGr,0(23)
optGr,1=tGr,1(24)
end if(25)
end if(26)
end for(27)
:  end for(28)
else(29)
vj=99999(30)
xj=0(31)
end if(32)
end for(33)
xj∗=optGr,0+R+optGr,1+R(34)
fjxj∗=optV0+optV1(35)
vj=fjxj∗+vj−1Ensure:planPr,p,optGr,p,xj∗,vj(36)
ifj<2then(37)
j=j+1, go to step 2.(38)
end ifAlgorithm 2: The delay calculation algorithm.
//The delay calculation of ringr at stage j//fr,planPr,0,planPr,1,tGr,0,tGr,1,xj,At,kRequire:r,p1,p2,g1,g2,xj,At,k(1)
l0,p1=A0,p1,l0,p2=A0,p2(2)
fori=1,…,xjdo(3)
li,p1=li−1,p1−Di,p1+Ai,p1(4)
li,p2=li−1,p2−Di,p2+Ai,p2(5)
di=li,p1+li,p2(6)
end for(7)
s.t.Di,p1=1,ifi≤g1andi+1%2=0,0,ifg1<i≤xj,Di,p2=1,ifg1+R<i≤g1+R+g2andi+1%2=0,0,ig1+R+g2<i≤xjandi≤g1+R,(8)
Delayr=∑i=1xjdiEnsure:DelayrIn Table2, we list the meanings of the mathematical symbols that appear in the two algorithms.Table 2
Mathematical symbols used in the COP algorithm.
tIndex of arrival timekGlobal phase indexAt,kElement of arrival table denoting the number of vehicle arrivals for phasek at time tpLocal phase indexrRing index in each stageGminr,pMinimum green time of phasep in ring rGmaxr,pMaximum green time of phasep in ring rRDuration of yellow light and red lightTTotal number of discrete time steps in the planning horizon, in secondsjIndex of stagevjValue function given statej which represents the accumulated performance measure for the current and all previous stagesXjminMinimum possible length of stagejXjmaxMaximum possible length of stagejsjState variable denoting the total number of time steps allocated to stagejPlanPr,pPlanned phase of phasep in ring rEffectGrEffective total green light time of ringr in stage jOptVrOptimal delay of ringr in stage jOptGr,pOptimal green duration of phasep in ring rxjLength of stagej under the optimal solutionxj∗Length of stagej under the optimal solutionfjxjPerformance measure at stagejli,kNumber of vehicle departing for phasek at time tDi,kNumber of vehicle departing for phasek at time tDelayrDelay of ringr at stage jThe design of the COP algorithm uses the collaboration of two-stage planning and operation. The COP algorithm plans signals for the next-stage based on the vehicle’s estimation, and such planned signal duration will be operated at the next-stage signal control time. Thus, this is a continuous alternate process in a fixed phase sequence, which means that the I-SIG system cannot change the order and duration of phases in the current stage since this is set in the previous stage. When bringing foresight of planning, such a design also opens the door to attack signal planning in order to affect next-stage operation continuously.The spoofing of the arrival table affects the variablesAt,k and planPr,p and the later calculation of Delayr in line 19 of Algorithms 1. The change in Delayr causes the variables optVr in line 21, optGr,0 in line 22, and optGr,1 in line 23 of Algorithms 1 to change as well. Finally, the outputs planPr,p, optGr,p, xj∗, and vj are changed.


## 3.3. High-Level Image Feature-Based Congestion Attack Prediction

In this subsection, we employ an image feature-based CycleGAN to explain the relationship between the phase where the spoofed vehicle is located and the congestion image features two stages later.As mentioned in the Data Spoofing Threat section, there are two data spoofing attack strategies, but either attack will cause congestion in a period. Different phases of spoofed vehicles lead to different congestion effects. Therefore, the image features of intersection congestion are also different. The CycleGAN model can mine the potential relationship between two different types (X and Y) of images. Through training, CycleGAN can generate the corresponding images Y according to X and generate the related images X according to Y. Therefore, we utilize the CycleGAN model to predict the congestion effects according to the phases of spoofed vehicles, which were considered the attack feature, in order to reveal the relationship between the phase of the spoofed vehicle and the caused congestion image feature.The CycleGAN architecture is illustrated in Figure5. One training sample is a pair of image xi and image yi to form xi,yi,xi∈X, and yi∈Y. xi refers to the processed traffic image at the spoofing time, and yi is the processed traffic congestion image two stages later. The image processing consists of three steps: (1) filter out environment background; (2) extract four images, in which each has 2 phases at one intersection; and (3) join these four images from top to bottom to form one sample image according to the phase order of phase (4,7), phase (8,3), phase (2,5), and phase (6,1). Here, the number of phases is consistent with that shown in Figure 3, which is joined by the four parts of an intersection from top to down to form one sample image.Figure 5
CycleGAN architecture.There are four neural networks in the CycleGAN architecture: two generative networks (G and F) and two discriminant networks (DX and DY). The generator G generates a fake image y˜, which is similar to y given real image x, i.e., G:X⟶Y. Meanwhile, F generates a fake image x˜, which is similar to x given real image y, i.e., F:Y⟶X. The adversarial discriminator DX aims to distinguish whether the input image is x and outputs probability Px. Similarly, DY aims to discriminate whether the input image is y and outputs probability Py.Forx∈X, x⟶Gx⟶FGx≈x is a cycle, called forward cycle consistency. Similarly, for y∈Y, y⟶Fy⟶GFy≈y is a cycle called backward cycle consistency. There are two kinds of losses: adversarial loss and cycle consistency loss. Adversarial loss can only guarantee that the samples generated by the generator are distributed with the real samples, but we want the images between the corresponding domains to correspond one by one. That is, X-Y-X can also be migrated back. So, forward cycle consistency and backward cycle consistency are used to make the samples generated by two generators not contradict each other.Adversarial Loss. This refers to the difference in dataset distribution between generated images and corresponding real images. For discriminators DX and DY, the closer the output value is to 1, the smaller the loss is.The losses ofG and F can be calculated as LG and LF, respectively, as follows:(4)LGG,DY,X,Y=Ey∼PdataylogDYy+Ex∼Pdataxlog1−DYGx,(5)LFF,DX,Y,X=Ex∼PdataxlogDXx+Ey∼Pdataylog1−DYGy.Cycle Consistency Loss. This prevents the learned mappings G and F from contradicting each other, making FGx≈x and Fy≈y. The loss of LcycG,F is calculated by the following equation:(6)LcycG,F=Ex∼PdataxFGx−x1+Ey∼PdatayGFy−y1.The total loss for CycleGAN is(7)LG,F,DX,DY=LGG,DY,X,Y+LFF,DX,Y,X+λLcycG,F,in which λ is an important parameter. Then, the objective function of the CycleGAN is defined as follows:(8)G∗,F∗=argminG,FmaxDX,DYLG,F,DX,DY.The detailed implementation of neural networks in CycleGAN will be described in the following experiment setup.


## 3.4. Traffic Flow Feature-Based Congestion Attack Verification

In this subsection, we use a deep learning-based decision tree model, TGRU, to explain the relationship between the traffic flow features and the congestion attack. This relationship can then be used to verify if congestion is occurring. The TGRU model is an interpretable depth time-series model, which is very suitable for intersection traffic flow features with time characteristics. At the same time, interpretability helps to analyze better the relationship between traffic flow features and the congestion attack.The input of the congestion prediction is the traffic image feature of the intersection, and the prediction model outputs the congestion affects two stages later according to the image feature, which indicates that whether the congestion will occur. However, after the congestion prediction, the verification model is used to verify whether the congestion attack is occurring. The verification input is the defined traffic flow feature that is calculated according to vehicles’ information. When we find a possible attack that can cause congestion with high probability and subsequent traffic flows also verify congestion, then we can predict there exists a congestion attack. Thus, we can realize timely and accurate congestion attack detection by integrating empirical prediction and analytical verification.Feature Definition Based on Traffic Flow. To measure the congestion effects caused by spoofed vehicles, we propose capacity ratio and congestion degree, as well as an attack acceleration and attack amplification ratio based on capacity ratio and congestion degree. We define features as follows:(1)
Vehicle Capacity Ratio (CR). Ckmax is the maximum vehicle capacity of each phase, and the vehicle capacity of all 8 phases is computed as Ctotalmax=∑k=18Ckmax. Then, the vehicle CR can be denoted by CR=∑k=18Nk/Ctotalmax, where Nk is the vehicle number of the kth phase.(2)
Congestion Degree (CD). The number of vehicles queuing in the kth phase is denoted as Qk. Qnormal is the number of vehicles during normal queuing and is a constant. Then, the CD of the kth phase can be computed by PCDk=Qk/Qnormal, and the global CD for an intersection is ICD=∑k=18PCDk.(3)
Attack Acceleration. Let t0 be the start time of the data spoofing attack. Then, the accelerations of CR, PCDk, and ICD at time t are, respectively, calculated by αCRt=CRt−CRt0/t−t0, αPCDt,k=PCDt,k−PCDt0,k/t−t0, and αICDt=ICDt−ICDt0/t−t0.(4)
Attack Amplification Ratio. Let t0 be the start time of the data spoofing attack. Then, the amplification ratio of CR, PCDk, and ICD at time t is, respectively, calculated by βCRt=CRt/CRt0, βPCDt,k=PCDt,k/PCDt0,k, and βICDt=ICDt/ICDt0.Features are divided into macrofeatures and microfeatures for the sake of discussing interpretability, depending on whether they are a feature of the whole intersection or a specific phase (Table3). Macrofeatures measure the congestion characteristics of the whole intersection, and microfeatures measure the phase of a single signal phase. Unlike the traditional traffic flow characteristics, such as traffic flow, traffic density, and speed, the traffic flow features we defined are related to attacks and are divided into the features for all single signal phases and the features of the whole intersection. For a traffic flow of 1800 seconds, we only sample the first 10 seconds of flow head and the last 10 seconds of flow tail. For flow head, we choose features of macro, micro, or both, and then we choose the same features from the flow tail. Therefore, the number of features is from 20 to 600. We use the Z-score as a standardization to adjust feature values. For values x1,x2,…,xn of one feature in all samples, the new value is computed by x′=xi−x¯/s, in which s is the standard deviation and x¯ is the mean value of x1,x2,…,xn.Table 3
Feature composition schema through selecting equal features from traffic flow head and tail.
Flow head (10 s)Flow tail (10 s)MacrofeaturesCR,αCR, βCR, ICD, αICD, βICDCR,αCR, βCR, ICD, αICD, βICDMicrofeaturesPCD1, PCD2, …, PCD8,PCD1, PCD2, …, PCD8,αPCD1, αPCD2, …, αPCD8,αPCD1, αPCD2, …, αPCD8,βPCD1, βPCD2, …, βPCD8βPCD1, βPCD2, …, βPCD8TGRU Model. We try data spoofing exhaustedly using the last vehicle and collect time-sequence samples. For such data, we use TGRU, a time-series model with decision tree regularization, for interpretability. Figure 6 shows the TGRU architecture for end-to-end calculation.Figure 6
TGRU architecture.There are four main calculators: sigm, tanh, plus, and Hadamard product. Sigm refers to the sigmoid function, and tanh refers to the hyperbolic tangent function. The objective function is as follows:(9)minWλψW+∑n=1N∑t=1Tlossynt,y˜ntxn,W,where λλ>0 is the regularization strength, W is the whole parameter space, N is the sample number, and T denotes a sampling frequency in one series. The logistic loss function is binary cross entropy.Next, a single binary decision tree that accurately reproduces the network’s thresholded binary predictionsy˜n given input xn is found. Then, the complexity of this decision tree as the output of ΩW is measured. The complexity is measured by the average decision path length, i.e., the average number of decision nodes that must be touched to make a prediction for an input example xn. A regularization function Ω˜W is used to map W to an estimate of the average path length and is implemented by a multilayer perception (MLP) approximator.Then, tree regularization is conducted, and its objective function is defined as follows:(10)minξ∑i=1JΩWj−Ω˜Wj,ξ2+λξ22,where J is the size of the candidate dataset of W and vector ξ denotes the parameters of this chosen MLP approximator.


## 4. Experiment

### 4.1. Setup

The platform and experimental environment configuration are shown in Table4. We use a PC to run the COP algorithm and VISSIM for real-time traffic flow signal control and corresponding traffic simulation. We use another GPU server for both TGRU and CycleGAN training.Table 4
Experimental environment configuration.
PlatformExperimental environmentEnvironmental configurationCOP and VISSIMOperating systemWindows 10CPUAMD Ryzen5 3550H with Radeon Vega Mobile Gfx 2.10 GHzRAM16GSoftwarePTV VISSIM 4.30, Visual Studio 2019TGRU and CycleGANOperating systemUbuntu 16.04.6 LTSCPUIntel(R) Core(TM) i7-9700F CPU @ 3.00 GHzRAM32GGPUMSI GeForce RTX 2070 VENTUSGraphic memory151MiBFrameworkTensorFlow-gpu-1.14.0VISSIM, the traffic simulation platform, can capture and display the changes of traffic signal and traffic flow planned by the COP algorithm in real-time, as shown in Figure7. Table 5 shows the sample datasets for TGRU and CycleGAN. In TGRU, we train a 3-layer MLP with 100 first-layer nodes, 100 second-layer nodes, and 10 third-layer nodes. In the CycleGAN, the generator contains encoding, transformation, and decoding. Encoding includes one 7 × 7 Convolution-InstanceNorm-ReLU layer with stride 1 and two 3 × 3 Convolution-InstanceNorm-ReLU layers with stride 2. Transformation includes 9 residual blocks for 256 × 256 images and two 3 × 3 convolutional layers with the same number of filters on both layers. Finally, decoding includes two 3 × 3 fractional strided Convolution-InstanceNorm-ReLU layers with stride 2 and one 7 × 7 Convolution-InstanceNorm-ReLU layer with stride 1. In the discriminator networks, we use 70 × 70 PatchGANs [17], and the discriminator architecture includes four 4 × 4 Convolution-InstanceNorm-Leaky-ReLU layers with stride 2. The last layer contains a convolution to produce a 1-dimensional output.Figure 7
VISSIM simulation environment. The planned results of the COP algorithm and the real-time traffic flow are displayed in VISSIM.Table 5
Sample datasets for TGRU and CycleGAN.
TGRUFeature number32Sample number610CycleGANImage (256 × 256 pixels) number ofX2238Image (256 × 256 pixels) number ofY2238


### 4.2. Congestion Attack Prediction and Visualized Analysis

We evaluate the performance of the CycleGAN model based on image features.Evaluation Metric. For N samples testing, we further evaluate the CR, PCD, and ICD based on the mean absolute error (MAE) and root mean squared error (RMSE). We have MAE and RMSE of CR expressed as follows:(11)MAECR=1N∑i=1NCRi−CRi˜,RMSECR=1N∑i=1NCRi−CRi˜2,where CRi is the real value and CRi˜ is the estimated value. Similarly, we have MAEPCDk, RMSEPCDk, MAEICD, and RMSEICD.Visualized Results and Quantitative Qnalysis. In Figure 8, the first column is the original image x, the second one is the output image G(x) by CycleGAN, and the third column gives the real image y with congestion. Our approach has a satisfied generator and can predict a future result of congestion attacks to provide a visualization for better human understanding.Figure 8
Visualized CycleGAN output compared with real traffic image two stages later based on three different original image inputs at the beginning of spoofing attack. The blue dots represent OBU-equipped vehicles whereas the while dots represent unequipped vehicles.Table6–8 show MAE and RMSE values under different evaluation metrics and test sets. Tables 6 and 7 show the CR and CD measurements of one intersection and display a satisfying prediction compared with the ground truth. As shown in Table 6, in 10-fold cross validation, our CycleGAN has a pretty good performance in CR prediction. It has very small MAE and RMSE values, 0.0205 and 0.0225, respectively, which is better than that obtained with 4-fold cross validation.Table 6
MAECRand RMSECR obtained on training set and with 4-fold cross validation or 10-fold cross validation.
Training set4-fold cross validation10-fold cross validationMAECR0.02570.02130.0205RMSECR0.03100.02560.0225The bold values denote the minimum values of MAE or RMSE on different training sets.Table 7
MAEICD and RMSEICD on training set and with 4-fold cross validation or 10-fold cross validation.
Training set4-fold cross validation10-fold cross validationMAEICD0.83500.81001.1800RMSEICD1.05000.99871.3609The bold values denote the minimum values of MAE or RMSE on different training sets.Table 8
MAEPCD and RMSEPCD on training set and with 4-fold cross validation or 10-fold cross validation (k denotes the kth phase).
MAEPCDkRMSEPCDkTraining set4-fold cross validation10-fold cross validationTraining set4-fold cross validation10-fold cross validationk = 10.56500.44500.65750.67490.54970.7884k = 20.38500.50500.36250.50740.62680.4242k = 30.22500.20500.20500.26170.25190.2360k = 40.34500.32000.22500.43190.37330.2639k = 50.83000.92000.59250.98591.10700.5720k = 60.38500.53500.41250.50350.65350.5188k = 70.39000.37500.36000.47010.47590.4602k = 80.43000.28000.26000.49900.35500.3131For ICD (Table7), the 4-fold cross validation results of MAE and RMSE are better than those of 10-fold cross validation, reaching 0.8100 and 0.9987, respectively. We present the detailed values of each phase for MAE and RMSE of congestion degree in Table 8. We can see that through comparing values based on the training set and cross validation, our CycleGAN-based model does not overfit by training. The best results are at k = 3, and we have the lowest values of MAEPCDk and RMSEPCDk (0.2250, 0.2050, 0.2050, 0.2617, 0.2519, and 0.2360) compared with the values of other phases. However, the errors at k = 5 increase a lot, which is why MAEICD and RMSEICD approach 1. This is because the fewer the vehicles, the better the prediction effect of the model. However, the attack vehicle is at phase 3, which has the least number of queues, while the congestion occurs at phase 5, which has the largest number of queues. Therefore, the prediction effect of phase 3 is the best of the 8 phases, so the lowest MAE and RMSE values are k = 3, while the prediction errors at phase 5 increased a lot.We present bar charts for MAE and RMSE of 8-phase congestion degree in Figures9 and 10, respectively. In Figure 9, the best average value of MAE is based on 10-fold cross validation (with a value of 0.3844), and the worst average value is based on 4-fold cross validation (with a value of 0.4481). In Figure 10, we have similar results for RMSE; the best and the worst are 0.4471 and 0.5491, respectively. Both average values mean that the CycleGAN is robust and that we have good feature capture in our approach.Figure 9
Bar chart ofMAEPCDk.Figure 10
Bar chart ofRMSEPCDk.In addition, we compare the performance of the CycleGAN model with that of pix2pix [17], another GAN-based model, by quantitatively analyzing experimental results from the whole intersection and the specific phases perspective, respectively. Here, we use the experimental results under 4-fold cross validation. For the measurements of the whole intersection, as shown in Table 9, we have MAECR  = 0.0213, RMSECR  = 0.0256, MAEICD  = 0.8100, and RMSEICD  = 0.9987 for CycleGAN and MAECR  = 0.1167, RMSECR  = 0.1297, MAEICD  = 3.7917, and RMSEICD  = 3.8500 for pix2pix. We can see that CycleGAN has lower MAE and RMSE values than pix2pix. Therefore, the CycleGAN model has a better performance than the pix2pix model on the measurements of the whole intersection.Table 9
MAECR, RMSECR, MAEICD, and RMSEICD of CycleGAN and pix2pix with 4-fold cross validation.
CycleGANpix2pixMAECR0.02130.1167RMSECR0.02560.1297MAEICD0.81003.7917RMSEICD0.99873.8500We further compare the model performance for the specific phases. Table10 shows the detailed MAE and RMSE values of each phase for CycleGAN and pix2pix. There are the lowest MAE and RMSE values at k = 3 for both models: 0.2050 and 0.2538 for CycleGAN and 0.2519 and 0.9830 for pix2pix. For all phases, the MAE and RMSE values of CycleGAN are lower than those of pix2pix. Therefore, the CycleGAN model also has a better performance than the pix2pix model on the measurements of all phases.Table 10
MAEPCD and RMSEPCD of CycleGAN and pix2pix with 4-fold cross validation (k denotes the kth phase).
MAEPCDkRMSEPCDkCycleGANpix2pixCycleGANpix2pixk = 10.44502.95000.54973.2383k = 20.50500.98500.62681.1697k = 30.20500.25380.25190.9830k = 40.32001.75500.37332.7336k = 50.92003.32831.10703.4750k = 60.53501.12500.65351.1307k = 70.37501.95000.47592.3499k = 80.28000.33420.35500.5393The bold values denote the minimum values of MAE or RMSE when k varies from 1 to 8.To sum up, in the CycleGAN-based prediction model, we extract four-direction road images of the intersection and perform phase-based composition for generating a new sample image to quantify the traffic flow characteristics. Based on the image feature, the CycleGAN-based approach analyzes the potential relationship between the congestion attack and the corresponding congestion effect two stages later. Also, the model is used to analyze the congestion effects that different phases of the attack vehicle caused. Meanwhile, we can obtain the visualized results based on the image feature. The experimental results on the CycleGAN-based model and compared experiments with the pix2pix model demonstrated the superiority of the CycleGAN-based model.


### 4.3. Congestion Attack Verification

Here, we evaluate the performance of the TGRU model based on traffic flow features. We use the confusion matrix, accuracy, AUC value, precision, recall, and F1-score.The TGRU model is trained to distinguish whether the intersection is under a spoofing attack based on traffic flow features. We collect time-series traffic flow data for 3600 seconds under both the normal state and attack state. We consider 1-second intervals as time steps. Each data vectorxnt has 30 features, as defined in Section 3.4. Each outcome ynt is a binary label marking whether the intersection is under a spoofing attack. The sequence length is set to 20 seconds, considering that the maximum green time of each signal is 20 seconds. Hence, 360 samples are obtained in total: 180 samples of which contain 3600 traffic flow data and are used for training and the other 180 samples are used for testing.We apply the model to the test set and calculate its AUC value, accuracy, precision, recall, and F1-score; these values are reported in Table11. We see that for different parameter settings, the TGRU model with our defined traffic features can achieve a great prediction quality. The AUC values are all approximately 0.8, and the accuracy values are 0.79, 0.79, and 0.75 when using different parameter settings. Furthermore, the average values of precision, recall, and F1-score are satisfying, almost near 0.8.Table 11
TGRU performance in terms of AUC value, accuracy, precision, recall, and F1-score.
Iteration timesAUCAccuracyClassification reportPrecisionRecallF1-scoreIters_retrain = 250.820.790: normal0.710.980.82Num_iters = 3001: attack0.970.590.74Average0.840.790.78Iters_retrain = 500.850.790: normal0.720.950.82Num_iters = 10001: attack0.930.640.76Average0.830.790.79Iters_retrain = 1000.780.750: normal0.690.900.78Num_iters = 30001: attack0.860.600.71Average0.780.750.75Figure11 shows the three ROC [18] curves of TGRU. Corresponding AUC values are shown as well. We can see that these curves are similar, and their AUC values (0.82, 0.85, and 0.78) are all around 0.8. Moreover, the TGRU model has similar performance with different parameter settings; this indicates that our defined classification features are efficient, and the different parameter settings have little effect on TGRU model’s performance.Figure 11
ROC curve of TGRU with AUC values.The decision tree generated by Graphviz [19] is shown in Figure 12. For 3600 traffic flows, this tree has 9 levels. From top to down, according to each feature value, the flow data can be grouped into different classes step by step. For example, when X [13] ≤ 0.068, there are 32 traffic flows of 57 flows correctly predicted as the class of spoofing attack 1; this indicates the importance of the 13th dimension feature, i.e., the congestion degree of the 8th phase PCD8, in predicting the class of spoofing attack 1.Figure 12
Whole decision tree of 9-level depth.Also, we compare the TGRU model with a time-series prediction method, seasonal autoregressive integrated moving average (SARIMA). Here, it is detected whether the congestion occurs or not based on traffic flow features. We carry out experiments for different approaches under different traffic flow feature sets. We choose the primary traffic flow data for the first feature set as the traffic flow feature FS1. The second feature set FS2 is shown in Table 3. According to the two approaches, we construct two feature sets based on the traffic flow data we collect. As shown in Table 12, the accuracy values of SARIMA and TGRU on the feature set FS1 are 0.744 and 0.772, respectively, and on the feature set FS2 are 0.784 and 0.790, respectively, which demonstrates that the TGUR model based on our defined traffic flow features is superior to others.Table 12
Comparison of different prediction approaches.
Feature setFS1FS2SARIMA0.7440.784TGRU0.7720.790The bold values are the maximum of accuracy when the prediction approach is different.In conclusion, in the TGRU-based verification model, we propose some timing characteristics, including capacity ratio, congestion degree, attack acceleration, and attack amplification ratio, to measure the congestion effects based on traffic flow. Based on the defined traffic flow features, the TGRU-based model is used to analyze the underlying relationship between the congestion attack and traffic flow features at the current moment. Meanwhile, the decision tree helps better interpret the relationship between traffic flow features and the congestion attack. The experimental results on the TGRU-based model and compared experiments with the SARIMA model demonstrated the superiority of the TGRU-based approach.


## 4.1. Setup

The platform and experimental environment configuration are shown in Table4. We use a PC to run the COP algorithm and VISSIM for real-time traffic flow signal control and corresponding traffic simulation. We use another GPU server for both TGRU and CycleGAN training.Table 4
Experimental environment configuration.
PlatformExperimental environmentEnvironmental configurationCOP and VISSIMOperating systemWindows 10CPUAMD Ryzen5 3550H with Radeon Vega Mobile Gfx 2.10 GHzRAM16GSoftwarePTV VISSIM 4.30, Visual Studio 2019TGRU and CycleGANOperating systemUbuntu 16.04.6 LTSCPUIntel(R) Core(TM) i7-9700F CPU @ 3.00 GHzRAM32GGPUMSI GeForce RTX 2070 VENTUSGraphic memory151MiBFrameworkTensorFlow-gpu-1.14.0VISSIM, the traffic simulation platform, can capture and display the changes of traffic signal and traffic flow planned by the COP algorithm in real-time, as shown in Figure7. Table 5 shows the sample datasets for TGRU and CycleGAN. In TGRU, we train a 3-layer MLP with 100 first-layer nodes, 100 second-layer nodes, and 10 third-layer nodes. In the CycleGAN, the generator contains encoding, transformation, and decoding. Encoding includes one 7 × 7 Convolution-InstanceNorm-ReLU layer with stride 1 and two 3 × 3 Convolution-InstanceNorm-ReLU layers with stride 2. Transformation includes 9 residual blocks for 256 × 256 images and two 3 × 3 convolutional layers with the same number of filters on both layers. Finally, decoding includes two 3 × 3 fractional strided Convolution-InstanceNorm-ReLU layers with stride 2 and one 7 × 7 Convolution-InstanceNorm-ReLU layer with stride 1. In the discriminator networks, we use 70 × 70 PatchGANs [17], and the discriminator architecture includes four 4 × 4 Convolution-InstanceNorm-Leaky-ReLU layers with stride 2. The last layer contains a convolution to produce a 1-dimensional output.Figure 7
VISSIM simulation environment. The planned results of the COP algorithm and the real-time traffic flow are displayed in VISSIM.Table 5
Sample datasets for TGRU and CycleGAN.
TGRUFeature number32Sample number610CycleGANImage (256 × 256 pixels) number ofX2238Image (256 × 256 pixels) number ofY2238


## 4.2. Congestion Attack Prediction and Visualized Analysis

We evaluate the performance of the CycleGAN model based on image features.Evaluation Metric. For N samples testing, we further evaluate the CR, PCD, and ICD based on the mean absolute error (MAE) and root mean squared error (RMSE). We have MAE and RMSE of CR expressed as follows:(11)MAECR=1N∑i=1NCRi−CRi˜,RMSECR=1N∑i=1NCRi−CRi˜2,where CRi is the real value and CRi˜ is the estimated value. Similarly, we have MAEPCDk, RMSEPCDk, MAEICD, and RMSEICD.Visualized Results and Quantitative Qnalysis. In Figure 8, the first column is the original image x, the second one is the output image G(x) by CycleGAN, and the third column gives the real image y with congestion. Our approach has a satisfied generator and can predict a future result of congestion attacks to provide a visualization for better human understanding.Figure 8
Visualized CycleGAN output compared with real traffic image two stages later based on three different original image inputs at the beginning of spoofing attack. The blue dots represent OBU-equipped vehicles whereas the while dots represent unequipped vehicles.Table6–8 show MAE and RMSE values under different evaluation metrics and test sets. Tables 6 and 7 show the CR and CD measurements of one intersection and display a satisfying prediction compared with the ground truth. As shown in Table 6, in 10-fold cross validation, our CycleGAN has a pretty good performance in CR prediction. It has very small MAE and RMSE values, 0.0205 and 0.0225, respectively, which is better than that obtained with 4-fold cross validation.Table 6
MAECRand RMSECR obtained on training set and with 4-fold cross validation or 10-fold cross validation.
Training set4-fold cross validation10-fold cross validationMAECR0.02570.02130.0205RMSECR0.03100.02560.0225The bold values denote the minimum values of MAE or RMSE on different training sets.Table 7
MAEICD and RMSEICD on training set and with 4-fold cross validation or 10-fold cross validation.
Training set4-fold cross validation10-fold cross validationMAEICD0.83500.81001.1800RMSEICD1.05000.99871.3609The bold values denote the minimum values of MAE or RMSE on different training sets.Table 8
MAEPCD and RMSEPCD on training set and with 4-fold cross validation or 10-fold cross validation (k denotes the kth phase).
MAEPCDkRMSEPCDkTraining set4-fold cross validation10-fold cross validationTraining set4-fold cross validation10-fold cross validationk = 10.56500.44500.65750.67490.54970.7884k = 20.38500.50500.36250.50740.62680.4242k = 30.22500.20500.20500.26170.25190.2360k = 40.34500.32000.22500.43190.37330.2639k = 50.83000.92000.59250.98591.10700.5720k = 60.38500.53500.41250.50350.65350.5188k = 70.39000.37500.36000.47010.47590.4602k = 80.43000.28000.26000.49900.35500.3131For ICD (Table7), the 4-fold cross validation results of MAE and RMSE are better than those of 10-fold cross validation, reaching 0.8100 and 0.9987, respectively. We present the detailed values of each phase for MAE and RMSE of congestion degree in Table 8. We can see that through comparing values based on the training set and cross validation, our CycleGAN-based model does not overfit by training. The best results are at k = 3, and we have the lowest values of MAEPCDk and RMSEPCDk (0.2250, 0.2050, 0.2050, 0.2617, 0.2519, and 0.2360) compared with the values of other phases. However, the errors at k = 5 increase a lot, which is why MAEICD and RMSEICD approach 1. This is because the fewer the vehicles, the better the prediction effect of the model. However, the attack vehicle is at phase 3, which has the least number of queues, while the congestion occurs at phase 5, which has the largest number of queues. Therefore, the prediction effect of phase 3 is the best of the 8 phases, so the lowest MAE and RMSE values are k = 3, while the prediction errors at phase 5 increased a lot.We present bar charts for MAE and RMSE of 8-phase congestion degree in Figures9 and 10, respectively. In Figure 9, the best average value of MAE is based on 10-fold cross validation (with a value of 0.3844), and the worst average value is based on 4-fold cross validation (with a value of 0.4481). In Figure 10, we have similar results for RMSE; the best and the worst are 0.4471 and 0.5491, respectively. Both average values mean that the CycleGAN is robust and that we have good feature capture in our approach.Figure 9
Bar chart ofMAEPCDk.Figure 10
Bar chart ofRMSEPCDk.In addition, we compare the performance of the CycleGAN model with that of pix2pix [17], another GAN-based model, by quantitatively analyzing experimental results from the whole intersection and the specific phases perspective, respectively. Here, we use the experimental results under 4-fold cross validation. For the measurements of the whole intersection, as shown in Table 9, we have MAECR  = 0.0213, RMSECR  = 0.0256, MAEICD  = 0.8100, and RMSEICD  = 0.9987 for CycleGAN and MAECR  = 0.1167, RMSECR  = 0.1297, MAEICD  = 3.7917, and RMSEICD  = 3.8500 for pix2pix. We can see that CycleGAN has lower MAE and RMSE values than pix2pix. Therefore, the CycleGAN model has a better performance than the pix2pix model on the measurements of the whole intersection.Table 9
MAECR, RMSECR, MAEICD, and RMSEICD of CycleGAN and pix2pix with 4-fold cross validation.
CycleGANpix2pixMAECR0.02130.1167RMSECR0.02560.1297MAEICD0.81003.7917RMSEICD0.99873.8500We further compare the model performance for the specific phases. Table10 shows the detailed MAE and RMSE values of each phase for CycleGAN and pix2pix. There are the lowest MAE and RMSE values at k = 3 for both models: 0.2050 and 0.2538 for CycleGAN and 0.2519 and 0.9830 for pix2pix. For all phases, the MAE and RMSE values of CycleGAN are lower than those of pix2pix. Therefore, the CycleGAN model also has a better performance than the pix2pix model on the measurements of all phases.Table 10
MAEPCD and RMSEPCD of CycleGAN and pix2pix with 4-fold cross validation (k denotes the kth phase).
MAEPCDkRMSEPCDkCycleGANpix2pixCycleGANpix2pixk = 10.44502.95000.54973.2383k = 20.50500.98500.62681.1697k = 30.20500.25380.25190.9830k = 40.32001.75500.37332.7336k = 50.92003.32831.10703.4750k = 60.53501.12500.65351.1307k = 70.37501.95000.47592.3499k = 80.28000.33420.35500.5393The bold values denote the minimum values of MAE or RMSE when k varies from 1 to 8.To sum up, in the CycleGAN-based prediction model, we extract four-direction road images of the intersection and perform phase-based composition for generating a new sample image to quantify the traffic flow characteristics. Based on the image feature, the CycleGAN-based approach analyzes the potential relationship between the congestion attack and the corresponding congestion effect two stages later. Also, the model is used to analyze the congestion effects that different phases of the attack vehicle caused. Meanwhile, we can obtain the visualized results based on the image feature. The experimental results on the CycleGAN-based model and compared experiments with the pix2pix model demonstrated the superiority of the CycleGAN-based model.


## 4.3. Congestion Attack Verification

Here, we evaluate the performance of the TGRU model based on traffic flow features. We use the confusion matrix, accuracy, AUC value, precision, recall, and F1-score.The TGRU model is trained to distinguish whether the intersection is under a spoofing attack based on traffic flow features. We collect time-series traffic flow data for 3600 seconds under both the normal state and attack state. We consider 1-second intervals as time steps. Each data vectorxnt has 30 features, as defined in Section 3.4. Each outcome ynt is a binary label marking whether the intersection is under a spoofing attack. The sequence length is set to 20 seconds, considering that the maximum green time of each signal is 20 seconds. Hence, 360 samples are obtained in total: 180 samples of which contain 3600 traffic flow data and are used for training and the other 180 samples are used for testing.We apply the model to the test set and calculate its AUC value, accuracy, precision, recall, and F1-score; these values are reported in Table11. We see that for different parameter settings, the TGRU model with our defined traffic features can achieve a great prediction quality. The AUC values are all approximately 0.8, and the accuracy values are 0.79, 0.79, and 0.75 when using different parameter settings. Furthermore, the average values of precision, recall, and F1-score are satisfying, almost near 0.8.Table 11
TGRU performance in terms of AUC value, accuracy, precision, recall, and F1-score.
Iteration timesAUCAccuracyClassification reportPrecisionRecallF1-scoreIters_retrain = 250.820.790: normal0.710.980.82Num_iters = 3001: attack0.970.590.74Average0.840.790.78Iters_retrain = 500.850.790: normal0.720.950.82Num_iters = 10001: attack0.930.640.76Average0.830.790.79Iters_retrain = 1000.780.750: normal0.690.900.78Num_iters = 30001: attack0.860.600.71Average0.780.750.75Figure11 shows the three ROC [18] curves of TGRU. Corresponding AUC values are shown as well. We can see that these curves are similar, and their AUC values (0.82, 0.85, and 0.78) are all around 0.8. Moreover, the TGRU model has similar performance with different parameter settings; this indicates that our defined classification features are efficient, and the different parameter settings have little effect on TGRU model’s performance.Figure 11
ROC curve of TGRU with AUC values.The decision tree generated by Graphviz [19] is shown in Figure 12. For 3600 traffic flows, this tree has 9 levels. From top to down, according to each feature value, the flow data can be grouped into different classes step by step. For example, when X [13] ≤ 0.068, there are 32 traffic flows of 57 flows correctly predicted as the class of spoofing attack 1; this indicates the importance of the 13th dimension feature, i.e., the congestion degree of the 8th phase PCD8, in predicting the class of spoofing attack 1.Figure 12
Whole decision tree of 9-level depth.Also, we compare the TGRU model with a time-series prediction method, seasonal autoregressive integrated moving average (SARIMA). Here, it is detected whether the congestion occurs or not based on traffic flow features. We carry out experiments for different approaches under different traffic flow feature sets. We choose the primary traffic flow data for the first feature set as the traffic flow feature FS1. The second feature set FS2 is shown in Table 3. According to the two approaches, we construct two feature sets based on the traffic flow data we collect. As shown in Table 12, the accuracy values of SARIMA and TGRU on the feature set FS1 are 0.744 and 0.772, respectively, and on the feature set FS2 are 0.784 and 0.790, respectively, which demonstrates that the TGUR model based on our defined traffic flow features is superior to others.Table 12
Comparison of different prediction approaches.
Feature setFS1FS2SARIMA0.7440.784TGRU0.7720.790The bold values are the maximum of accuracy when the prediction approach is different.In conclusion, in the TGRU-based verification model, we propose some timing characteristics, including capacity ratio, congestion degree, attack acceleration, and attack amplification ratio, to measure the congestion effects based on traffic flow. Based on the defined traffic flow features, the TGRU-based model is used to analyze the underlying relationship between the congestion attack and traffic flow features at the current moment. Meanwhile, the decision tree helps better interpret the relationship between traffic flow features and the congestion attack. The experimental results on the TGRU-based model and compared experiments with the SARIMA model demonstrated the superiority of the TGRU-based approach.


## 5. Defense Suggestions

To proactively address the congestion attack of the I-SIG system, this section discusses how to defend against the attacks assessed above.EVLS Improvement for COP Reinforcement. As estimated by the USDOT [20], I-SIG may take 25–30 years to reach a 95% PR for intelligent transportation systems. Thus, for I-SIG under a real low PR, I-SIG needs to adopt an EVLS algorithm to estimate non-OBU-equipped vehicles’ location and speed. In the current I-SIG system design, the congestion attack on the COP algorithm utilizes a nonrobust estimation of EVLS. However, it is possible to improve EVLS and thus reinforce the COP algorithm. For single global positioning system (GPS) spoofing, we can introduce more collaboration mechanisms from the transportation field, such as the car-following model. A natural way to accomplish this is to significantly improve queue-length prediction. In the existing EVLS, this could be realized by adding a new software module that interacts with the COP algorithm. Such implementation has a low cost and brings little change to the original COP algorithm.Another problem is the high impact of PR on security, which we have to change. In the current design, when the PR is smaller, the impact of the attack on the system is more significant because the system cannot accurately obtain the queue length with fewer data. We do not suggest providing two alternative versions of EVLS (i.e., one for high and one for low PR, respectively). Although we analyzed a car-following model in work [21], we believe that a more useful model with a collaboration mechanism should be studied; this will make the estimation of EVLS more accurate as well as COP security more robust.Authentication and Anomaly Detection. In the current design, authentication is realized through communication between OBU and RSU. However, the attack vehicle might not be a newly joining vehicle or an unauthenticated vehicle; in fact, it can be a normal vehicle with legal authentication. Thus, although authentication reinforcement is not the solution, it can be used to aid in anomaly detection. The idea is that a vehicle cannot appear somewhere suddenly; from the beginning authentication, we should perform analysis on time-series trajectory data to discover any anomaly behavior; this requires a powerful RSU with more computing ability and storing capacity. In addition to an anomaly detection algorithm, implementation needs the support of a collaboration mechanism of multiple I-SIGs; this is a complex global design of intelligent transportation and has not been realized yet. We believe this is critical work that must be accomplished before wide I-SIG deployment.Prevent Cold-Start Attack. Essentially, the congestion attack is a type of insider attack. Thus, it is challenging to perform anomaly detection for such an attack in a pretty short time only based on nearby vehicle speed and location information. This means that we cannot avoid the first spoofing data entering the arrival table of the COP algorithm. We suggest that emerging blockchain technology, especially light blockchain, should be considered to rebuild I-SIG or even the whole intelligent transportation system. After that, any data of one node have to be verified by all other nodes. This would result in nearly no chance for spoofed data to be accepted. However, the cost of rebuilding the system is obviously enormous, and more attention should be paid to the light blockchain to test the trade-off between efficiency and security. Regardless, we still believe that this is a promising future for I-SIG security defense.


## 6. Related Work

Data Spoofing Attacks in SAGIN. The SAGIN has a heterogeneous structure, including vehicle nodes, roadside infrastructure, mobile terminal users, drones, airships, and other stratospheric nodes, as well as high altitude satellite nodes; this brings security challenges [22], such as the various attacks of authenticity, identity, confidentiality, data integrity, and privacy [23]. As a SAGIN-based intelligent transportation system deployed in California, Florida, and New York by the USDOT, I-SIG is exposed to data spoofing attacks [8], which can cause heavy congestion. Such an attack is a position-faking attack of GPS spoofing but is different from a tunnel attack. In a tunnel attack, each vehicle of a Vehicular Ad hoc NETwork (VANET) [24, 25] is equipped with a positioning system (receiver). The attack can be achieved using a transmitter generating localization signals stronger than those generated by the real satellites [26, 27]. The victim could be waiting for a GPS signal after leaving a physical tunnel or a jammed-up area. In comparison, the position spoofing attack to I-SIG refers to an authenticated vehicle only sending the wrong position to affect the COP algorithm, which has lower attack cost and easier implementation. In such an attack, the data spoofing is just one factor, while the mechanism of the COP algorithm is the key factor. Furthermore, for the GPS spoofing attack, our work focuses on algorithm-level security analysis under a spoofing attack.Congestion Attack Analysis. The previous work [8] reveals the existence of such congestion attacks on the COP algorithm. It analyzes how congestion attacks affect COP decisions and explains how to execute an attack using data spoofing in SAGIN. However, it lacks consideration about the potential features and the quantified correlation between the attack and congestion degree. In comparison, we demystify the attack on I-SIG and corresponding congestion from a machine learning perspective by exploring different kinds of features based on both supervised learning and unsupervised learning. In addition, as the first utilization of both traffic flow features and image features, our work can inspire all stakeholders of I-SIG, including experts of transportation, SAGIN, and security.


## 7. Conclusions

Toward the spoofing to connected vehicle technology and the SAGIN, a congestion attack has been revealed on the COP algorithm of I-SIG, which performs dynamic and optimal signal control based on automatic traffic situation awareness. Owing to the lack of quantified feature-level analysis, we demystify the attack on I-SIG and the corresponding congestion from both supervised learning and unsupervised learning. We propose a CycleGAN-based approach to analyze the potential relations between the congestion attack and the corresponding results two stages later. We also present a TGRU-based approach to explore the relations between the congestion attack and traffic flow features at a certain moment. In our experiment, we collect high-quality 4476 image samples and 3600 attack-oriented traffic flow data. We then evaluate our approach empirically using the COP algorithm and VISSIM, and our results show the effectiveness of our approach compared with ground truth.This work is expected to inspire a series of follow-up studies on the security of CV-based I-SIG, but not limited to (1) more machine learning-based approaches, (2) more concrete defense implementation on SAGIN-based I-SIG, and (3) more feature fusion for attack and defense analysis.



---

*Source: 1632825-2021-10-31.xml*