Wanyu Xiang

Wanyu Xiang

Auto-generated profile, based on publicly available information

Wanyu Xiang

National University of Defense Technology

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
2 March 2022 in IEEE Communications Letters
Verified
Journal Article
Closed access
YLYuan Li
Yuan Li
YZYuchen Zhang
Yuchen Zhang
JWJianquan Wang
Jianquan Wang
WXWanyu Xiang
Wanyu Xiang
SXSa Xiao
Sa Xiao
WTWanbin Tang
Wanbin Tang
In this letter, we analyze the performance of covert communications under faster-than-Nyquist (FTN) signaling in the Rayleigh block fading channel. Both maximum likelihood criterion- and Kullback-Leibler (KL) divergence-based covertness constraints are considered. Especially, for KL divergence-based one, we prove that both the maximum transmit power and covert rate under FTN signaling are higher than those under Nyquist signaling. Numerical results coincide with our analysis and validate the advantages of FTN signaling to realize covert data transmission.

1 June 2022
Verified
Conference Paper
Closed access
WXWanyu Xiang
Wanyu Xiang
JWJianquan Wang
Jianquan Wang
SXSa Xiao
Sa Xiao
WTWanbin Tang
Wanbin Tang
In this paper, we investigate multi-antenna covert communications, where the transmitter Alice equips multiple antennas, the legitimate receiver Bob and the eavesdropper Willie equips single antenna. Through analyzing the detection performance and the covert rate, we prove that a positive covert rate is achievable with a certain number of antennas in Alice. Numerical results are shown to illustrate the correctness of our results and the performance of MISO covert communication.

23 December 2024 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Open access
QZQuan Zhou
Quan Zhou
YNYingtao Niu
Yingtao Niu
WXWanyu Xiang
Wanyu Xiang
LZLiping Zhao
Liping Zhao
The intelligent antijamming algorithm based on deep reinforcement learning (DRL) has become a prominent focus in communication antijamming research. However, while DRL aims to accurately fit complex behavioral strategies, communication antijamming prioritizes the speed of strategy fitting. To bridge this gap, we introduce a novel reinforcement learning (RL) antijamming algorithm called broad Q-network (BQN), which merges a specialized flattened neural network, broad learning system (BLS), with the RL framework. First, a new RL algorithm architecture is proposed based on the characteristics of BLS using ridge regression for network updates. Subsequently, an experience memory and training matrix construction mechanism is introduced for sample collection and utilization during the strategy update phase. Finally, a communication-sensing-decision parallel time slot structure is employed, addressing the issues of lagging sensing results and delayed reward computation. Simulation results demonstrate that under the environments of comb sweep jamming, nonlinear sweep jamming, and intelligent blocking jamming, our BQN's convergence speed is more than 10, 5, and 2.5 times faster than that of the most popular deep Q-network algorithm, respectively. Compared to mainstream DRL algorithms, such as dueling double deep Q-network, dropout Q-function, and proximal policy optimization, BQN also achieves faster acquisition of effective multidomain antijamming strategies, encompassing the frequency, power, and rate domains, in three dynamic jamming environments.

18 April 2022 in IEEE Communications Letters
Verified
Journal Article
Closed access
YZYuchen Zhang
Yuchen Zhang
YLYuan Li
Yuan Li
WXWanyu Xiang
Wanyu Xiang
JWJianquan Wang
Jianquan Wang
SXSa Xiao
Sa Xiao
WTWanbin Tang
Wanbin Tang
In this letter, we consider the covert communications under precoded faster-than-Nyquist (FTN) signaling. We first propose a general framework to analyze the detection performance of an illegal adversary for the precoded FTN signaling, and then derive a general principle for the optimal precoding scheme maximizing the covert throughput under the Kullback-Leibler (KL) divergence-based constraint. The covert throughput of the optimal precoding scheme is obtained based on the proposed framework, and it is theoretically proved to be higher than that of the non-precoded FTN as well as Nyquist ones. Numerical results also verify the superiority of the optimal precoded FTN signaling in terms of the covert throughput.

3 December 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
WXWanyu Xiang
Wanyu Xiang
CHChen Han
Chen Han
ZLZhi Lin
Zhi Lin
YLYusheng Li
Yusheng Li
Yifu SunYifu Sun
Yifu Sun
XLXin Lin
Xin Lin
Joint communication and computing power network (JCCPN) has emerged as a promising architecture of the 6G wireless networks due to low latency communication and efficient computing services. However, the existing works have not fully considered the spatiotemporal mismatch between computing power supply and practical traffic distribution, leading to failure risks or resource waste. Specifically, the mismatch arises from two aspects, i.e., 1) the competition for the data links between collaborative inference tasks and communication transmission tasks; 2) the fixed computing power allocation struggles to meet dynamic computing demand. This paper focuses on the mismatch problem in JCCPNs, and formulated a joint optimization model for inference links and computing nodes. The joint optimization model was theoretically decoupled into two submodels, efficiently addressing interdependencies between links and nodes. Then, we proposed an inference-subgraph driven multi-agent deep reinforcement learning (IsMADRL) algorithm for JCCPN, consisting of two stages. At the first stage, we formulated an inference subgraph based on ordinal potential game (OPG) to separate computing and transmission data flows, ensuring collaborative inference tasks. At the second one, multi-agent deep reinforcement learning (MADRL) framework is employed on the inference-subgraph to allocate computing power dynamically, meeting the varying traffic distribution. Simulation results show that several MADRL architectures all exhibit excellent adaptability and effectiveness in complex JCCPNs.

1 January 2026 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
WXWanyu Xiang
Wanyu Xiang
CHChen Han
Chen Han
YLYusheng Li
Yusheng Li
Yifu SunYifu Sun
Yifu Sun
GDGuoru Ding
Guoru Ding