Zeqing Li

Zeqing Li

Auto-generated profile, based on publicly available information

Zeqing Li

College of Information Engineering, East China Jiaotong University, Nanchang, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 January 2023 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
YYYu Yao
Yu Yao
Junhui ZhaoJunhui Zhao
Junhui Zhao
ZLZeqing Li
Zeqing Li
XCXu Cheng
Xu Cheng
LWLenan Wu
Lenan Wu
As a legacy from conventional wireless services, illegal eavesdropping is regarded as one of the critical security challenges in Connected and Autonomous Vehicles (CAVs) network. Our work considers the use of Distributed Kalman Filtering (DKF) and Deep Reinforcement Learning (DRL) techniques to improve anti-eavesdropping communication capacity and mitigate jamming interference. Aiming to improve the security performance against smart eavesdropper and jammer, we first develop a DKF algorithm that is capable of tracking the attacker more accurately by sharing state estimates among adjacent nodes. Then, a design problem for controlling transmission power and selecting communication channel is established while ensuring communication quality requirements of the authorized vehicular user. Since the eavesdropping and jamming model is uncertain and dynamic, a hierarchical Deep Q-Network (DQN)-based architecture is developed to design the anti-eavesdropping power control and possibly channel selection policy. Specifically, the optimal power control scheme without prior information of the eavesdropping behavior can be quickly achieved first. Based on the system secrecy rate assessment, the channel selection process is then performed when necessary. Simulation results confirm that our jamming and eavesdropping defense technique enhances the secrecy rate as well as achievable communication rate compared with currently available techniques.

5 May 2023 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YYYu Yao
Yu Yao
FSFeng Shu
Feng Shu
ZLZeqing Li
Zeqing Li
XCXu Cheng
Xu Cheng
LWLenan Wu
Lenan Wu
Vehicle-to-vehicle (V2V) communication applications face significant challenges to security and privacy since all types of possible breaches are common in connected and autonomous vehicles (CAVs) networks. As an inheritance from conventional wireless services, potential eavesdropping is one of the main threats to V2V communications. In our work, the anti-eavesdropping scheme in CAVs networks is developed through the use of cognitive risk control (CRC)-based vehicular joint radar-communication (JRC) system. In particular, the supplement of off-board measurements acquired using V2V links to the perceptual information has presented the potential to enhance the traffic target positioning precision. Then, transmission power control is performed utilizing reinforcement learning, the result of which is determined by a task switcher. Based on the threat evaluation, a multiple armed bandit problem is designed to implement the secret key switching procedure when it is needed. Through constant perception-execution loops (PELs), the security and confidentiality is improved for the authorized vehicles in their behavioral interactions with the illegal eavesdropper. Numerical experiments have presented that the developed approach has anticipated performance in terms of some risk assessment indicators.

17 October 2022 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
YYYu Yao
Yu Yao
ZLZeqing Li
Zeqing Li
HLHaitao Liu
Haitao Liu
PMPu Miao
Pu Miao
LWLenan Wu
Lenan Wu
The actual target range is unknown during the radar search process, which suggests that an elaborate transceiver synthesis should be concerned, also considering various number of missed target echo samples. This paper focuses on the joint robust synthesis of the radar code and filter bank to improve target detection capability against target echo eclipsing and clutter interference. For several practical considerations, two robust design strategies for transceiver optimization are considered. A majorization-minimization (MM) approach (Section III) is developed to deal with the average signal to interference plus noise ratio (SINR) design problem considering energy and similarity requirements on the waveforms. Then, the MM technique is extended to the max-min case. An accelerated MM-based procedure (Section IV) is presented for solving the worst-case SINR design problem under energy and peak-to-average ratio (PAR) requirements. Both the proposed algorithms can be ensured to converge to a B(oulingand)-stationary point. Finally, simulation results display that two proposed optimization strategies realize better target detection performance and a higher convergence rate compared with the existing approaches.

20 June 2022 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
YYYu Yao
Yu Yao
ZLZeqing Li
Zeqing Li
HLHaitao Liu
Haitao Liu
PMPu Miao
Pu Miao
LWLenan Wu
Lenan Wu
Multiple-input multiple-output (MIMO) radar optimization design for extended targets in clutter is a challenging problem owing to the lack of perfect knowledge of the target impulse response (TIR). Assuming uncertain TIR, this article focuses on the joint robust design of the radar codes and filter bank in MIMO structure to improve extended target detection capability in signal-dependent interference environment. Considering the average and the worst case signal-to-interference-plus-noise ratio (SINR) at the output as the performance metrics to maximize, we propose two iterative optimization procedures, under similarity and energy requirements on the radar code. The convergence property and asymptotic optimality of two algorithms are analyzed. Finally, simulation results have displayed that two proposed optimization strategies achieve higher objective values than the existing approaches, and share reasonable computational burden.