Yuxuan Yang 0002

dblp:171/1862-2 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2024
0009-0004-0906-7292ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 4 since 2021
YearPublicationVenuePosition
2024 Computational Rate Maximization for IRS-Assisted Multiantenna WP-MEC Systems With Finite Edge Computing Capability
abstract
The progressing development of Internet of Things (IoT) has accelerated the emergence of resource-intensive and latency-sensitive mobile applications, which throws out a great challenge to the battery-powered wireless devices (WDs) with low-computing capabilities. To solve this intractable issue, we investigate an intelligent reflecting surface (IRS)-assisted multiantenna wireless-powered mobile edge computing (WP-MEC) system, in which WDs first harvest wireless energy emitted by a hybrid access point (HAP), then offload their tasks to the edge server, and finally download the results. In consideration of the practical scenarios, the finite computing capability of edge server and the nonlinear end-to-end power conversion of energy harvesting (EH) circuits at WDs are considered. In addition, an IRS is deployed to improve the efficiency of wireless power transfer (WPT) and the rate of data transmission between HAP and WDs. Under this setup, both space division multiple access (SDMA) and time division multiple access (TDMA) protocols are exploited and evaluated for data transmission. For each protocol, we maximize the computational rate by jointly optimizing time allocation, beamforming designs of HAP and IRS, as well as offloading strategies of WDs. To solve the problem formulated under the SDMA protocol, we propose an efficient alternating optimization (AO) algorithm. For the problem under the TDMA protocol, an AO algorithm with low complexity is proposed. Numerical results demonstrate the high effectiveness of the proposed algorithms and the superiority of the SDMA protocol over the TDMA protocol.
Yuxuan Yang 0002, Jie Jiang 0019, Bin Lyu, Zhen Yang 0001, Abbas Jamalipour
IEEE Internet Things J.2
2024 Movable-Antenna-Enhanced Wireless-Powered Mobile-Edge Computing Systems
abstract
In this article, we propose a movable antenna (MA)-enhanced scheme for wireless-powered mobile-edge computing (WP-MEC) system, where the hybrid access point (HAP) equipped with multiple MAs first emits wireless energy to charge wireless devices (WDs), and then receives the offloaded tasks from the WDs for edge computing. The MAs deployed at the HAP enhance the spatial Degrees of Freedom (DoFs) by flexibly adjusting the positions of MAs within an available region, thereby improving the efficiency of both downlink wireless energy transfer (WPT) and uplink task offloading. To balance the performance enhancement against the implementation intricacy, we further propose three types of MA positioning configurations, i.e., dynamic MA positioning, semidynamic MA positioning, and static MA positioning. In addition, the nonlinear power conversion of energy harvesting (EH) circuits at the WDs and the finite computing capability at the edge server are taken into account. Our objective is to maximize the sum computational rate (SCR) by jointly optimizing the time allocation, positions of MAs, energy beamforming matrix, receive combing vectors, and offloading strategies of WDs. To solve the nonconvex problems, efficient alternating optimization (AO) frameworks are proposed. Moreover, we propose a hybrid algorithm of particle swarm optimization with variable local search (PSO-VLS) to solve the subproblem of MA positioning. Numerical results validate the superiority of exploiting MAs over the fixed-position antennas (FPAs) for enhancing the SCR performance of WP-MEC systems.
Yuxuan Yang 0002, Bin Lyu, Zhen Yang 0001, Abbas Jamalipour
IEEE Internet Things J.2
2024 Multi-Agent Deep Reinforcement Learning Based UAV Trajectory Optimization for Differentiated Services
abstract
Driven by the increasing computational demand of real-time mobile applications, Unmanned Aerial Vehicle (UAV) assisted Multi-access Edge Computing (MEC) has been envisioned as a promising paradigm for pushing computational resources to network edges and constructing high-throughput line-of-sight links for ground users. Most exsiting studies consider simplified scenarios, such as a single UAV, Service Provider (SP) or service type, and centralized UAV trajectory control. In order to be more in line with real-world cases, we intend to achieve distributed trajectory control of multiple UAVs in UAV-assisted MEC networks with multiple SPs providing differentiated services. Our objective is to minimize the short-term computational costs of ground users and the long-term computational cost of UAVs, simultaneously based on incomplete information. We first solve the formulated problem by reaching the Nash Equilibrium (NE) of the game among SPs based on complete information. We further formulate a Markov game model and propose a Deep Reinforcement Learning (DRL)-based UAV trajectory optimization algorithm, where only local observations of each UAV are required for each SP's flying action execution. Theoretical analysis and performance evaluation demonstrate the convergence, efficiency, scalability, and robustness of our algorithm compared with other representative algorithms.
Zhaolong Ning, Yuxuan Yang 0002, Xiaojie Wang 0001, Qingyang Song, Lei Guo 0005, Abbas Jamalipour
IEEE Trans. Mob. Comput.2
2023 Dynamic Computation Offloading and Server Deployment for UAV-Enabled Multi-Access Edge Computing
abstract
Driven by the increasing demand of real-time mobile application processing, Multi-access Edge Computing (MEC) has been envisioned as a promising paradigm for pushing computational resources to network edges. In this paper, we investigate an MEC network enabled by Unmanned Aerial Vehicles (UAV), and consider both the multi-user computation offloading and edge server deployment to minimize the system-wide computation cost under dynamic environment, where users generate tasks according to time-varying probabilities. We decompose the minimization problem by formulating two stochastic games for multi-user computation offloading and edge server deployment respectively, and prove that each formulated stochastic game has at least one Nash Equilibrium (NE). Two learning algorithms are proposed to reach the NEs with polynomial-time computational complexities. We further incorporate these two algorithms into a chess-like asynchronous updating algorithm to solve the system-wide computation cost minimization problem. Finally, performance evaluations based on real-world data are conducted and analyzed, corroborating that the proposed algorithms can achieve efficient computation offloading coupled with proper server deployment under dynamic environment for multiple users and MEC servers.
Zhaolong Ning, Yuxuan Yang 0002, Xiaojie Wang 0001, Lei Guo 0005, Xinbo Gao 0001, Song Guo 0001, Guoyin Wang 0001
IEEE Trans. Mob. Comput.2