Yang Li

Yang Li

Auto-generated profile, based on publicly available information

Yang Li

School of Computing and Artificial Intelligence, Southwest Jiaotong University, 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
1 December 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JYJiadong Yu
Jiadong Yu
YLYang Li
Yang Li
XLXiaolan Liu
Xiaolan Liu
BSBo Sun
Bo Sun
YWYuan Wu
Yuan Wu
DTDanny Hin-Kwok Tsang
Danny Hin-Kwok Tsang
By employing powerful edge servers for data processing, mobile edge computing (MEC) has been recognized as a promising technology to support emerging computation-intensive applications. Besides, non-orthogonal multiple access (NOMA)-aided MEC system can further enhance the spectral-efficiency with massive tasks offloading. However, with more dynamic devices brought online and the uncontrollable stochastic channel environment, it is even desirable to deploy appealing technique, i.e., intelligent reflecting surfaces (IRS), in the MEC system to flexibly tune the communication environment and improve the system energy efficiency. In this paper, we investigate the joint offloading, communication and computation resource allocation for the IRS-assisted NOMA MEC system. We first formulate a mixed integer energy efficiency maximization problem with system queue stability constraint. We then propose the Lyapunov-function-based Mixed Integer Deep Deterministic Policy Gradient (LMIDDPG) algorithm which is based on the centralized reinforcement learning (RL) framework. To be specific, we design the mixed integer action space mapping which contains both continuous mapping and integer mapping. Moreover, the award function is defined as the upper-bound of the Lyapunov drift-plus-penalty function. To enable end devices (EDs) to choose actions independently at the execution stage, we further propose the Heterogeneous Multi-agent LMIDDPG (HMA-LMIDDPG) algorithm based on distributed RL framework with homogeneous EDs and heterogeneous base station (BS) as heterogeneous multi-agent. Numerical results show that our proposed algorithms can achieve superior energy efficiency performance to the benchmark algorithms while maintaining the queue stability. Specially, the distributed structure HMA-LMIDDPG can acquire more energy efficiency gain than the centralized structure LMIDDPG.

21 March 2022 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
TWTianshun Wang
Tianshun Wang
YLYang Li
Yang Li
YWYuan Wu
Yuan Wu
TQTony Q.S. Quek
Tony Q.S. Quek
Federated learning (FL) provides a promising framework for enabling distributed machine learning-based services without revealing users' private data. In the scenario of wireless FL, to encounter the eavesdropping attack when the parameter-server sends the model-data to the wireless devices, we propose a secrecy driven FL via cooperative jamming, in which wireless devices cooperatively provide jamming to the eavesdropper to enhance the PS's secure throughput based on the physical layer security. We formulate a joint optimization of the PS's downloading-transmission duration, all wireless devices' uploading-transmission duration as a non-orthogonal multiple access cluster, each device's local processing-rate and transmit-powers for its uploading NOMA-transmission and jamming to the eavesdropper, with the objective of minimizing the overall latency for each round of FL iteration. Despite the non-convexity of the joint optimization problem, a layered algorithm is proposed to solve it. Taking into account the special feature of the optimal jamming solution, we further propose a benefit-sharing scheme based on the principle of Nash bargaining solution, such that all wireless devices can benefit from reducing the FL latency via cooperative jamming in a fairness manner. Numerical results are provided to validate the effectiveness of our proposed algorithms and the advantages of our proposed secrecy-driven FL.

Verified
Journal Article
Open access
PDF file
MDMinghui Dai
Minghui Dai
YLYang Li
Yang Li
PLPeichun Li
Peichun Li
YWYuan Wu
Yuan Wu
Liping QianLiping Qian
Liping Qian
ZSZhou Su
Zhou Su
The smart ocean has been regarded as an integrated sensing, communication, and computing ecosystem developed for connecting marine objects in surface and underwater environments. The development of the smart ocean is expected to support a variety of marine applications and services such as resource exploration, marine disaster rescuing, and environment monitoring. However, the complex and dynamic marine environments and the limited network resources raise new challenges in marine communication and computing, especially for these computing-intensive and delay-sensitive tasks. Recently, the space–air–ground–sea integrated networks have been envisioned as a promising network framework to enhance the communication and computing performance. In this paper, we conduct a comprehensive survey on the integrated sensing, communication, and computing networks (ISCCNs) for smart oceans based on the collaboration of space–air–ground–sea networks from four domains (i.e., space layer, aerial layer, sea surface layer, and underwater layer), and five aspects (i.e., sensing-related, communication-related, computation-related, security-related, and application-related). Specifically, we provide the key technologies for the ISCCNs in smart oceans, and introduce the state-of-the-art marine sensing, communication, and computing paradigms. The emerging challenges with the potential solutions of the ISCCNs for smart oceans are illustrated to enable the intelligent services. Moreover, the new applications for the ISCCNs in smart oceans are discussed, and potential research directions in smart oceans are provided for future works.

23 May 2022 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
YLYang Li
Yang Li
YWYuan Wu
Yuan Wu
MDMinghui Dai
Minghui Dai
BLBin Lin
Bin Lin
WJWei Jia
Wei Jia
XSXuemin Shen
Xuemin Shen
Edge computing has been considered as a promising solution for enabling computation-intensive yet latency-sensitive applications at resource-constrained wireless devices (WDs). In this paper, exploiting the advanced small-cell dual connectivity (DC), we investigate a paradigm of dual computation offloading in which a WD can simultaneously offload partial workloads to a cloudlet-server co-located at the macro base station (MBS) and an edge-server (ES) co-located at a small-cell based station (SBS). To facilitate the multi-user dual computation offloading, we exploit a hybrid model of non-orthogonal multiple access (NOMA) and frequency division multiple access (FDMA). Specifically, due to the SBSs’ limited channel resources, we consider that the WDs form different NOMA-groups for offloading their respective workloads to different SBSs, which improves the spectrum efficiency. Meanwhile, all WDs use FDMA for offloading their workloads to the MBS, which avoids the WDs’ co-channel interference. We formulate a joint optimization of the WDs’ partial offloading decisions, their FDMA transmission to the MBS, different NOMA-groups’ transmission to the SBSs, as well as the computing-rate allocation of the ESs and the cloudlet-server, with the objective of minimizing the overall latency for completing all WDs’ workloads. Despite the strict non-convexity of the joint optimization problem, we propose a layered yet cell-based distributed algorithm for obtaining the optimal dual offloading solution. Based on the optimal dual offloading solution, we further investigate how to properly group WDs into different NOMA-groups for offloading workloads to the corresponding SBSs, and propose a cross-entropy based learning algorithm for finding the optimal NOMA grouping scheme. Numerical results are finally provided to validate the effectiveness and efficiency of our proposed algorithms.

29 May 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YLYang Li
Yang Li
CDChenglong Dou
Chenglong Dou
YWYuan Wu
Yuan Wu
WJWei Jia
Wei Jia
RLRongxing Lu
Rongxing Lu
Virtual reality (VR) provides users with an immersive and interactive experience through head-mounted devices, which has attracted increasing attention in recent years. Specifically, tile-based VR content transmission provides a promising approach to alleviate the conflict between limited bandwidth and high-performance requirements (e.g., high-resolution and low-delay). However, the tiling pattern affects the encoding efficiency and visual distortion of the VR content. Accounting for this issue, in this paper, a quality of experience (QoE)-aware cost minimization problem is investigated for a tile-based VR content transmission scenario. In particular, an edge server (ES) co-located at a cellular base station (BS) separates its generated VR content into several tiles according to the tiling pattern selection, and a weighted-to-spherically-uniform quality model is used to evaluate the effect of different tiling patterns on QoE. Moreover, to improve the transmission performance between the edge server and VR users (VRUs), unmanned aerial vehicles (UAVs) are leveraged as relay points to provide line of sight channels. Then, we formulate an optimization problem to minimize the sum of weighted total energy consumption and VR content distortion (i.e., QoE-aware cost) by jointly optimizing the tiling pattern selections, the VRUs-UAV grouping, partial computing decisions, and resource allocation. The formulated problem is a mixed integer non-linear programming problem, which is challenging to solve. To address this difficulty, we equivalently decompose the formulated problem into three subproblems and propose corresponding algorithms to solve them, respectively. Numerical results demonstrate that our proposed solution can effectively reduce the QoE-aware cost for VR content transmission in comparison with other baseline algorithms.

25 August 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YLYang Li
Yang Li
YWYuan Wu
Yuan Wu
YSYuxiao Song
Yuxiao Song
Liping QianLiping Qian
Liping Qian
WJWei Jia
Wei Jia
Federated learning (FL) has been considered as a promising paradigm for enabling distributed machine learning (ML) in wireless networks. To address the limited energy capacity of wireless devices, we propose a simultaneous wireless information and power transfer (SWIPT) aided FL, in which one FL server (FLS) co-located at a cellular base station (BS) uses SWIPT to simultaneously broadcast the global model to wireless user-devices (UDs) and provide wireless power transfer to them. The UDs then use the harvested energy to train their local models and further transmit the local models to the FLS for aggregation. To improve the spectrum efficiency, we consider that the UDs form a non-orthogonal multiple access (NOMA) group for simultaneously sending their local models over the same spectrum channel. Taking the UDs’ time-varying available energy and channel conditions into account, we propose a dynamic optimization of the UDs-scheduling, the BS's transmit-power allocation, and the UDs’ power-splitting factors for SWIPT, with the objective of minimizing the long-term energy consumption while ensuring the FL convergence. The optimization problem, however, is challenging to solve since it is a finite-horizon dynamic programming problem but with an unknown stopping time, and moreover, the action space covers both discrete and continuous variables. To address these difficulties, we first execute a series of equivalent transformations to reduce the number of decision variables and then formulate the problem as a stochastic shortest path problem, based on which we propose an actor-critic deep reinforcement learning algorithm with the proximal policy optimization to efficiently learn the policy that dynamically adjusts the UDs-scheduling for FL as well as the BS's transmit-power for SWIPT. Numerical results validate the effectiveness and performance of our proposed algorithm. The results demonstrate that our proposed algorithm can effectively reduce the long-term energy consumption in comparison with two baseline algorithms.