Zhuochen Xie

Zhuochen Xie

Auto-generated profile, based on publicly available information

Zhuochen Xie

Innovation Academy for Microsatellites of Chinese Academy of Sciences, Shanghai, China

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
18 December 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
RWRuiwen Wu
Ruiwen Wu
ZLzongwang li
zongwang li
ZXZhuochen Xie
Zhuochen Xie
XLXuwen Liang
Xuwen Liang
Spectrum sharing is a pivotal technology for integrated satellite-maritime network to improve spectrum efficiency. However, the majority of existing spectrum sharing approaches relied on time-frequency multiplexing to circumvent or suppress interference, and often overlooked the problem of incomplete observability and interference present in heterogeneous systems. This limitation hindered overall system throughput improvements. In this paper, an intelligent spectrum sharing strategy for integrated satellite-maritime heterogeneous mobile networks is firstly proposed. This strategy aims to operate co-frequency communication transmissions within the interference constraints, as derived from protocols and standards of International Telecommunication Union (ITU), to maximize the overall system throughput and spectral efficiency. Furthermore, considering the limitation that the satellite cannot fully observe channel statuses, we model the spectrum sharing process as a Partially Observable Markov Decision Process (POMDP). We employ an algorithm architecture that combines Dueling Deep Q-learning Network (DQN) and Double DQN to address this challenge, which enables satellites to efficiently evaluate the value of all channel allocation actions, thereby enhancing decision-making accuracy and algorithm convergence speed. Simulation results validate the superiority of our proposed strategy over compared methods in terms of throughput and stability.

13 April 2023 in IEEE Communications Letters
Verified
Journal Article
Closed access
XHXinyang Han
Xinyang Han
ZLzongwang li
zongwang li
ZXZhuochen Xie
Zhuochen Xie
For 2-step random access of 5G-and-beyond low earth orbit (LEO) satellite communication system, the large coverage of satellite causes the serious collisions on MsgA channel which reduce the access success probability seriously, and introduces the problem of high dimensionality. To maximize the access success probability of the system, we propose a dynamic MsgA channel allocation (MCA) strategy. The strategy is realized by flexibly pre-configuring the channels mapping relationship on MsgA via the perception of historical access information. To mitigate the curse of dimensionality for the large action space, we establish an improved twin delayed deep deterministic policy gradient (TD3) based deep reinforcement learning (DRL) model for the strategy. Simulation result shows that the proposed strategy can increase the access success probability of the system by 39.12%.

6 November 2023 in Computer Communications
Verified
Journal Article
Closed access
ZLzongwang li
zongwang li
ZXZhuochen Xie
Zhuochen Xie
XHXiaohe He
Xiaohe He
XLXuwen Liang
Xuwen Liang

20 August 2025 in IEEE Communications Letters
Verified
Journal Article
Closed access
JXJunyan Xiang
Junyan Xiang
XHXiaohe He
Xiaohe He
YZYu Zhao
Yu Zhao
ZXZhuochen Xie
Zhuochen Xie
XLXuwen Liang
Xuwen Liang
Large-scale Low Earth Orbit (LEO) constellations offer promising solutions for global network access with low latency and high-speed transmission. However, their dynamic topology poses challenges for routing. Traditional centralized routing schemes enable global optimization but entail high overhead and computational complexity, making them unsuitable for large-scale LEO networks. We propose an algorithm named MATGCIR that leverages Multi-Agent deep reinforcement learning and Temporal Graph Convolution for distributed Intelligent Routing, extracting dynamic topology features and incorporating spatiotemporal information. A pretraining mechanism using shortest path rules enhances training efficiency and decision quality. Simulation results demonstrate that MATGCIR effectively addresses LEO network complexities and accelerates the training process for large-scale constellations.

15 April 2025 in IEEE Communications Letters
Verified
Journal Article
Closed access
LWLuyao Wang
Luyao Wang
MYMubiao Yan
Mubiao Yan
HZHao Zhou
Hao Zhou
WYWenxin Yang
Wenxin Yang
ZXZhuochen Xie
Zhuochen Xie
This letter addresses the wireless resource scheduling challenge for high-density low-earth orbit (LEO) satellite constellations, catering to the demands of wide-area User Equipments (UEs). Aiming to maximize system capacity, we conceptualize the issue as a multi-branch bipartite graph matching problem with specially designed vertices, and propose an ‘access-right’ based two-step matching mechanism for satellite channel allocation (ARSMM). ARSMM runs in two steps. Firstly, the mechanism employs a Hungarian algorithm based on determining ‘access-right’ to obtain satellite-UE scheduling. Secondly, it introduces a matching adjustment algorithm based on three criteria, respectively, to accommodate the varying channel demands of the UEs. Numerical simulation results indicate that ARSMM markedly improves resource utilization efficiency and system capacity compared to the baseline algorithm. Moreover, it achieves near-parity with the Genetic Algorithm while significantly improving processing speed to millisecond-level efficiency.

29 July 2024 in IEEE Communications Letters
Verified
Journal Article
Closed access
MYMubiao Yan
Mubiao Yan
ZXZhuochen Xie
Zhuochen Xie
HLHuijie Liu
Huijie Liu
This letter proposes to integrate multibeam satellite with terrestrial network for traffic offloading, and investigates the problem of joint resource allocation of satellite backhaul links and terrestrial user links, aiming to maximize the offloading energy efficiency. To address the mixed-integer and nonconvex problem, we decompose it into subproblems and propose an effective two-step algorithm. In the first step, the user links allocation for terrestrial BSs is solved by extended water-filling to maximize the BS sum rate while ensuring users’ QoS requirements. In the second step, the satellite subproblem under capacity constraint is converted into a convex subproblem iteratively by quadratic transform to obtain the near-optimal satellite beam power. Numerical simulations verify that our proposed algorithm outperforms benchmark algorithms in offloading energy efficiency by at least 12.1%.