Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Li Gan

dblp:87/8055 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Physical-layer communications · 100%
Network and information security
2 papers
Network security · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Energy systems and smart grids · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › physical layer security › artificial noise
artificial noise beamforming
0.912025
Robust Outage-Constrained Secrecy Rate of Hybrid Power Line and Wireless Communication With Artificial Noise-Aided Beamforming for Smart Grid · IEEE Trans. Commun. 2025
Physical-layer communications
physical layer security
0.912025
Robust Outage-Constrained Secrecy Rate of Hybrid Power Line and Wireless Communication With Artificial Noise-Aided Beamforming for Smart Grid · IEEE Trans. Commun. 2025
Physical-layer communications › MIMO
interference channel
0.812024
Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels · IEEE Trans. Inf. Forensics Secur. 2024
Physical-layer communications
MIMO
0.812024
Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels · IEEE Trans. Inf. Forensics Secur. 2024
Network security › wireless network security
physical layer security
0.812024
Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels · IEEE Trans. Inf. Forensics Secur. 2024
Energy systems and smart grids › cyber-physical energy systems
smart grid communication
0.312025
Robust Outage-Constrained Secrecy Rate of Hybrid Power Line and Wireless Communication With Artificial Noise-Aided Beamforming for Smart Grid · IEEE Trans. Commun. 2025
Network security › wireless network security › physical layer security
secrecy rate
0.312025
Robust Outage-Constrained Secrecy Rate of Hybrid Power Line and Wireless Communication With Artificial Noise-Aided Beamforming for Smart Grid · IEEE Trans. Commun. 2025

Methods — techniques the papers use, named apart from their topics

semidefinite programming · 2.6block-coordinated descent · 2.6bernstein-type inequality · 2.6weighted minimum mean square error · 1.5sign-definiteness · 1.5schur complement · 1.5distributed pricing · 1.5alternating convex search · 1.5
YearPublicationVenuePosition
2025 Robust Outage-Constrained Secrecy Rate of Hybrid Power Line and Wireless Communication With Artificial Noise-Aided Beamforming for Smart Grid
abstract
Power line communication is a critical component of smart grids, which are vulnerable to eavesdropping. To address this challenge, we investigate a cooperative relay hybrid power line and wireless communication system where multiple eavesdroppers are considered. We propose an elaborate artificial noise (AN)-aided beamforming (BF) scheme to improve physical layer security. Our scheme maximizes the outage-constrained secrecy rate (OCSR) of the legitimate link while restricting the capacity of the eavesdroppers to a reasonable region. However, due to the imperfect channel state information of the wiretap channel and secrecy outage probability constraint, the robust OCSR problem becomes intractable because of the non-concave secrecy objective function and the non-convex constraints. To solve this issue, we utilize semidefinite programming and Bernstein-type inequality to transform the robust OCSR nonconvex problem into two convex sub-problems, which a block-coordinated descent algorithm can solve. Simulation results showcase the effectiveness of our robust AN-aided secure BF scheme and show that the proposed scheme outperforms the benchmark scheme in a security performance gain under various channel conditions, even in the worst case.
Zhengmin Kong, Li Gan, Tao Huang 0008, Weijun Yin, Shihao Yan, Jinhong Yuan
IEEE Trans. Commun.2
2024 Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels
abstract
We propose a distributed artificial noise-assisted precoding scheme for secure communications over wiretap multi-input multi-output (MIMO) interference channels, where K legitimate transmitter-receiver pairs communicate in the presence of a sophisticated eavesdropper having more receive-antennas than the legitimate user. Realistic constraints are considered by imposing statistical error bounds for the channel state information of both the eavesdropping and interference channels. Based on the asynchronous distributed pricing model, the proposed scheme maximizes the total utility of all the users, where each user’s utility function is defined as the secrecy rate minus the interference cost imposed on other users. Using the weighted minimum mean square error, Schur complement and sign-definiteness techniques, the original non-concave optimization problem is approximated with high accuracy as a quasi-concave problem, which can be solved by the alternating convex search method. Simulation results consolidate our theoretical analysis and show that the proposed scheme outperforms the artificial noise-assisted interference alignment and minimum total mean-square error-based schemes.
Zhengmin Kong, Shaoshi Yang, Li Gan, Weizhi Meng 0001, Tao Huang 0008, Sheng Chen 0001
IEEE Trans. Inf. Forensics Secur.4
2009 Adaptive predistortion of nonlinear Volterra systems using Spectral Magnitude Matching
abstract
Digital compensation of nonlinear systems is an important topic in many practical applications. This paper considers the problem of predistortion of nonlinear systems described using Volterra series by connecting in tandem an adaptive Volterra predistorter. The suggested direct learning architecture (DLA) approach utilizes the spectral magnitude matching (SMM) method that minimizes the sum squared error between the spectral magnitudes of the output signal of the nonlinear system and the desired signal. The coefficients of the predistorter are estimated recursively using the generalized Newton iterative algorithm. A comparative simulation study with the nonlinear filtered-x least mean squares (NFxLMS) algorithm shows that the suggested SMM approach achieves much better performance but with higher computation complexity.
Emad Abd-Elrady, Li Gan, Gernot Kubin
ICASSP2