The train Ethernet Consist Network (ECN) undertakes the task of transmitting critical train control instructions. With the increasing interactions between the train network and the outside environment, masses of network intrusions are threatening the data security of railway vehicles. The intrusion detection system has been proved to be an efficient method to detect network attacks. In this paper, a novel ensemble intrusion detection method is proposed to defense network attacks against the train ECN, in particular IP Scan, Port Scan, Denial of Service (DoS) and Man in the Middle (MITM). Thirty-four features of different protocol contents are extracted from the raw data generated from our ECN testbed to form a specific dataset. A data imaging method and a temporal sequence building method are designed to optimize the dataset. Six base classifiers are built based on several typical convolutional neural networks and recurrent neural networks: LeNet-5, AlexNet, VGGNet, SimpleRNN, LSTM and GRU. A dynamic weight matrix voting method is proposed to integrate all the base classifiers. The proposed method is evaluated based on our dataset. The experiment results show that our method has an outstanding ability to aggregate advantages of all the base classifiers and achieves a superior detection performance with the accuracy of 0.975.
Train network control management system (TCMS) is an important part of the High-speed rail train. Because of the TCMS’s complex and redundant structure, long-term operation environment, etc., breakdowns inevitably in the long-time running. Based on the historical fault data of the TCMS accumulated during their online service, the working principles, failure modes, and effects analysis of TCMS are researched and the dynamic fault tree (DFT) model of TCMS failure is built. Then, the dynamic fault tree model is transformed into the Bayesian network (BN) model, which can model the reliability of such types of systems. Finally, combining DFT with BN is used for fault probability estimation and reliability assessment. The results present that increasing the reliability of key modules for the TCMS would be of great help to High-speed rail train engineers in the fault diagnosis field.
21 April 2021 in Signal, Image and Video Processing
This paper addresses the scheduling problem of periodic information in multifunction-vehicle-bus networked control system (MNCS). To deal with this issue, a novel fuzzy immune particle swarm optimization (FIPSO) algorithm is proposed to eliminate the premature convergence of standard PSO algorithms in solving complex problem, which uses the fuzzy particle swarm optimization (FPSO) algorithm and the immune particle swarm optimization (IPSO) algorithm for reference. Through designing the fuzzy logic controller (FLC), the inertia weight and the immune-execute factor are regulated dynamically on the basis of the evolutionary time, the variation of average fitness value and the population diversity. The FLC also guides evolutionary directions and decides whether to execute immune operations, making the algorithm converge for many times. The simulation and calculation results of the scheduling example show that FIPSO algorithm has strong global search ability, good stability and better optimization performance. Particularly, based on the variable individual periods, the co-design of scheduling and control in MNCS is implemented by applying the FIPSO algorithm.
In time-triggered ethernet (TTEthernet), designing and optimizing the static scheduling of TT messages to improve the real-time performance of the whole network control system is important. When there is a high load on TTEthernet network communication, the conventional static scheduling policy introduces certain problems, such as increased packet loss rate, load imbalance, and transmission delay. Meanwhile, basic artificial intelligence algorithms generally features convergence within only a few steps, leading to higher probability to fall into a local optimal solution. To realize these targets, Fuzzy particle swarm optimization (FPSO) based on population diversity is established. By combining Particle swarm optimization (PSO) with a fuzzy algorithm, setting the adjustment of the inertia weight and the regulation of the mutation factor as the controlled variables of the Fuzzy logic controller (FLC), and adjusting the FLC inference rules, a novel static schedule generation for TTEthernet is proposed. Simulation results prove that, compared to the conventional rate-monotonic scheduling algorithm and the PSO algorithm, FPSO has a strong global search capability when the communication of the TTEthernet system is in a high-load state. FPSO improves the load balancing of the network and reduces the transmission delay of TT message packets. FPSO shows excellent ability to optimize scheduling tables and guarantee the real-time performance of the TTEthernet system.
The time-triggered communication paradigm is a cost-efficient way to meet the real-time requirements of cyber-physical systems. It is a non-deterministic polynomial NP-complete problem for multi-hop networks and non-strictly periodic traffic. A two-level scheduling approach is proposed to simplify the complexity during optimization. In the first level, a fuzzy-controlled quantum-behaved particle swarm optimization (FQPSO) algorithm is proposed to optimize the scheduling performance by assigning time-triggered frame instances to the basic periods of each link. In order to prevent population from high aggregation, a random mutation mechanism is used to disturb particles at the aggregation point and enhance the diversity at later stages. Fuzzy logic is introduced and well designed to realize a dynamic adaptive adjustment of the contraction–expansion coefficient and mutation rate in FQPSO. In the second level, we use an improved Satisfiability Modulo Theories (SMT) scheduling algorithm to solve the collision-free and temporal constraints. A schedulability ranking method is proposed to accelerate the computation of the SMT-based incremental scheduler. Our approach can co-optimize the jitter and load balance of communication for an off-line schedule. The experiments show that the proposed approach can improve the performance of the scheduling table, reduce the optimization time, and reserve space for incremental messages.