Next Article in Journal
Characterization of FIREFLY, an Imaging Spectrometer Designed for Remote Sensing of Solar Induced Fluorescence
Previous Article in Journal
Energy-Guided Temporal Segmentation Network for Multimodal Human Action Recognition
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

SDN-Based Survivability Analysis for V2I Communications

School of Information Science and Technology, Nantong University, Nantong 226019, China
*
Author to whom correspondence should be addressed.
Sensors 2020, 20(17), 4678; https://doi.org/10.3390/s20174678
Submission received: 15 July 2020 / Revised: 7 August 2020 / Accepted: 16 August 2020 / Published: 19 August 2020
(This article belongs to the Section Sensor Networks)

Abstract

:
In vehicle-to-infrastructure (V2I) communications, various failures in the dynamic movement pose serious link interruptions. To study the continuous service quality for the V2I network when this issue happens, this paper proposes a survivability analysis and establishes the communication architecture for software-defined network (SDN)-based V2I communications. With the controllable advantages of SDN centralized management, the multi-path transmission control protocol is used to seamlessly switch the transmission information between the V2I links of each vehicle node. Specifically, according to the analysis of specific fault types for V2I links, the definitions of SDN-based V2I survivability is provided to establish the corresponding survivability mode. To further verify the survivability model, a full-state search is adopted by means of probability model checker PRISM. In addition, multi-directional probability and expected reward evaluation analyses are carried out from the point of view of time. The simulation results show that, with the failure of multiple V2I links, the network quality of service (QoS) correspondingly declines, but the network still survives, due to the multi-path transmission control protocol (MPTCP) action. Moreover, with a high fault repair rate, the service performance and survivability of the network is improved rapidly.

1. Introduction

Survivability refers to the ability of the system to recover in time after the occurrence of abnormal events. It is a promising method to solve the problems of faults and various attacks in vehicle communication networks. The goal of survivability research is to analyze and evaluate the survival ability of vehicle networks, in order to find out the hidden dangers and weak links in the network and take a series of effective measures to improve the survival ability of network links.
The effective communication between the vehicle and roadside infrastructure (vehicle to infrastructure, V2I) in vehicle networks is an important factor for the road traffic convenience and safety, where the roadside infrastructure mainly includes a roadside unit (RSU), wireless access point (Wi-Fi), base station (BS, for WIMAX/LTE/4G/5G/6G), and so on. Via the roadside infrastructure, the vehicle personnel can search the optimal path to the destination, understand the real-time traffic information, transmit the current emergency information, download entertainment and news video information timely, and so forth. Thus, the connectivity of each communication link in V2I networks is key to ensure the normal operation of the whole vehicle network, and it is also reflected in the survivability of the vehicle network. It can be observed that, in the actual process of V2I network communication, due to the high-speed mobility of the vehicle, there is various randomness and uncertainty when connecting to infrastructures, meanwhile some abnormal conditions are usually encountered, leading to an interruption or failure of the link connection. These factors include encountering a denial of service (DoS) attack [1], channel fading, high-level objects, human accidents, natural disasters, and so on. In addition, the frequent switching between V2I links also provides the problem of communication delay or failure. Aiming to solve these problems, it is necessary to analyze the survivability for V2I communications to achieve the maximum transmission performance.
On the other hand, software-defined network (SDN)-based vehicle networking refers to the programmable design and flexible management under the control of the software program center [2,3]. This mobile management mechanism can be effectively adapted to the dynamic change of vehicle networks, which is more suitable for future vehicle networks based on 5G and 6G technologies than the traditional fixed management mechanism. Due to the advantage of a centralized control for SDN, the link connectivity can be effectively controlled in vehicle networks. More specifically, a SDN central controller can effectively switch to other idle links to continue the data communication, when the link connected to the vehicle has a fault problem and is waiting to be repaired. In these link-switching processes, switching mechanisms under the same or different access technologies can be used to complete the switching. It is known that the previous switching mechanism uses a transmission control protocol (TCP) and a one-to-one internet protocol (IP) path to switch frequently via a single network interface, resulting in a possible seamless connectivity along with the latency. Recently, a new switching mechanism was investigated by using multi-path transmission control protocol (MPTCP), with advantages that include making no changes to the original roadside infrastructure but simply configuring the vehicle with multiple network interfaces and IP paths, it can satisfy the one-to-many link seamless switching and significantly improve the network performance.
In recent years, many researches related to MPTCP have been applied to emerging networks, such as vehicle networks, future long term evolution (LTE) networks, an 5G networks [4,5,6,7,8]. In Reference [4], the authors described how MPTCP can effectively utilize the current radio technology and switch robustly to keep the vehicle connection and improve the network performance. Due to that, MPTCP is one of the most important candidate protocols to improve end-to-end (E2E) communication reliability, elasticity, and bandwidth efficiency in 5G mobile networks. The authors in Reference [5] introduced the applications of MPTCP to LTE networks in detail. In Reference [6], the MPTCP congestion control extension algorithm for LTE networks is proposed with the goal of aggregating the available bandwidth of multiple paths, as well as that it can avoid the common single-path TCP transmission of shared paths attack behavior. In addition, the combination of MPTCP and SDN in V2I networks within the vehicle short-distance communication is proposed in Reference [7], where the connectivity between the vehicle and Wi-Fi, vehicle and RSU are simulated by using Mininet-WiFi. Moreover, the connectivity performance is also measured from three indexes: packet loss rate, round-trip time, and average throughput, respectively. In Reference [8], the authors proposed the use of MPTCP to communicate reliably on the Internet of Vehicles (IoV).
It is worth noting that, in this paper, the survivability refers to the service quality of the system to complete the key tasks in time when the software and hardware fail, which not only pays attention to the overall security of the network system but also ensures the timely and effective transmission of the key information. On the basis of this, the study of survivability has been applied in various networks, such as information systems [9], wavelength division multiplexing (WDM) fiber optic networks [10,11], asynchronous transfer mode (ATM) networks [12], internet [13], military communications networks [14], satellite communications networks [15], wireless sensor networks [16,17,18], and vehicular ad-hoc networks (VANETs) [19]. Moreover, the research on survivability mainly includes the definition of survivability, the model of survivability, and the method of survivability analysis. The definition of survivability varies according to the application environment [20,21,22,23,24,25]. The present survivability models are mainly the Markov model, Markov reward model, semi-Markov model, and stochastic graph model [21,24,25,26,27,28,29,30]. To further improve the communication link survivability when the network fails, some effective modeling methods are introduced in the literature [31,32,33,34,35]. In addition, survivability analysis mainly includes quantitative analysis, in which quantitative analysis is presented in a numerical form and the performance is more intuitive.
Most of the present researches on the improvement of the network performance method are mainly to evaluate the network operations from the point of view of a theoretical algorithm and simulation. To the best of our acknowledge, few studies focus on the research and applications of SDN- and MPTCP-based vehicle networks, especially for V2I network communications. Moreover, as one of the evaluation indexes of the network performance, survivability is less applied in the vehicle network, which refers to the ability of the network to still transmit tasks (or continuous service) after the failure and has a certain research value in certain kinds of vehicle networks. Therefore, it is necessary to study vehicle network survivability in the process of a random dynamic change of vehicle network topology and the failure of vehicle network links caused by various uncertain factors. With the above observations, our motivation is to analyze and evaluate the survivability in different vehicle network communication models and propose effective survivability models to provide the vehicle network survivability in abnormal situations. This paper proposes to use the probabilistic checking method to accurately analyze and evaluate the survivability of a SDN-based vehicle network from the point of view of network link failure (including software and hardware failure) and recovery. The contributions of this work can be summarized as follows:
Because the research on the survivability focuses on the direct communication between vehicle to vehicle (V2V) and V2I networks, a MPTCP mechanism for SDN-based vehicle network survivability model is proposed. In the action of the SDN central control and MPTCP, the link between each V2I can be switched seamlessly, leading to that results in the vehicle network still have some survivability under abnormal conditions (i.e., software or hardware is destroyed), and the survivability of the network is improved rapidly for a timely repairing mechanism.
Current survivability research methods normally adopt the mathematical theory derivation and simulation, which consume a lot of time and energy. Therefore, in this work, we propose time-based attributes by using the probability model detection. During analyses, by using probabilistic model detector PRISM [36,37,38], we can not only automatically search all the state space but also use continuous stochastic logic (CSL) to define the properties of the proposed model at various angles, verify the model, and obtain accurate numerical analysis results. The proposed method avoids the complicated mathematical derivation process and carries out the automatic mathematical accurate calculation to the complex survivability model. In the meanwhile, it has a simple and high efficiency characteristic and a certain reference value to the other network survivability research.
SDN-based vehicle networks currently focus more on reliability and security research but not for survivability. This paper proposes a survivability study for a SDN-based vehicle network. Since that survivability pays attention to the overall security performance of the network system, considering whether the system can "survive" under the accident of attack and hardware and software failure. Therefore, this paper comprehensively considers the software and hardware failure problems that may be encountered in the whole V2I network, injects emerging MPTCP protocol into the survivability comprehensive model, and analyzes the survival performance of the proposed model.
Due the use of single form Markov chain modeling for current survivability models, this paper considers two fault types that exist in a SDN-based vehicle network that lead to the failures of V2I link communications, these are, the vehicle node fault and the link fault. In what follows, the survivability model of these two fault types is established separately and the survivability models are considered. From the proposed survivability comprehensive model of the network, the analysis results show that the model satisfies the survivability property definitions.
The remainder of this paper is organized as follows. Section 2 describes the proposed SDN-based V2I vehicle network. Section 3 proposes the survivability definition of the V2I vehicle network. Section 4 provides a probabilistic model checking approach to analyze the survivability of the V2I network. Section 5 concludes this paper and provides possible future works.

2. SDN-Based V2I Network Communications

The SDN-based vehicle network architecture is shown in Figure 1, which is divided into three layers: the data layer, control layer, and application layer. For the data layer, there are three elements: the vehicle, infrastructure, and switching route. The switching between communication links in V2I networks is completed through switches and/or routers. For the control layer, the SDN controller serves as a network center management part, separating the network control and the network topology of the vehicle networks, where the original network architecture extricates from the hardware control, instead of a software programmable design to centralize the dynamic management of various network parts. By using the Open Flow protocol at the south interface, it can be connected to various switching or routing devices in the data layer. Particularly, its north interface connects each application service and coordinates and controls each application service program to carry on effectively. On the other hand, for the application service layer, it mainly includes applications of the vehicle network: the security application service of the vehicle network, web service, media service of watching or downloading video, mobile information service of querying the electronic map in real time, real-time communication service, and so on. Each of these applications is controlled by the SDN controller.
To analyze and study the survivability of SDN-based V2I vehicle networks, we establish a V2I network communication model based on the vehicle network architecture, which is shown in Figure 2. In this V2I network communication model, each vehicle equips three V2I communication links in three directions, namely the vehicle-to-RSU connection, vehicle-to-Wi-Fi connection, and vehicle-to-BS (such as LTE/4G/5G/6G) connection. In addition, the connection between the vehicle and RSU is carried out through the IEEE 802.11P protocol, which guarantees short-range communication between vehicle and vehicle. Moreover, vehicles and Wi-Fi IEEE802.11 standards are adopted to connect the vehicle network interface via the wireless access point (AP). For the MPTCP application, to improve the quality of network services, it is assumed that each vehicle involves multiple network interfaces. Each of them switches through MPTCP ports. The transfer between the TCP1, TCP2, and TCP3 interfaces in the MPTCP is controlled and switched by the Open Flow protocol in SDN central controller. In the Figure 2, due to the high speed movement of vehicles, there are some uncertain abnormal factors, such as the malicious vehicle intrusion or denial of service attack, channel fading, man-made accidents, natural disasters, and so on. All of these events can possibly lead to a breakdown for the V2I network and communication link. When one of the V2I links fails, MPTCP immediately responds by switching to one of the other two idle links to continue communication until the fault link is repaired in time. If either of the other two links fail, multiple repairs should be performed until the data is restored for transmission. For our proposed analysis and study of the survivability of V2I networks, we consider the fault state, fault type, and ability of the network to continue to complete the transmission task when the failure is repaired in time. The fault state includes three V2I link faults (vehicle and RSU, vehicle and base station, and vehicle and Wi-Fi) and the failure of the vehicle node. We consider that the fault types include link failures and node failures. In addition, in order to further study the ability of data transmission after the network failure, we also define the V2I network survivability according to the vehicle network communication model and then establish the survivability mode of the V2I network.

3. V2I Network Survivability Definition

According to the above analysis of the SDN-based V2I vehicle network communication models, the survivability of our proposed scheme can be defined as:
Definition: The SDN-based V2I vehicle network survivability model (VSNSM) contains a quaternion, i.e., VSNSM = {E, R, P, F}, where the definition details of each element can be summarized as follows:
E is the vehicle network communication application environment, the specific network communication structure is shown in Figure 2, which is based on SDN vehicle networks. The vehicle serves as a network node and communicates with each infrastructure. The inter-link switching between them controls the MPTCP through the SDN central control section.
R is the specific parameter setting in the vehicle network. There are two types of faults in the vehicle network, which are defined as internal and external failures. For these two faults, the internal fault refers to the failure of the vehicle node itself, and the external fault refers to the V2I link fault. We set the V2I link failure rate as λ1 and the vehicle node failure rate as λ2. Their corresponding repair rates are represented by µ1 and µ2, respectively. It is further assumed that the number of vehicles in the vehicle network is N, and the number of possible failures is n (nN). Since each vehicle has three corresponding V2I links, the maximum number of possible link failures is set to be 3N. The details of specific parameters are concluded in Table 1.
P denotes the series of probability distributions of parameters set in the R under certain attribute conditions, i.e., the time boundary conditions.
F represents the survivability model as finite state machines of a continuous time Markov chain (CTMC), which is a quaternion as M = {S, S0, L, T}. The parameters are described as follows:
  • S = {S0, S1, S2, …, Sn, …, SN} or S = {S0, S1, S2, …, Sn, …, S3N}, where N is a finite positive integer. Two different state sets correspond to the vehicle node fault and V2I link fault, respectively. The state transition is related to the parameters in R;
  • S0 stands for the initial state of a finite state machine;
  • L: S → 2AP represents the label function of atomic propositions (AP) which are true in S;
  • T: S × S 0 denotes state transfer matrix.

4. V2I Network Survivability Model

According to the V2I definition of vehicle network survivability in Section 3, we now establish the survivability model of the vehicle under the V2I link failure with the specific design shown in Figure 3. To simplify the state diagram, we set “S0, S1, S2...Sn...S3N” states in the diagram to represent the state “0, 1, 2, 3...n...3N” in the definition of survivability, respectively. The model is a CTMC with N vehicles on the road and their failure probability.
When any one of the V2I links fails, through the SDN control center and the MPTCP protocol, these three links of the vehicle node can be seamlessly switched to continue transmitting data. Moreover, we further define that there are 3N + 1 states in the survivability model of the whole vehicle network, in which the state “0” means no V2I link fault, “1” means that a V2I link fault occurs, and the subsequent digital state analogizes the corresponding V2I link fault number in turn, i.e., the maximum number of link failures in the whole network is 3N. At the same time, with the occurrence of a V2I link failure, in order to ensure the continuous operation of the V2I network, the network will respond to the corresponding timely repair function. According to the survival definition, the repair rate of a V2I link failure is set as µ1. The repair rate after two V2I link failures is 2µ1. Similarly, the repair rate after n V2I link failure is 1, and the repair rate after 3N V2I link failures is 31. In this model, the number of failures corresponding to different states is repaired to different degrees.
The transient probability of the survivability model is the probability at any t time. It reflects the short-term survivability of vehicle networks. It is expressed as Pi(t). When the initial time t = 0, we have the probability Pi(t) = Pi. According to the state transition, the following transient probability equations can be obtained from:
d P 0 ( t ) d t = μ 1 P 1 ( t ) - λ 1 P 0 ( t ) ,
d P n ( t ) d t = λ 1 P n 1 ( t ) + ( n + 1 ) μ 1 P n + 1 ( t ) - ( λ 1 + n μ 1 ) P n ( t ) ,   f o r   n = 1 ,   2 ,   ,   3 N 1 ,
d P 3 N ( t ) d t = λ 1 P 3 N 1 ( t ) 3 N μ 1 P 3 N ( t ) ,
where t→∞, and they will tend to steady state. However, the steady state probability Pn = Pn(t) is an important measure reflecting the quality of the network operation. Let the steady state probability be Pi in the i-th state, it can be obtained from:
λ 1 P 0 = μ 1 P 1 ,
( λ 1 + n μ 1 ) P n = λ 1 P n 1 + ( n + 1 ) μ 1 P n + 1 ,   f o r   n = 1 , 2 , , 3 N - 1 ,
λ 1 P 3 N 1 = 3 N μ 1 P 3 N
where n = 0 3 N P n = 1 , by calculating the above Equations (4)–(6), the steady state probability in the i state can be obtained as follows:
P i = ρ i i ! n = 0 3 N ρ n 1 n ! ,
where ρ = λ 1 μ 1 , if the expected number of failures in the time range from 0 to t is calculated as follows:
R f a i l u r e _ n u m b e r ( t ) = 0 t λ 1 P i ( x ) d x .
The above discussions are related to the survivability model of direct failure of the V2I link, however, in the actual process, the internal fault cause of the vehicle node itself may also indirectly lead to the V2I link failure. For this situation, we establish a V2I survivability model based on vehicle node failure, as shown in Figure 4. It involves n states, where n indicates that the vehicle has no failure number, and the total number of failures at the vehicle nodes is not greater than the total number of vehicles. According to the survivability definition in Section 3, we set the failure rate of each vehicle node as λ2, meanwhile, for n vehicles, the possible failure rate is nλ2. For n − 1 vehicles, the possible failure rate is (n − 1) λ2, and so on. The corresponding failure rate for each state until the “0” state is λ2. At the same time, the repair rate of timely recovery after the vehicle failure is μ2. Let the transient probability of any t time of the survivability model be Pi (t). Then, according to the state transition, the transient probability equations of each state can be expressed as:
d P n ( t ) d t = μ 2 P n ( t ) - n λ 2 P n 1 ( t ) ,
d P n - 1 ( t ) d t = n λ 2 P n 1 ( t ) + μ 2 P n 3 ( t ) - ( n λ 2 + μ 2 ) P n 2 ( t ) ,   f o r   n = N 1 ,   N 2 ,   ,   1 ,
d P 0 ( t ) d t = μ 2 P 0 ( t ) - 2 λ 2 P 1 ( t ) ,
Hence, when the time t tends to infinity, transient states tend to be stationary. The steady state probability is P n = l i m t P n ( t ) . Let the steady state probability be Pi in the i-th state, we have:
n λ 2 P n = μ 2 P n 1 ,
[ ( n - 2 ) λ 2 + μ 2 ] P n 2 = ( n 1 ) λ 2 P n 1 + μ 2 P n 3 , f o r   n = N 1 , N 2 , 1 ,
λ 2 P 1 = μ 2 P 0 ,
where n = 0 N P n = 1 . After calculating the above equations, the steady state probability of the survival model i state Pi can be obtained from:
P i = ( γ ) i i ! n = 0 N ( γ ) n 1 n ! , a n d   γ = μ 2 λ 2 ,
If there is k number of faults in the V2I network, for a period of time between 0 and t, the expected survivability rate can be calculated as follows:
P S u r ( k , t ) = i = k n 0 t P i ( x ) d x , n N
For practical applications, V2I vehicle networks sometimes have both internal and external faults, that is, a link failure between the vehicle and the infrastructure and a failure of the vehicle node itself. In view of this problem, we can combine these two survivability models to establish a more perfect comprehensive survivability model, as shown in Figure 5. In this model, we take into account the survivability of the above two fault situations when they occur alone but also the survivability for the case in which these two faults occur simultaneously. In Figure 5, the set state is represented by (n, j), and the parameter n indicates a failure-free number of vehicle nodes. At the same time, the parameter n is less than or equal to the maximum number N of vehicles. The parameter j represents the number of link failures for j ≤ 3N. An initial state is represented by (n, 0). The digital characters “n” and “0” in this state indicate that the vehicle node and V2I link are in normal condition (no failure), respectively. The state (n, j) to state (n, j + 1) indicates that the link fails, and the failure rate is λ1, correspondingly, the link repair rate is μ1 times the number of fault links; the state (n, j) to state (n − 1, j) indicates that there is a failure of a vehicle node, the failure rate is λ2 times the number of normal vehicles before the failure occurs, and its repair rate is set to μ2; the state (n, j) to state (n − 1, j − 1) indicates that the vehicle node fault and link fault occur simultaneously. The original link fault is repaired from the j fault number to j − 1 fault number. The normal number of vehicle nodes changes from the n original number to n − 1 vehicle failure nodes. In this process, one link is recovered and one of the vehicles fails. The failure rate is set to the node failure rate λ2, which is recovered by the repair rate μ2. According to the state transition relation of the model, we get the steady state and transient probability of the survivability of the model. Assuming that the steady state probability of the model is Psu, then the probability has the following relation with the probability of each state:
P s u = i = 0 , j = 0 n , 3 N P i , j ,
for the initial state (n − 1, j), the transient probability for t = 0 is Pn−1, j(0) = Pn−1,j. Hence, we have:
P n 1 , j = 3 N j n P n , j + j + 1 n P n , j + 1 ,
where j = 0 ,   1 ,   2 , n 3 N 1 , let the transient probability of the model in [0, t] time be Psu (t), then we can get:
P s u ( t ) = P n 1 , 3 N - 1 ( t ) + P n , 3 N ( t ) .
On the basis of the above survivability model, the following sections will focus on the probability model checking and validation of the survivability with PRISM. Moreover, according to the state transition and arrival situation, the relevant survival attribute formula is defined by CSL, and the survivability probability analysis and comparison are provided under various time boundary conditions.

5. Verification and Analysis of V2I Networks Survivability Model

5.1. V2I Networks Survivability Model Verification

In this subsection, we use probabilistic model checker PRISM 4.6 for the model checking and validation. During this process, the survivability model is first designed by the PRISM programming language through the probabilistic model detection platform, and then the model is validated. During the verification process, the model checking system will automatically search all the state space and also automatically carry out state statistics, state transfer statistics, node statistics in the MTBDD, terminal node statistics, model establishment time calculation, iterative algebraic calculation in the source state reaching the target state and its iterative time calculation, and so forth. The validation of the survivability model is shown in Table 2. All the results are obtained for the given parameters as λ1 = 0.1, λ2 = 0.1, μ1 = 0.1, μ2 = 0.1, and T = 50, respectively. In Table 2, as the N of the maximum number of vehicles increases, the number of model states and state transitions will correspondingly increase. Meanwhile, the number of nodes in the Multi-Terminal Binary Decision Diagram (MTBDD) [38] and the number of terminal nodes also increase accordingly. The time of model building, number of iterations, and iteration time increase with the increased states. The model checking results verify the correctness of our proposed survivability model.

5.2. Analysis of Maximum Survival Probability of V2I Networks

To further analyze the survivability model, we define the relevant CSL [39,40] property formulas through the property syntax and semantic rules of the probabilistic model checker to study the survivability model from multiple angles.
In PRISM, the probability calculation in the definition CSL probability property formula is carried out by the operation P, which has the following form:
P = ? [ p a t h p r o p ] ,
where “P” represents the probabilistic results, the symbol “?” denotes the probability calculation, and “pathprop” indicates the path property. By this way, the maximum survival probability of the V2I network is analyzed on the basis of the time boundary. The property formula is defined by CSL as follows:
P s u r _ max = ? [ t r u e U < = T ( n = N ) & ( j = 3 * N ) { ( n < N ) & ( j < 3 * N ) } { max } ] .
The formula indicates the maximum survival probability of the V2I network within the time boundary T = 20, when the state (n, j) reaches the target state from the initial state. From Equation (20), we can analyze the survivability of the V2I network from the angle of the influence of different parameters in the survivability model. To distinguish the survival probability under each condition, the experimental simulation is represented by Psur_max1, Psur_max2, Psur_max3 and Psur_max4, respectively.
In Figure 6, we discuss the variation of the survival probability of V2I network with time. To facilitate analysis, the number N of vehicles in the diagram is 10, the V2I link failure rate λ1 and vehicle node failure rate λ2 are both considered as a fixed value. It is observed that the survival probability Psur_max1 of the V2I network also increases as the corresponding repair rate μ1 and μ2 increase from 0.1 to 0.9, respectively. When both repair rates are small (e.g., μ1 and μ2 are 0.1, 0.2), the survival probability Psur_max1 of the V2I network is low. The survival probability Psur_max1 does not greatly change in 5 s, and basically remained at the stable value, and after the repair rate of both increased to 0.5, the survival probability Psur_max1 with the change of time also increased rapidly. After a certain period of time, the survival probability Psur_max1 of the V2I network achieves maximum value 1. The results show that the reachability of each state in the survivability model satisfies the requirements of defining properties and achieves the maximum survival probability.
In what following, we discuss the survival probability Psur_max2 of the V2I vehicle network with the number of vehicle failures. Since the number of failures that exist in different vehicle nodes is considered, the failure of the vehicle node will indirectly lead to an interruption from the corresponding V2I network communication link of vehicles. Therefore, we analyze the survival probability Psur_max2 of V2I network under different vehicle failure numbers n, the specific situations are shown in Figure 7. We set λ1 = λ2 = 0.1, the number of vehicles is N = 50, and the number of vehicle failures nN. The survival probability Psur_max2 of the V2I network under different vehicle node repair rate µ2 is compared in the Figure 7. The results show that the survivability probability Psur_max2 of V2I network decreases with the increase of failures. In addition, with an increased vehicle node repair rate µ2 from 0.1 to 0.9, the V2I network survivability probability Psur_max2 also increases. The validation results meet the property definition requirements.
For the survivability model of the SDN-based V2I vehicle network, we consider the occurrence of various anomalies leading to network link failure. Thus, the V2I link failure rate λ1 and vehicle node failure rate λ2 are introduced into this model. All of these factors will directly and indirectly affect the connectivity of the vehicle network communication links. Hence, the change of λ1 or λ2 has a certain influence on the survival probability of the V2I networks. We discuss the survival probability of the V2I network in detail for different values of the parameter λ1, as shown in Figure 8. The number N of vehicles is set at 10, and λ2 remains 0.1. It is observed from Figure 8, with an increased repair rate μ1 and μ2, that the V2I link failure rate λ1 increases, especially when the repair rate of the two situations is greater than 0.4, the corresponding single curve (such as pink) shows a slight decreasing trend. The overall survival probability Psur_max3 of the V2I network increases with the increased repair rate μ1 and μ2, due to the effect of MPTCP, where the repair rate μ1 dominates the repair degree of each link. Moreover, it is also shown that with an increased μ1, each V2I link still switches to each other to transfer information according to the link idle situation. Therefore, one can see that the V2I network can maintain a certain survival ability and continue to provide services for the transmission task.
Finally, due to the failure of the vehicle node affecting the survivability of the V2I network, we discuss the V2I of the network survival probability Psur_max4 under the change of the failure rate λ2 with the vehicle node, as shown in Figure 9. Failures of vehicle nodes will lead to interruptions of V2I network communication links. The single curve shown in Figure 9 shows that the survival probability Psur_max4 of the V2I network decreases with an increased failure rate λ2 of the vehicle node. However, the overall survival probability of the V2I network increases with the increased repair rate μ2. Moreover, in Figure 9, one can see that the entire V2I network has a certain survivability even at a minimum repair rate of 0.1. Although the survival probability Psur_max4 is relatively low, the network still has a certain survivability. Therefore, the MPTCP technology for vehicle network nodes in the SDN-based V2I network has advantages in maintaining network survival performance.

5.3. Instantaneous Evaluation Analysis of the V2I Network Survivability

The V2I network survivability model is a CTMC, which has an expected reward at some instantaneous time. It is usually called an instantaneous expected value. The CSL property is defined as follows:
R = ? [ I = T ] .
This expression represents the expected value of the V2I network at T instantaneous time. We first discuss the instantaneous expected value of the number of link repairs in V2I the network at different repair rates when the failure rate and number of vehicle failures are constant. The specific CSL formula is expressed as:
R { E x p e c t e d   r e p a i r _ n u m b e r } = ? [ I = T ] .
We set the number of link failures to be 10, λ1 and λ2 are set to be 0.1, the instantaneous time T is 20 s. Specific analytical values are shown in Figure 10. It shows that the instantaneous expected value of the V2I link repair increases with the increased repair rate μ1 and μ2. When μ1 = 0.8 and μ2 = 0.9, the expected value of repair numbers can reach the maximum value 30. The results show that each state achieves the target state to satisfy the requirements of the defined properties and the instantaneous expected reward. The V2I network can achieve maximum survivability by the instantaneous expected evaluation.
Furthermore, by means of the instantaneous property formula, we also analyze the expected number of link failures in V2I the network under different failure rates. The specific CSL formula is expressed as:
R { E x p e c t e d   f a i l u r e _ n u m b e r } = ? [ I = T ] .
Time T is also set as 20 s, the repair rate μ1 and μ2 as 0.2, and the number of vehicles as 10. The specific values are shown in Figure 11. It shows that, as the V2I link failure rate λ1 and the vehicle node failure rate λ2 gradually increase, the number of instantaneous failures in the V2I network becomes greater, and the expected value also increases. Thus, the instantaneous expected evaluation of network survivability is reduced.

5.4. Instantaneous Evaluation Analysis of the V2I Network Survivability

The CTMC state model will obtain the cumulative expected reward after a period of time, which is the expected reward based on the time boundary, as defined below:
R = ? [ C T ] ,
where the formula represents the expected reward of V2I network over T time, and its expected value is calculated using time T as the boundary for cumulative rewards. Similar to the instantaneous expected value analysis, we first analyze the expected reward of the number of link repairs in the V2I network at different repair rates, when the failure rate and number of vehicle failures remain are fixed. The specific CSL formula is expressed as:
R { E x p e c t e d   r e w a r d   o f   r e p a i r _ n u m } = ? [ C T ] .
The specific numerical results are shown in Figure 12. The number of link failures are set at n = 10, the λ1 and λ2 are set to be 0.1, instantaneous time T is 20 s. The figure shows that the expected link repair number of V2I network is improved with the increased repair rate µ1 and µ2 in the T time boundary. This indicates that the number of V2I links available in the network increases. As a result of MPTCP, each vehicle seamlessly switches between its effective links, and the V2I network service quality is improved, so that the V2I network survival ability is enhanced, and the survivability is improved.
Finally, we discuss the expected number of link failures in the V2I network under different failure rates λ1 and λ2 within the T time boundary. The specific CSL formula is expressed as:
R { E x p e c t e d   r e w a r d   o f   l i n k _ f a i l u r e _ n u m } = ? [ C T ] .
In order to match the number of failures with the instantaneous expectation, the time boundary T is also set to 20 s, the repair rate μ1 and μ2 is set to 0.2, and the number of vehicles is set to 10. Specific values are shown in Figure 13. It is easy to see that, under the time boundary T, the expected reward of the failure numbers are calculated continuously on the basis of each instantaneous value until the set time boundary. The expected number of failures in V2I network increases with the increased failure rates λ1 and λ2. This indicates that the V2I network service quality is degraded, which leads to a downward trend in the expected evaluation of the network survivability of the V2I network.

6. Conclusions

This paper proposed a probabilistic model-checking method to quantitatively analyze the survivability for the SDN-based V2I network. We investigated the SDN-based vehicle network communication architecture and established the SDN-based V2I vehicle network communication model, in which the vehicle node fault and link fault type were considered. On the basis of the proposed communication model, we provided the survivability definition of SDN-based V2I vehicle networks. Combined with MPTCP protocol, we proposed a Markov chain-based survivability model of the SDN-based V2I network. Moreover, a probabilistic model-checking method was investigated to validate the V2I network survivability model. In particular, we analyzed the probability and expected reward under various conditions from the point of view of time. The analysis results showed that, under the action of MPTCP, multiple V2I failures occur, the QoS of the network decreases, but the network still has a certain survival ability. Moreover, for a higher fault repair rate, the service capacity of the network will be improved quickly, and the survivability will be further improved. In summary, the results showed that our proposed survivability enhancement method and analysis method of probabilistic model checking are effective for SDN-based V2I vehicle networks. Additionally, the proposed survivability model was limited to a certain application environment and did not realize a general survivability model. In our future research work, we will evaluate and compare the survivability of other vehicle networks’ models and summarize a suitable general model for the vehicle network survivability. Specifically, we will explore more effective strategies to improve the survivability of vehicle networks and study the survivability of vehicle networks for 5G and 6G combined with the artificial intelligence approach.

Author Contributions

L.J. and G.Z. conceived and designed the study. H.Z. and W.D. performed the simulations. L.J. wrote the paper. L.J., G.Z., H.Z. and W.D. reviewed and edited the manuscript. All authors read and approved the manuscript.

Funding

This work is supported by the National Natural Science Foundation of China (No. 61971245 and 61801249).

Acknowledgments

The authors would like to thank the anonymous reviewers for their useful comments and careful reading of the manuscript.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

  1. Befekadu, G.K.; Gupta, V.; Antsaklis, P.J. Risk-sensitive control under Markov modulated denial-of-service (DoS) attack strategies. IEEE Trans. Autom. Control 2015, 60, 3299–3304. [Google Scholar] [CrossRef]
  2. Li, H.; Dong, M.; Ota, K. Control plane optimization in software-defined vehicular ad hoc networks. IEEE Trans. Veh. Technol. 2016, 65, 7895–7904. [Google Scholar] [CrossRef] [Green Version]
  3. Correia, S.; Boukerche, A.; Meneguette, R.I. An architecture for hierarchical software-defined vehicular networks. IEEE Commun. Mag. 2017, 55, 80–86. [Google Scholar] [CrossRef]
  4. Mena, J.; Bankole, P.; Gerla, M. Multipath TCP on a VANET: A performance study. In Proceedings of the 2017 ACM SIGMETRICS/International Conference on Measurement and Modeling of Computer Systems, Urbana-Champaign, IL, USA, 5–7 June 2017; pp. 39–40. [Google Scholar]
  5. Changsung, L.; Sooeun, S.; Hyougjun, C. Optimal multipath TCP offloading over 5G NR and LTE Networks. IEEE Wirel. Commun. Lett. 2019, 8, 293–296. [Google Scholar]
  6. Zhou, D.; Song, W.; Wang, P.; Zhuang, W. Multipath TCP for user cooperation in LTE networks. IEEE Netw. 2015, 29, 18–24. [Google Scholar] [CrossRef]
  7. Singh, P.K.; Sharma, S.; Nandi, S.K.; Nandi, S. Muti-path TCP for V2I communication in SDN controlled small cell deployment of smart city. Veh. Commun. 2019, 15, 1–15. [Google Scholar]
  8. Pokhrel, S.R.; Choi, J. Low-delay scheduling for internet of vehicles: Load-balanced multipath communication with FEC. IEEE Trans. Commun. 2019, 67, 8489–8501. [Google Scholar] [CrossRef]
  9. Zhao, G.S.; Wang, H.Q.; Wang, J. Quantitative analysis model for information system survivability. Comput. Eng. 2008, 34, 41–43. [Google Scholar]
  10. Maier, G.; Pattavina, A.; Patre, S.D. Optical network survivability: Protection techniques in the WDM layer. Photonic Netw. Commun. 2002, 4, 251–269. [Google Scholar] [CrossRef]
  11. Lee, K.; Modiano, E.; Lee, H.W. Cross-layer survivability in WDM-based networks. IEEE/ACM Trans. Netw. 2011, 19, 1000–1013. [Google Scholar] [CrossRef]
  12. Kawamura, R. Architectures for ATM network survivability. IEEE Commun. Surv. Tutor. 1998, 1, 2–11. [Google Scholar] [CrossRef]
  13. Cetinkaya, E.K.; Broyles, D.; Dandekar, A.; Sterbenz, J.P.G. Modelling communication network challenges for future internet resilience, survivability, and disruption tolerance: A simulation-based approach. Telecommun. Syst. 2013, 52, 751–766. [Google Scholar] [CrossRef]
  14. Yang, Z.C.; Qiu, H.P.; Lei, Z.P.; Yan, J. Survivability studies for military communication network. J. Mil. Commun. Tech. 2014, 35, 31–36. [Google Scholar]
  15. Dai, C.Q.; Li, J. Optimization design of double layer hybrid satellite network and coverage performance evaluation. Appl. Electr. Technol. 2017, 43, 23–27. [Google Scholar]
  16. Chen, I.R.; Speer, A.P.; Eltoweissy, M. Adaptive fault-tolerant QoS control algorithms for maximizing system lifetime of query-based wireless sensor networks. IEEE Trans. Dependable Secur. Comput. 2011, 8, 161–176. [Google Scholar] [CrossRef]
  17. Bari, A.; Jaekel, A.; Jiang, J.; Xu, Y.F. Design of fault tolerant wireless sensor networks satisfying survivability and lifetime requirements. Comput. Commun. 2012, 35, 320–333. [Google Scholar] [CrossRef]
  18. Bahi, J.M.; Guyeux, C.; Hakem, M.; Makhoul, A. Epidemiological approach for data survivability in unattended wireless sensor networks. J. Netw. Comput. Appl. 2014, 46, 374–383. [Google Scholar] [CrossRef] [Green Version]
  19. Bhunia, S.; Behzadan, V.; Regis, P.A.; Sengupta, S. Adaptive beam nulling in multihop ad hoc networks against a jammer in motion. Comput. Netw. 2016, 109, 50–66. [Google Scholar] [CrossRef]
  20. Ellison, R.J.; Linger, R.C.; Longstaff, T.; Mead, N.R. Survivable network system analysis: A case study. IEEE Softw. 1999, 16, 70–77. [Google Scholar] [CrossRef]
  21. **e, L.; Heegaard, P.E.; Jiang, Y. Survivability analysis of a two-tier infrastructure-based wireless network. Comput. Netw. 2017, 128, 28–40. [Google Scholar] [CrossRef] [Green Version]
  22. Al-Kuwaiti, M.; Kyriakopoulos, N.; Hussein, S. A comparative analysis of network dependability, fault-tolerance, reliability, security, and survivability. IEEE Commun. Surv. Tutor. 2009, 11, 106–124. [Google Scholar] [CrossRef]
  23. Trivedi, K.S.; **a, R. Quantification of system survivability. Telecommun. Syst. 2015, 60, 451–470. [Google Scholar] [CrossRef]
  24. Dharmaraja, S.; Vinayak, R.; Trivedi, K.S. Reliability and survivability of vehicular ad hoc networks: An analytical approach. Reliab. Eng. Syst. Saf. 2016, 153, 28–38. [Google Scholar] [CrossRef]
  25. Sterbenz, J.P.G.; Hutchison, D.; Cetinkaya, E.K.; Jabbar, A.; Rohrer, J.P.; Scholler, M.; Smith, Paul. Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines. Comput. Netw. 2010, 54, 1245–1265. [Google Scholar] [CrossRef]
  26. Tian, J.; Yan, T.; Wang, G. A network coding based energy efficient data backup in survivability-heterogeneous sensor networks. IEEE Trans. Mob. Comput. 2015, 14, 1992–2006. [Google Scholar] [CrossRef]
  27. Das, B.; Almhana, J. A new cooperative communication algorithm for improving connectivity in the event of network failure in VANETs. Comput. Netw. 2017, 128, 51–62. [Google Scholar] [CrossRef]
  28. Yi, Z.; Dohi, T. Toward highly dependable power-aware mobile ad hoc network–survivability evaluation framework. IEEE Access 2015, 3, 2665–2676. [Google Scholar] [CrossRef]
  29. Cao, R. Detecting arbitrary attacks using continuous secured side information in wireless networks. IEEE Access 2017, 5, 25927–25945. [Google Scholar] [CrossRef]
  30. Liang, Q.; Modiano, E. Survivability in time-varying networks. IEEE Trans. Mob. Comput. 2017, 16, 2668–2681. [Google Scholar] [CrossRef]
  31. Hwang, I.; Kim, S.; Kim, Y.; Seah, C.E. A survey of fault detection, isolation, and reconfiguration methods. IEEE Trans. Control Syst. Technol. 2010, 18, 636–653. [Google Scholar] [CrossRef]
  32. Zheng, J.; Okamura, H.; Li, L.; Dohi, T. A comprehensive evaluation of software rejuvenation policies for transaction systems with Markovian arrivals. IEEE Trans. Reliab. 2017, 66, 1157–1177. [Google Scholar] [CrossRef]
  33. Zhao, H.T.; Sun, S.Y.; **, B. Sequential fault diagnosis based on LSTM neural network. IEEE Access 2018, 6, 12929–12939. [Google Scholar] [CrossRef]
  34. Tian, Y.L.; Tian, J.; Li, N. Cloud reliability and efficiency improvement via failure risk based proactive actions. J. Syst. Softw. 2020, 163, 110524. [Google Scholar] [CrossRef]
  35. Wu, Y. Existence and construction of capacity-achieving network codes for distributed storage. J. Sel. Areas Commun. 2010, 28, 277–288. [Google Scholar] [CrossRef]
  36. Bianco, A.; Alfaro, L.D. Model checking of probabilistic and nondeterministic systems. Lect. Notes Comput. Sci. 2005, 1026, 499–513. [Google Scholar]
  37. Wang, M.; Wang, R.; Li, X.J.; Guan, Y.; Zhang, J.; Wei, H.X. Probabilistic model checking for real-time obstacle avoidance of mobile robot in a non-deterministic environment. J. Chin. Comput. Syst. 2014, 35, 2104–2109. [Google Scholar]
  38. Kwiatkowska, M.Z.; Norman, G.; Parker, D. Quantitative analysis with the probabilistic model checker PRISM. Electron. Notes Theor. Comput. Sci. 2006, 153, 5–31. [Google Scholar] [CrossRef] [Green Version]
  39. Donatelli, S.; Haddad, S.; Sproston, J. Model checking timed and stochastic properties with CSL^{TA}. IEEE Trans. Softw. Eng. 2009, 35, 224–240. [Google Scholar] [CrossRef]
  40. Gao, Y.; Xu, M.; Zhan, N.; Zhang, L. Model checking conditional CSL for continuous-time Markov chains. Inf. Process. Lett. 2013, 113, 44–50. [Google Scholar] [CrossRef] [Green Version]
Figure 1. SDN-based vehicle network architecture.
Figure 1. SDN-based vehicle network architecture.
Sensors 20 04678 g001
Figure 2. SDN-based V2I network communication model.
Figure 2. SDN-based V2I network communication model.
Sensors 20 04678 g002
Figure 3. The survivability model of the V2I link failure.
Figure 3. The survivability model of the V2I link failure.
Sensors 20 04678 g003
Figure 4. The V2I link survivability model under vehicle node failure.
Figure 4. The V2I link survivability model under vehicle node failure.
Sensors 20 04678 g004
Figure 5. The survivability model of SDN-based V2I networks.
Figure 5. The survivability model of SDN-based V2I networks.
Sensors 20 04678 g005
Figure 6. The maximum probability of V2I network survivability with respect to the time (corresponding to μ1 and μ2).
Figure 6. The maximum probability of V2I network survivability with respect to the time (corresponding to μ1 and μ2).
Sensors 20 04678 g006
Figure 7. The maximum survival probability of the V2I network with vehicle failure number n (corresponding to μ2).
Figure 7. The maximum survival probability of the V2I network with vehicle failure number n (corresponding to μ2).
Sensors 20 04678 g007
Figure 8. The maximum survival probability of the V2I network with link failure rate λ1 (corresponding to μ1 and μ2).
Figure 8. The maximum survival probability of the V2I network with link failure rate λ1 (corresponding to μ1 and μ2).
Sensors 20 04678 g008
Figure 9. The maximum survival probability of the the V2I network with link failure rate λ2 (corresponding to μ1 and μ2).
Figure 9. The maximum survival probability of the the V2I network with link failure rate λ2 (corresponding to μ1 and μ2).
Sensors 20 04678 g009
Figure 10. The instantaneous expected repair number of the the V2I network with time (corresponding to μ1 and μ2).
Figure 10. The instantaneous expected repair number of the the V2I network with time (corresponding to μ1 and μ2).
Sensors 20 04678 g010
Figure 11. The instantaneous expected failure number of the the V2I network with time (corresponding to μ1 and μ2).
Figure 11. The instantaneous expected failure number of the the V2I network with time (corresponding to μ1 and μ2).
Sensors 20 04678 g011
Figure 12. The expected repair number reward of the the V2I network with time (corresponding to μ1 and μ2).
Figure 12. The expected repair number reward of the the V2I network with time (corresponding to μ1 and μ2).
Sensors 20 04678 g012
Figure 13. The expected reward of the link failure number in the V2I network with time (corresponding to λ1 and λ2).
Figure 13. The expected reward of the link failure number in the V2I network with time (corresponding to λ1 and λ2).
Sensors 20 04678 g013
Table 1. Parameter description.
Table 1. Parameter description.
ParameterDetailed Description
nfailure number
Nvehicle number
λ1V2I link failure rate
λ2Vehicle failure rate
µ1V2I link repair rate
µ2vehicle repair rate
Table 2. Probability model test results of the survivability model.
Table 2. Probability model test results of the survivability model.
Vehicle Number NModelMTBDDConstruction Time(s)Reachability
StatesTransitionsNodesLeavesIter. (s)Time Per Iter. (s)
103411451456310.017410.000024
50770137,25128771510.042010.000104
10030,401149,50159683010.1164010.000162
200120,801599,00112,4346010.4548010.000306
300271,2011,348,50119,1889010.89912010.000428
400481,6012,398,00125,95012011.66916010.000565
500752,0013,747,50134,38415012.47920010.000692
6001,082,4015,397,00140,05418013.54924010.000857
7001,472,8017,346,50151,61621015.17228010.001035
8001,923,2019,596,00154,16624016.60832010.001260
9002,433,60112,145,50166,320270110.30336010.001453
10003,004,00114,995,00171,650300111.73540010.001441

Share and Cite

MDPI and ACS Style

**, L.; Zhang, G.; Zhu, H.; Duan, W. SDN-Based Survivability Analysis for V2I Communications. Sensors 2020, 20, 4678. https://doi.org/10.3390/s20174678

AMA Style

** L, Zhang G, Zhu H, Duan W. SDN-Based Survivability Analysis for V2I Communications. Sensors. 2020; 20(17):4678. https://doi.org/10.3390/s20174678

Chicago/Turabian Style

**, Li, Guoan Zhang, Hao Zhu, and Wei Duan. 2020. "SDN-Based Survivability Analysis for V2I Communications" Sensors 20, no. 17: 4678. https://doi.org/10.3390/s20174678

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

Article Metrics

Back to TopTop