Shuai Liu

Shuai Liu

Auto-generated profile, based on publicly available information

Shuai Liu

School of Electronic Science and Engineering, Nanjing University, Nanjing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
5 October 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JWJingjing Wang
Jingjing Wang
SLShuai Liu
Shuai Liu
WSWei Shi
Wei Shi
Guangjie HanGuangjie Han
Guangjie Han
SYShefeng Yan
Shefeng Yan
As a result of the development of the Internet of Underwater Things (IoUT), underwater connected devices generate a large volume of data with varying values and time sensitivity. Previous data collection strategies cannot accommodate the varying time requirements of various data types. To address the aforementioned issues, this article proposes a cooperative data collection method (MADC-DV) for multiple autonomous underwater vehicles (AUVs) based on local global deep $Q$ learning (LG-DQN) and data value, which divides data into emergency and nonemergency and achieves hybrid data collection. First, the MAC protocol for communication between AUVs and clusters is designed to divide nonemergency data into high-value data and low-value data, with low-value data not needing to reply to ACK acknowledgment packets, thereby reducing the nonemergency data collection delay. Second, nonemergency data are collected cooperatively using multiple AUVs, and the LG-DQN approach is used to plan the paths for multiple AUV data collection in order to reduce the overall energy consumption of underwater wireless sensor networks (UWSNs). Finally, emergency data are collected using a multihop routing approach to assist in the collection. A routing method is proposed to compensate for the inability of AUVs to be applied to emergency data collection. The experimental results indicate that the method can improve the network life cycle by 18.7%, reduce the delay in the collection of nonemergency data by 40%, and reduce the delay in the collection of emergency data by 26.3%, thereby meeting the varying time requirements for different types of data.

4 April 2024 in IEEE Sensors Journal
Verified
Journal Article
Closed access
SLShuai Liu
Shuai Liu
JWJingjing Wang
Jingjing Wang
WSWei Shi
Wei Shi
Guangjie HanGuangjie Han
Guangjie Han
SYShefeng Yan
Shefeng Yan
JLJiaheng Li
Jiaheng Li
With the development of the Internet of Underwater Things (IoUT), both academia and industry have significant emphasized underwater wireless sensor networks (UWSNs). To address the issues of slow convergence, high latency, and limited energy in existing intelligent routing protocols in UWSNs, a cross-layer opportunistic routing protocol (CLORP) for underwater sensor networks based on multi-agent reinforcement learning (MARL) is proposed in this paper. First, CLORP combines the decision-making capability of multi-agent reinforcement learning with the idea of opportunistic routing to sequentially select a set of neighbors with larger values as potential forwarding nodes, thereby increasing the packet transmission success rate. Second, in the design of the MARL reward function, two reward functions for successful and unsuccessful packet transmission are designed jointly with cross-layer information to improve the routing protocol’s performance. Finally, two algorithmic optimization strategies, adaptive learning rate and Q-value initialization based on location and number of neighbors, are proposed to facilitate the faster adaptation of agents to the dynamic changes of network topology and accelerate CLORP convergence. The experimental results demonstrate that CLORP can increase algorithm convergence speed by 13.2%, reduce network energy consumption by 25%, and decrease network latency by 31.2%.

9 July 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SLShuang Li
Shuang Li
SLShuai Liu
Shuai Liu
JWJingjing Wang
Jingjing Wang
SYShefeng Yan
Shefeng Yan
JLJiahao Liu
Jiahao Liu
ZDZehua Du
Zehua Du
With little or no human intervention, almost every object in Internet of Things (IoT) has ability to communicate, sense, and process information to make everything connected. Noise in complex environment has a great impact on machine-to-machine (M2M) interaction in IoT. Adaptive wavelet threshold function (AWTF)-based M2M Gaussian Noise Removal Method is proposed in this article. First, a bilateral enhanced wavelet threshold function is derived based on the adjustable zeroing window. Further, threshold is used to construct a bilateral enhanced wavelet threshold function, which can eliminate the oscillations in the existing wavelet threshold function. This ensures that there is no break in wavelet coefficients during the reconstruction process and that stable wavelet decomposition and reconstruction can be achieved. The signal-to-noise ratio (SNR) of a signal is estimated based on the variance of the noise-containing signal, and the zeroing window parameters are adjusted adaptively according to the SNR value to eliminate the noisy wavelet coefficients and improve the denoising performance. In addition, when the wavelet coefficients are reconstructed, the proposed algorithm can select a suitable threshold function according to a particular threshold value, which improves the robustness of the algorithm. “Doppler” and “Bumps” standard test signals are used as interactive signals to simulate the proposed algorithms. For “Doppler” signals, the SNR, root mean square error (RMSE), and noise suppression ratio (NSR) of AWTF increased by 8.48%, 42.59%, and 1.69%, respectively, compared with the GDES+ABC algorithm. For “Bumps” signal, the SNR, RMSE, and NSR of AWTF are improved by 11.67%, 24.46%, and 2.99%, respectively, compared with GDES+ABC algorithm. In addition, we also use different modulated signals to carry out real field experiments in Qingdao cruise ship home port, which proves the effectiveness of the proposed algorithm.

11 March 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SLShuai Liu
Shuai Liu
WLWenfeng Li
Wenfeng Li
HCHongyan Chen
Hongyan Chen
JWJingjing Wang
Jingjing Wang
KZKanglian Zhao
Kanglian Zhao
With the increasing number of terminal devices in the Ocean of Things (OoT), it is necessary to apply the OoT mobile edge computing (MEC) paradigm to low-Earth orbit (LEO) satellites. The aim is to support the operation of compute-intensive OoT services with LEO satellite assistance. To address the proliferation of computing services in OoT, this article proposes a satellite-assisted task offloading and resource allocation (STORA) approach for OoT edge computing, which includes a generalized framework for three-layer MEC systems in space, on the surface, and underwater. First, the MEC system energy minimization problem is described as mixed integer-nonlinear programming (MINLP) and divided into two subproblems: 1) task offloading and 2) resource allocation. Second, the task offloading subproblem is modeled as a Markov decision process (MDP). The proposed adaptive deep deterministic policy gradient (A-DDPG) algorithm jointly optimizes the offloading policy and offloading volume. In A-DDPG, a soft network update method with an adaptive updating coefficient ensures stable network updates while achieving fast convergence. Finally, the resource allocation is decomposed into a joint optimization problem involving buoy and satellite computational resources, which is shown to be convex. The Lagrange multiplier method is used to optimize the buoy-satellite resource allocation problem while also balancing edge computational load across servers. The experimental results show that STORA can reduce network energy consumption by 17.8%, increase network lifetime by 24.4%, and lower network latency by 11.5%.

20 April 2026 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
SLShuai Liu
Shuai Liu
XMXiangxu Meng
Xiangxu Meng
YZYun Zhong
Yun Zhong
WLWenfeng Li
Wenfeng Li
KZKanglian Zhao
Kanglian Zhao
This paper investigates dual-timescale joint optimization for dynamic edge service deployment and task scheduling in space-air-ground integrated networks (SAGINs) with mobile edge computing (MEC). We decompose the original problem into a long-term (LT) service deployment subproblem and a short-term (ST) task scheduling subproblem to address the timescale disparity and coupling constraints. For the LT subproblem, an improved whale optimization algorithm (IWOA) is developed with a cosine-based nonlinear convergence factor, vertical-horizontal crossover, and elite opposition-based learning to enhance exploration and convergence. For the ST subproblem, we model task scheduling as a decentralized partially observable Markov decision process (Dec-POMDP) and adopt multi-agent proximal policy optimization (MAPPO) with KL regularization and clipping for stable policy updates. A hierarchical alternating framework (with a self-attention module for traffic-feature extraction) is designed to coordinate the two timescales iteratively. Simulation results demonstrate that, compared with the baseline WOA-PPO algorithm, the proposed method increases service deployment benefits by 27.2% and reduces task scheduling costs by 38.5%.

30 January 2026 in IEEE Systems Journal
Verified
Journal Article
Closed access
SLShuai Liu
Shuai Liu
QWqianyi Wang
qianyi Wang
WLWenfeng Li
Wenfeng Li
KZKanglian Zhao
Kanglian Zhao
This article addresses the global coordination challenge of task offloading, service caching, and autonomous underwater vehicle (AUV) trajectory optimization in Marine Internet of Things (M-IoT) systems. To this end, we propose a joint alternating optimization framework driven by block coordinate descent (BCD). Specifically, a multilayer heterogeneous network architecture is constructed, comprising underwater sensor nodes (USNs), AUVs, and surface buoy nodes (BNs). To handle the strong coupling among caching, mobility, and offloading, we adopt a BCD-inspired alternating framework: an improved bat algorithm (IBA) is tailored for discrete service caching, proximal policy optimization (PPO)-based deep reinforcement learning is leveraged for adaptive trajectory planning, and a Lagrangian multiplier method is used to derive efficient offloading decisions under resource constraints. Extensive simulations show consistent gains over representative baselines in delay, energy consumption, cache hit ratio, and overall cost, while maintaining stable empirical convergence.