Zizhen Zhou

Zizhen Zhou

Auto-generated profile, based on publicly available information

Zizhen Zhou

National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China (UESTC), Chengdu, 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
11 December 2024 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ZZZizhen Zhou
Zizhen Zhou
QZQianqian Zhang
Qianqian Zhang
JGJungang Ge
Jungang Ge
YLYing-Chang Liang
Ying-Chang Liang
In space-air-ground integrated networks (SAGINs), cognitive spectrum sharing has been regarded as a promising solution to meet the rapidly increasing spectrum demand of various applications, because it can significantly improve the spectrum efficiency by enabling a secondary network to access the spectrum of a primary network. However, different networks in SAGIN may have different quality of service (QoS) requirements, which can not be well satisfied with the traditional cognitive spectrum sharing architecture. To address this issue, in this paper, we propose a hierarchical cognitive spectrum sharing architecture (HCSSA) for SAGINs, where the secondary networks are divided into a preferential one and an ordinary one. Specifically, the aerial and terrestrial networks can access the spectrum of the satellite network under the condition that the caused interference to the satellite terminal is below a certain threshold. Besides, considering that the aerial network has a higher priority than the terrestrial network, we aim to use a rate constraint to ensure the performance of the aerial network. Subject to these two constraints, we consider a sum-rate maximization for the terrestrial network by jointly optimizing the transmit beamforming vectors of the aerial and terrestrial base stations. To solve this non-convex problem, we propose a penalty-based iterative beamforming (PIBF) scheme that uses the penalty method and the successive convex approximation technique. Moreover, we also develop three low-complexity schemes, where the beamforming vectors are obtained by optimizing the normalized beamforming vectors and power control. In addition, we consider the case where only statistical channel state information is available and the case where channel estimation errors exist, and propose the corresponding beamforming schemes. Finally, we provide extensive numerical simulations to evaluate the performance of the proposed beamforming schemes and demonstrate the advantages of the proposed HCSSA compared with the traditional cognitive spectrum sharing architecture.

28 July 2022 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
ZZZizhen Zhou
Zizhen Zhou
BCBowen Cai
Bowen Cai
JCJie Chen
Jie Chen
YLYing-Chang Liang
Ying-Chang Liang
In this letter, we study the channel estimation problem for the reconfigurable intelligent surface (RIS)-aided multi-input single-output (MISO) system. By exploiting the channel sparsity, compressive sensing (CS) based sparse channel estimators can be applied to the system to reduce the training overhead. However, these existing sparse channel estimators adopt predefined dictionaries when formulating the sparse matrix recovery problem, which will cause grid mismatch issues and estimation performance degradation. Hence, in this letter, we formulate the channel estimation problem as a joint dictionary parameter learning and sparse signal recovery problem, in which the dictionary parameter can be optimized to adapt to the channel measurements, thereby improving the robustness of sparse channel representation and estimation performance. Then, we propose an iterative re-weighted algorithm to solve this non-convex problem efficiently. Simulation results show that the proposed algorithm outperforms other benchmark schemes significantly.

5 August 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZWZizhen Wang
Zizhen Wang
XKXin Kang
Xin Kang
ZZZizhen Zhou
Zizhen Zhou
QTQing Tang
Qing Tang
YLYing-Chang Liang
Ying-Chang Liang
By integrating Cognitive Radio (CR) functionality into the Internet of Things (IoT), the CR-based IoT network offers a promising solution to the spectrum scarcity problem faced by traditional IoT systems. However, accurate and fair Cooperative Spectrum Sensing (CSS) faces many challenges, such as malicious nodes’ presence, sensor behaviour reliability, and IoT devices’ limited energy. In this paper, we propose a lightweight blockchain-enabled CSS system that enhances transparency and reliability in sensing report exchange and fusion. Specifically, we introduce a comprehensive trust evaluation algorithm and a fair sensor selection method to assess the reliability of sensors and fairly assign spectrum sensing tasks. To ensure the decentralization and security of IoT networks, we propose a lightweight consensus mechanism which utilizes trust values and deposits to determine voting weights during producer elections while removing malicious nodes by blocklist mechanism. A smart contract is also designed to automate the entire CSS process, including spectrum sensing, deposit management, and trust management. Finally, security analysis and numerical simulations are conducted to demonstrate the effectiveness and robustness of the proposed blockchain-enabled CSS system.

10 July 2025 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ZZZizhen Zhou
Zizhen Zhou
JGJungang Ge
Jungang Ge
YLYing-Chang Liang
Ying-Chang Liang
Cognitive aerial-terrestrial networks (CATN) hold promise in addressing the spectrum shortage challenges posed by thriving aerial networks, where aerial users (AUs) requiring high-quality downlink communications suffer severe interference from numerous terrestrial base stations (BSs). To alleviate such interference, we propose jointly optimizing the user association and coordinated beamforming (CBF) of the terrestrial network, thereby maximizing the sum rate of the secondary terrestrial users (TUs) under the interference temperature constraints of the primary AUs. Traditional iterative optimization schemes are impractical for this problem due to their high computational complexity and information exchange overhead. Although deep reinforcement learning (DRL)-based schemes offer a viable alternative, their performance is sensitive to the weight of the constraint violation penalty in the reward. To overcome these limitations, we propose a safe DRL-based user association and CBF scheme for CATN, which avoids multiple training attempts to find the optimal penalty weight before actual deployment and reduces expenses. Specifically, the studied system is modeled as a networked constrained partially observable Markov game, where each TU agent chooses its associated BS, and each BS agent decides its beamforming vectors, aiming to maximize the reward while satisfying the safety constraints to protect the AUs. Simulation results show that the proposed scheme can achieve a higher sum rate of TUs than a two-stage optimization scheme while the average received interference power of the AUs is generally below the threshold.

1 June 2026 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
ZZZizhen Zhou
Zizhen Zhou
YLYing-Chang Liang
Ying-Chang Liang
YCYanan Cheng
Yanan Cheng
WLWei Yang Bryan Lim
Wei Yang Bryan Lim
Deploying foundation models (FMs) on uncrewed aerial vehicles (UAVs) promises broad “low-altitude economy” applications. Split federated learning (SFL)-based fine-tuning leverages distributed data while keeping raw data local and reduces client-side burden by partitioning the model between client and server. However, the per-round training latency is dominated by stragglers. Training paradigms featuring parallel gradient transmission (GT) allocate dedicated portions of downlink communication resources to each client. They may leave resources idle and suffer from prolonged GT latency, especially in UAV networks, where the communication latency typically far exceeds the computation latency. To address this, we propose a sequential GT paradigm, where the server dedicates all downlink resources for the current GT. We further propose communication-pipelined SFL (CPSFL), characterized by downlink GT priority scheduling and intra-round asynchronous training. We investigate CPSFL-based LoRA fine-tuning of FMs in UAV networks and formulate an optimization problem to minimize a weighted sum of per-round training latency and worst-case client energy consumption by optimizing the split point selection (SPS) and the computing and communication resource allocation (CCRA) (the uplink bandwidth allocation and the server computing frequency allocation). To solve this problem, we develop an attention-based deep reinforcement learning (DRL) framework, where the base station agent decides the split point and the CCRA in each round by leveraging previous round information, including UAV trajectories. Simulation results show that the proposed DRL-based CPSFL scheme outperforms the parallel GT baselines, the ablation variants, and the heuristic CCRA scheme while approaching the best fixed-SPS scheme.