<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>This paper analyzes and researches the network attack in the electric power information environment. The intrusion attack steps are examined, and the Bayesian inference method is applied to investigate the attack source information network delivery. The success probability of the network attack is quantified by likelihood. Noisy Net, Dueling DQN, Soft Q-learning, Prioritized Experience Playback Mechanism, and ICM model are integrated to improve the DQN algorithm from different perspectives. A NDSPI-DQN algorithm is proposed based on Bayesian inference. The experimental results show that comparing the convergence performance of DQN, PPO, and this paper’s algorithm, both this paper’s algorithm and the PPO algorithm can converge to the maximum cumulative reward value within 1000 rounds, and this paper’s algorithm can converge to the optimal value within 350 rounds. In an environment with 120 hosts, the optimal path discovery success rate of this paper’s algorithm is 97.23%. The optimal number of iterations and average running time are 1.12 times and 3.81 seconds. The proposed method is suitable for large-scale power information networks with higher execution efficiency.</p>
</abstract>

This paper analyzes and researches the network attack in the electric power information environment. The intrusion attack steps are examined, and the Bayesian inference method is applied to investigate the attack source information network delivery. The success probability of the network attack is quantified by likelihood. Noisy Net, Dueling DQN, Soft Q-learning, Prioritized Experience Playback Mechanism, and ICM model are integrated to improve the DQN algorithm from different perspectives. A NDSPI-DQN algorithm is proposed based on Bayesian inference. The experimental results show that comparing the convergence performance of DQN, PPO, and this paper’s algorithm, both this paper’s algorithm and the PPO algorithm can converge to the maximum cumulative reward value within 1000 rounds, and this paper’s algorithm can converge to the optimal value within 350 rounds. In an environment with 120 hosts, the optimal path discovery success rate of this paper’s algorithm is 97.23%. The optimal number of iterations and average running time are 1.12 times and 3.81 seconds. The proposed method is suitable for large-scale power information networks with higher execution efficiency.

Research on Attack Path Discovery of Power Information Network Based on Bayesian Inference

Applied Mathematics and Nonlinear Sciences

This work is licensed under the Creative Commons Attribution 4.0 International License.

This paper analyzes and researches the network attack in the electric power information environment. The intrusion attack steps are examined, and the Bayesian...

Research on Attack Path Discovery of Power Information Network Based on Bayesian Inference

Pubblicato online: 15 mag 2024

Pagine: -

Ricevuto: 01 feb 2024

Accettato: 13 apr 2024

DOI: https://doi.org/10.2478/amns-2024-1077

Parole chiave
Bayesian inference, DQN algorithm, ICM model, NDSPI-DQN, Network attack paths

© 2024 Yuan Li et al., published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Research on Attack Path Discovery of Power Information Network Based on Bayesian Inference

Pubblicato online: 15 mag 2024

Pagine: -

Ricevuto: 01 feb 2024

Accettato: 13 apr 2024

DOI: https://doi.org/10.2478/amns-2024-1077

Parole chiaveBayesian inference, DQN algorithm, ICM model, NDSPI-DQN, Network attack paths

© 2024 Yuan Li et al., published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Parole chiave
Bayesian inference, DQN algorithm, ICM model, NDSPI-DQN, Network attack paths