Reinforcement Learning-Based Secure Communications Over MIMO Interference Channels

This paper proposes a reinforcement learning-based precoding scheme with artificial noise to enhance secure communication in multi-input multi-output (MIMO) interference channel networks. The system consists of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$K$</tex-math></inline-formula> transmitter-receiver pairs communicating while exposed to a multi-antenna eavesdropper under channel uncertainty. To address the secrecy rate maximization problem, which involves highly non-convex optimization due to power constraints and coupled variables, the problem is formulated as a Markov decision process (MDP) and solved using the deep deterministic policy gradient (DDPG) algorithm. Numerical results show that the proposed approach achieves comparable secrecy performance to the latest asynchronous distributed pricing-based scheme while significantly reducing the computational complexity.

Institutions

Publication Details

Journal
IEEE Transactions on Vehicular Technology
Published
2025-09-12
DOI
https://doi.org/10.1109/tvt.2025.3608774
Primary Topic
Geochemistry and Geologic Mapping
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reinforcement Learning-Based Secure Communications Over MIMO Interference Channels

IEEE Transactions on Vehicular Technology
Geochemistry and Geologic Mapping
article

Reinforcement Learning-Based Secure Communications Over MIMO Interference Channels

article en

Abstract

This paper proposes a reinforcement learning-based precoding scheme with artificial noise to enhance secure communication in multi-input multi-output (MIMO) interference channel networks. The system consists of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$K$</tex-math></inline-formula> transmitter-receiver pairs communicating while exposed to a multi-antenna eavesdropper under channel uncertainty. To address the secrecy rate maximization problem, which involves highly non-convex optimization due to power constraints and coupled variables, the problem is formulated as a Markov decision process (MDP) and solved using the deep deterministic policy gradient (DDPG) algorithm. Numerical results show that the proposed approach achieves comparable secrecy performance to the latest asynchronous distributed pricing-based scheme while significantly reducing the computational complexity.

IEEE Transactions on Vehicular TechnologyVol. 75(3)
Edith Cowan University (AU), UNSW Sydney (AU), Wuhan University (CN), Huazhong University of Science and Technology (CN), James Cook University (AU)
Peace, Justice and strong institutions
Openalex Percentile: Top 39%
Geochemistry and Geologic Mapping
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.