Shuyang Li

Mr. Shuyang Li

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
30 August 2021 in IEEE Access
Verified
Journal Article
Open access
SLShuyang Li
Shuyang Li
XHXiaohui Hu
Xiaohui Hu
YDYongwen Du
Yongwen Du
As a promising paradigm, computation offloading technology can offload computing tasks to multi-access edge computing (MEC) servers, which is an appealing choice for resource-constrained terminal devices to reduce their computational effort. However, due to limited resources, one crucial research challenge for computation offloading is to design the appropriate offloading policy to determine which tasks should be offloaded in some complex circumstances. In this paper, we study the offloading decision problem in a software-defined networking (SDN) driven MEC environment with multiple users and multiple servers. To ensure that end-users do not abuse the computing resources in the MEC system, we formulate the profit of MEC servers as our optimization objective. We jointly optimize the selection of MEC servers, the size of offloading data, and the price of MEC computing service to maximize the profit of MEC servers. However, considering the dynamic and stochastic of end-users, it is challenging to obtain the optimal policy in such a MEC environment. We apply deep reinforcement learning (DRL) and Game theory to our proposed approach. Specifically, we propose a proximal policy optimization (PPO) reinforcement learning framework to tackle the selection of MEC servers. Secondly, a two-step optimization problem is formulated to determine the size of offloading data and the pricing of computing services. The optimal values of those two were determined by achieving the Nash equilibrium of the strategy game between end-users. Extensive simulation results prove that our proposal has a better performance than existing solutions in convergence time and stability.

29 September 2021 in Sensors
Verified
Journal Article
Open access
PDF file
SLShuyang Li
Shuyang Li
XHXiaohui Hu
Xiaohui Hu
YDYongwen Du
Yongwen Du
Computation offloading technology extends cloud computing to the edge of the access network close to users, bringing many benefits to terminal devices with limited battery and computational resources. Nevertheless, the existing computation offloading approaches are challenging to apply to specific scenarios, such as the dense distribution of end-users and the sparse distribution of network infrastructure. The technological revolution in the unmanned aerial vehicle (UAV) and chip industry has granted UAVs more computing resources and promoted the emergence of UAV-assisted mobile edge computing (MEC) technology, which could be applied to those scenarios. However, in the MEC system with multiple users and multiple servers, making reasonable offloading decisions and allocating system resources is still a severe challenge. This paper studies the offloading decision and resource allocation problem in the UAV-assisted MEC environment with multiple users and servers. To ensure the quality of service for end-users, we set the weighted total cost of delay, energy consumption, and the size of discarded tasks as our optimization objective. We further formulate the joint optimization problem as a Markov decision process and apply the soft actor–critic (SAC) deep reinforcement learning algorithm to optimize the offloading policy. Numerical simulation results show that the offloading policy optimized by our proposed SAC-based dynamic computing offloading (SACDCO) algorithm effectively reduces the delay, energy consumption, and size of discarded tasks for the UAV-assisted MEC system. Compared with the fixed local-UAV scheme in the specific simulation setting, our proposed approach reduces system delay and energy consumption by approximately 50% and 200%, respectively.

17 May 2024 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
SLShuyang Li
Shuyang Li
QWQiang Wu
Qiang Wu
RWRan Wang
Ran Wang
Satellite-terrestrial integrated networks (STNs) are considered a promising architecture for 6G networks due to their ability to provide ubiquitous, high-capacity coverage on a global scale by combining satellite and terrestrial network infrastructures. However, the complex network architecture, time-varying topology, and frequent inter-satellite connection handovers present significant challenges for developing efficient routing and service continuity in STNs. To overcome these challenges, we propose Dyna-STN, a dynamic discrete topology-oriented wide-area routing mechanism in this paper. Dyna-STN utilizes a dynamic discrete topology model to characterize the time-varying topology of satellite networks. Furthermore, a hierarchical framework is established within the management plane to implement Dyna-STN, which comprises a dynamic discrete topology management plane and a routing management plane. A virtual overlay network composed of fixed virtual nodes shields the dynamics of satellite networks, while the open shortest path first protocol (OSPF) is deployed within the virtual overlay network to exchange routing reachability information among virtual nodes. Additionally, Dyna-STN performs dynamic binding and service migration between different satellite entities at specific time slots, thereby maintaining the continuity of virtual node services. Extensive numerical results demonstrate that Dyna-STN outperforms several baseline schemes in terms of routing protocol performance, packet forwarding performance, and service continuity. Furthermore, Dyna-STN maintains stable performance as the network scale increases and supports reliable data transmission among terminal devices in STNs.

7 July 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
SLShuyang Li
Shuyang Li
QWQiang Wu
Qiang Wu
RWRan Wang
Ran Wang
LCLong Chen
Long Chen
HZHongke Zhang
Hongke Zhang
Low Earth orbit satellite networks (LSNs) are envisioned as key enablers of 6 G by offering ubiquitous, low-latency connectivity. Their mesh topology enables multipath differential routing, which improves bandwidth utilization and reduces transmission delay. However, the growing demand for data and the dynamic, self-organizing nature of LSNs pose significant challenges for joint multipath routing and traffic scheduling under strict latency and energy constraints. To address these challenges, this paper proposes a multipath routing optimization (MRO) and traffic scheduling method tailored for multipath differential routing. Specifically, a dynamic multi-attribute graph model is developed to precisely capture the dynamic properties of LSNs. Building on this model, a MRO algorithm, integrated with a Stackelberg game framework, is introduced. The MRO algorithm employs a decomposition-based approach to identify multiple optimal paths that minimize delay and energy consumption, while the Stackelberg game framework ensures efficient traffic distribution across these paths. Numerical results demonstrate that the proposed approach significantly outperforms existing baseline methods, achieving cumulative reward improvements of 26.77% to 43.8% across four real-world network topologies and exhibiting better Pareto front coverage. Furthermore, by leveraging the rapid convergence properties of the Stackelberg game model, the proposed method enhances network throughput by 12% to 43% and reduces transmission time by 14% to 49%.

16 September 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SLShuyang Li
Shuyang Li
GWGuanchen Wu
Guanchen Wu
QWQiang Wu
Qiang Wu
RWRan Wang
Ran Wang
HZHongke Zhang
Hongke Zhang
Low Earth orbit (LEO) satellite networks enhance terrestrial connectivity by providing global coverage and low-latency communication. However, their highly dynamic topology, time-varying propagation delays, and constrained bandwidth severely limit the efficiency of conventional centralized routing, underscoring the necessity for adaptive and distributed strategies that can operate effectively under partial observability. Multiagent reinforcement learning (MARL) offers a promising foundation for such strategies by enabling decentralized, context-aware decision-making based on local information. Nevertheless, existing MARL-based routing approaches often struggle to maintain accurate congestion awareness, reconcile conflicting objectives, and ensure stable convergence in large-scale LEO constellations. To address these challenges, we present pareto-optimal multi-agent proximal policy optimization packet routing framework (POMAP), a packet routing framework that integrates Pareto optimization with multiagent proximal policy optimization (MAPPO) to achieve efficient and stable tradeoffs across multiple key performance metrics. Specifically, we propose a dynamic multiattribute graph model for LEO satellite networks that simultaneously captures communication delay and energy consumption. Within this framework, each satellite node is represented as a G/G/1/K queue equipped with active queue management (AQM) and scheduled using weighted priority queueing (WPQ), thereby enabling precise characterization and control of packet queueing behavior. We formulate the packet routing problem as a partially observable Markov decision process (POMDP) that jointly minimizes delay, energy consumption, and packet loss rate, and apply MAPPO to optimize the resulting policy. Extensive simulations on realistic satellite network topologies demonstrate that the proposed method achieves better convergence stability, improves Pareto front coverage, and enhances overall network performance compared with the state-of-the-art baselines.

2 April 2025 in Information Processing & Management
Verified
Journal Article
Closed access
XZXiquan Zhang
Xiquan Zhang
JDJianwu Dang
Jianwu Dang
YWYangping Wang
Yangping Wang
SLShuyang Li
Shuyang Li