Yuan Zuo

Dr. Yuan Zuo

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
13 January 2020 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
YZYuan Zuo
Yuan Zuo
YWYulei Wu
Yulei Wu
Geyong  MinGeyong Min
Geyong Min
CHChengqiang Huang
Chengqiang Huang
KPKe Pei
Ke Pei
Service-oriented 5G mobile systems are commonly believed to reshape the landscape of the Internet with ubiquitous services and infrastructures. The micro-services architecture has attracted significant interests from both academia and industry, offering the capabilities of agile development and scale capacity. The emerging mobile edge computing is able to firmly maintain efficient resource utility of 5G systems, which can be empowered by micro-services. However, such capabilities impose significant challenges on micro-services system management. Although substantial data are produced for system maintenance, the interleaved temporal-spatial information has not been fully exploited. Additionally, the flooding data impose heavy pressures on automatic analysis tools. Automated digestion of data is in an urgent need for system maintenance. In this paper, we propose a new learning-based anomaly detection framework for service-provision systems with micro-services architectures using service execution logs (temporally) and query traces (spatially). It includes two major parts: logging and tracing representation, and two-stage identification via a sequential model and temporal-spatial analysis. The experimental results show that the temporal-spatial features can accurately capture the nature of operational data. The proposed framework performs well on anomaly detection, and helps gain in-depth insights of large-scale systems.

1 March 2019 in Future Generation Computer Systems
Verified
Journal Article
Open access
YZYuan Zuo
Yuan Zuo
YWYulei Wu
Yulei Wu
GMGeyong Min
Geyong Min
LCLaizhong Cui
Laizhong Cui

8 July 2022 in Electronics
Verified
Journal Article
Open access
PDF file
YZYuan Zuo
Yuan Zuo
WYWen Yao
Wen Yao
QCQiang Chang
Qiang Chang
XZXiaozhou Zhu
Xiaozhou Zhu
JGJianjun Gui
Jianjun Gui
JQJiangyi Qin
Jiangyi Qin
The recent advances in unmanned aerial vehicles (UAVs) enormously improve their utility and expand their application scope. The UAV and swarm implementation further prevail in Smart City practices with the aid of edge computing and urban Internet of Things. The lead–follow formation in UAV swarm is an important organization means and has been adopted in diverse exercises, for its efficiency and ease of control. However, the reliability of centralization makes the entire swarm system in risk of collapse and instability, if a fatal fault incident happens in the leader. The motivation is to build a mechanism helping the distributed swarm recover from possible failures. Existing ways include assigning definite backups, temporary clustering and traversing to select a new leader are traditional ways that lack flexibility and adaptability. In this article, we propose a voting-based leader election scheme inspired by the Raft method in distributed computation consensus to solve the problem. We further discuss the impact of communication conditions imposed on the decentralized voting process by implementing a network resource pool. To dynamically evaluate UAV individuals, we outline measurement design principles and provide a realizable calculation example. Lastly but not least, empirical simulation results manifest better performance than the Raft-based method. Our voting-based approach exhibits advantages and is a promising way for quick regrouping and fault recovery in lead–follow swarms.

10 October 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
CZchen zhang
chen zhang
WYWen Yao
Wen Yao
YZYuan Zuo
Yuan Zuo
JGJianjun Gui
Jianjun Gui
CZChuanFu Zhang
ChuanFu Zhang
In multi-UAVs system, high-quality communication system is the key to ensure cooperation. Most of the existing methods focus on the trade-off between connectivity and the number of network edges. However, for a multi-UAVs communication network with high quality of service (QoS), more metrics of communication network need to be considered, such as the hops and the maximum number of links. In this paper, we propose a multi-objective optimization method for dynamic communication network. Firstly, in order to accurately estimate the moved positions with random noise, Long and Short Term Memory network (LSTM) is used to predict succeeding positions of all UAVs. Secondly, Deep Q-network (DQN) with random action space is designed to adaptively adjust the communication network. In particular, it can be applied to large-scale communication networks. Furthermore, we propose a transfer learning method based on the trained LSTM and DQN. In this transfer learning, these two models which are well-trained in smaller communication network and combined with principal component analysis (PCA) can be directly used for communication network optimization of larger networks. Experimental results show that our method is not only superior to other methods but also faster in convergence.

18 May 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SLShengyang Liu
Shengyang Liu
WYWen Yao
Wen Yao
XZXiaozhou Zhu
Xiaozhou Zhu
YZYuan Zuo
Yuan Zuo
BZBin Zhou
Bin Zhou
In the cooperative searching scenario, most traditional methods are based on the top–down mechanisms. These mechanisms are usually offline and centralized. The characteristics limit the adaptability of unmanned aerial vehicle (UAV) swarm to the complex mission environments, such as those with inaccurate information of the targets and grids. In order to improve the searching ability of UAV swarm, a novel searching method named emergent search of UAV swarm guided by the target probability map (ESUSTPM) is proposed. ESUSTPM is based on local rules to organize and guide UAV agents to achieve the flocking state, search the mission area and detect the hidden targets concurrently. In ESUSTPM, local rules contain the flocking rules and the guiding rules. The flocking rules are the interactions between the agents, which are designed by a novel constructed function based on two exponential functions in this paper. The new constructed function can better maintain the relatively stable distances between the agents and realize the smooth transition of the positions at the given centers. The local guiding rules based on the target probability information of the nearby grids are firstly designed to realize the multi-function of the swarm, including full area coverage, target detection and reduction in environmental uncertainty (EU). Finally, the simulations verify that ESUSTPM can achieve the full coverage of the mission area while taking into account the target search. The statistical results also indicate that the searching efficiency of the proposed ESUSTPM is higher than the traditional searching algorithms based on the division and allocation of the area or the heuristic algorithms.

19 July 2022 in Electronics
Verified
Journal Article
Open access
PDF file
JQJiangyi Qin
Jiangyi Qin
FZFei Zhang
Fei Zhang
KWKai Wang
Kai Wang
YZYuan Zuo
Yuan Zuo
CDChenxi Deng
Chenxi Deng
Aiming at the scarcity of Low Earth Orbit (LEO) satellite spectrum resources, this paper proposes an algorithm of interference signal feature extraction and pattern classification based on deep learning to further improve the stability of satellite–ground communication links. The algorithm can successfully predict the interference signal pattern, start–stop time, frequency change range and other parameters, and has the advantages of excellent interference detection performance, high detection accuracy and small parameter prediction error, etc. It can be applied in the field of channel monitoring of communication satellite-to-ground communication links, and realize the repeated and efficient utilization of spectrum resources. Experiments show that the precision and recall of the algorithm for detecting five kinds of interference signals are all close to 100%, the prediction error of starting and ending time is less than 4 ms, and the prediction error of starting and ending frequency is less than 6 KHz.