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

Kewei Wang 0006

dblp:253/2810-6 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0002-7840-7893ORCID · verified

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

Computer networks · 2 · 1 first-author · 2 since 2021

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
1 paper
Physical-layer communications · 50% Cellular and mobile networks · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
integrated sensing and communication
1.012026
Robust RIS-Assisted Secure ISAC Design Against Multiple Colluding Eavesdroppers · IEEE J. Sel. Areas Commun. 2026
Physical-layer communications
reconfigurable intelligent surface
1.012026
Robust RIS-Assisted Secure ISAC Design Against Multiple Colluding Eavesdroppers · IEEE J. Sel. Areas Commun. 2026
Physical-layer communications › reconfigurable intelligent surface
RIS-assisted communication
1.012026
Robust RIS-Assisted Secure ISAC Design Against Multiple Colluding Eavesdroppers · IEEE J. Sel. Areas Commun. 2026
Cellular and mobile networks › integrated sensing and communication
secure ISAC
1.012026
Robust RIS-Assisted Secure ISAC Design Against Multiple Colluding Eavesdroppers · IEEE J. Sel. Areas Commun. 2026
Mathematical optimization › nonconvex optimization
alternating minimization
0.312026
Robust RIS-Assisted Secure ISAC Design Against Multiple Colluding Eavesdroppers · IEEE J. Sel. Areas Commun. 2026
Mathematical optimization › iterative methods
majorization-minimization
0.312026
Robust RIS-Assisted Secure ISAC Design Against Multiple Colluding Eavesdroppers · IEEE J. Sel. Areas Commun. 2026

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

s-procedure · 2.0majorization-minimization · 2.0alternating optimization · 2.0
YearPublicationVenuePosition
2026 Robust RIS-Assisted Secure ISAC Design Against Multiple Colluding Eavesdroppers
abstract
The open and vulnerable nature of wireless channels exacerbates security risks in integrated sensing and communication (ISAC) systems, especially when the sensing targets act as potential eavesdroppers (Eves), and these risks intensify with collusion among Eves. To address this challenge, this paper investigates a novel strategy for a robust reconfigurable intelligent surfaces (RIS)-assisted secure ISAC system, where an ISAC base station facilitates simultaneous secure communication with legitimate users and sensing of multiple targets that may serve as Eves. We examine two different interaction mechanisms among Eves, namely, non-colluding Eves (NCE) and colluding Eves (CE), under both perfect and imperfect channel state information (CSI) assumptions. For both mechanisms, we formulate the optimization problem of maximizing users’ sum secrecy rate by jointly designing the transmit beamforming and RIS phase-shifts. This optimization is subject to constraints on transmit power, sensing requirements, and unit-modulus RIS phase shifts. The resulting non-convex problems are solved via alternating optimization (AO) algorithms. Specifically, in order to handle the severely non-convex and coupled objective function and multi-link accumulated channel error constraints caused by CE as well as imperfect CSI, we employ the majorizationminimization algorithm and the S-procedure to convert these problems into tractable forms. Simulation results validate the effectiveness of our proposed algorithms. We highlight that, at the expense of a 15% reduction in the users’ sum rate, our proposed algorithm achieves up to a 185% increase in the sum secrecy rate. Furthermore, we quantify the sensing-security trade-off by analyzing the reduction of the sum secrecy rate induced by sensing requirements, and we reveal the impacts of various factors on the sum secrecy rate, such as RIS element number, channel estimation errors, and sensing thresholds.
Kewei Wang 0006, Tongxing Zheng, Guojie Hu 0001, Fengchao Zhu, Guoxin Li 0003, Jia Shi 0001, Zhou Su 0001, Zan Li 0001
IEEE J. Sel. Areas Commun.1
2024 Intelligent reflecting surface-assisted UAV inspection system based on transfer learning
abstract
Abstract Intelligent reflective surface (IRS) provides an effective solution for reconfiguring air‐to‐ground wireless channels, and intelligent agents based on reinforcement learning can dynamically adjust the reflection coefficient of IRS to adapt to changing channels. However, most exiting IRS configuration schemes based on reinforcement learning require long training time and are difficult to be industrially deployed. This paper, proposes a model‐free IRS control scheme based on reinforcement learning and adopts transfer learning to accelerate the training process. A knowledge base of the source tasks has been constructed for transfer learning, allowing accumulation of experience from different source tasks. To mitigate potential negative effects of transfer learning, quantitative analysis of task similarity through unmanned aerial vehicle (UAV) flight path is conducted. After identifying the most similar source task to the target task, parameters of the source task model are used as the initial values for the target task model to accelerate the convergence process of reinforcement learning. Simulation results demonstrate that the proposed method can increase the convergence speed of the traditional DDQN algorithm by up to 60%.
Nan Qi 0001, Kewei Wang 0006, Ming Xiao 0001, Wen-Jing Wang 0002
IET Commun.3