Return
Incentive-Driven Honeypot Defense: A Multi-Agent DRL Framework for Securing Smart Grid Networks
A
E
M
S
M
DOI:10.1109/tnsm.2026.3715400.png)
Abstract
En 中文
Honeypot defenses present a robust solution for securing the Advanced Metering Infrastructure (AMI) against sophisticated cyberattacks. The efficacy of AMI defenses relies on the strategic deployment of honeypots by Small-scale Power Suppliers (SPSs) and the subsequent exchange of defense data with Traditional Power Retailers (TPRs). However, existing methods are limited by their requirement for prior information exchange and their inability to specify targeted services (i.e., protocols), making them impractical for dynamic environments. In addition, previous approaches have predominantly overlooked critical aspects such as service allocation and competition among SPSs. To address these challenges, we propose a novel Deep Reinforcement Learning (DRL)-based Stackelberg leader-follower game framework that facilitates tailored service allocation and fosters competition among SPSs. We leverage the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm, which combines centralized training and distributed execution, to enable each SPS to autonomously learn optimal strategies that consider defense data quality and attack rates, without requiring prior knowledge of deployment costs or the actions of other SPSs. This adaptability minimizes the overhead associated with information exchange and improves the defense of vulnerable services. In particular, our method operates by requiring data collection, as each SPS functions as an independent learning agent that generates its own training experiences. Extensive simulations demonstrate that our proposed DRL-driven approach significantly outperforms baseline methods in different performance metrics. It achieves higher utility for both SPSs and TPR while maintaining lower operational costs.
Keywords:
Smart grid security
honeypots
attack rates
defense data
Stackelberg game
deep reinforcement learning
Journal
IF:
5.4
Papers:
509
Citations:
9.2K
