Jie Zhao

Jie Zhao

Auto-generated profile, based on publicly available information

Jie Zhao

School of Computer Science and engineering, Central South University, Changsha, 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
18 November 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YCYing Chen
Ying Chen
JZJie Zhao
Jie Zhao
YWYuan Wu
Yuan Wu
JHJiwei Huang
Jiwei Huang
XSXuemin Shen
Xuemin Shen
Due to the limited computing resource and battery capability at the mobile devices, the computation-intensive tasks generated by mobile devices can be offloaded to edge servers or cloud for processing. In this paper, we study the multi-user task offloading problem in an end-edge-cloud system, in which all user devices compete for the limited communication and computing resources. Particularly, we first formulate the offloading problem with the goal of maximizing the Quality of Experience (QoE) of the users subject to resource constraints. Since each user focuses on maximizing its own QoE, we reformulate the problem as a Multi-User Task Offloading Game (MUTO-Game). We then identify an important property that for any device, both the communication interference and the degree of computing resource competition can be upper bounded. Based on the property, we further theoretically prove that there exists at least one Nash Equilibrium offloading strategy in the MUTO-Game. We propose the Game-based Decentralized Task Offloading (GDTO) approach to obtain the Nash Equilibrium offloading strategy. Finally, we analyze the upper bound for the convergence time and characterize the performance guarantee of the obtained offloading strategy for the worst case. A series of experimental results are presented, in comparison with both the centralized optimal approach and the approximate approaches.

10 January 2024 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
YCYing Chen
Ying Chen
JZJie Zhao
Jie Zhao
JHJintao Hu
Jintao Hu
Shaohua WanShaohua Wan
Shaohua Wan
JHJiwei Huang
Jiwei Huang
As the computing resources and the battery capacity of mobile devices are usually limited, it is a feasible solution to offload the computation-intensive tasks generated by mobile devices to edge servers (ESs) in mobile edge computing (MEC) . In this article, we study the multi-user multi-server task offloading problem in MEC systems, where all users compete for the limited communication resources and computing resources. We formulate the offloading problem with the goal of minimizing the cost of the users and maximizing the profits of the ESs. We propose a hierarchical EETORP (Economic and Efficient Task Offloading and Resource Purchasing) framework that includes a two-stage joint optimization process. Then we prove that the problem is NP-complete. For the first stage, we formulate the offloading problem as a multi-channel access game (MCA-Game) and prove theoretically the existence of at least one Nash equilibrium strategy in MCA-Game. Next, we propose a game-based multi-channel access (GMCA) algorithm to obtain the Nash equilibrium strategy and analyze the performance guarantee of the obtained offloading strategy in the worst case. For the second stage, we model the computing resource allocation between the users and ESs by Stackelberg game theory, and reformulate the problem as a resource pricing and purchasing game (PAP-Game). We prove theoretically the property of incentive compatibility and the existence of Stackelberg equilibrium. A game-based pricing and purchasing (GPAP) algorithm is proposed. Finally, a series of both parameter analysis and comparison experiments are carried out, which validate the convergence and effectiveness of the GMCA algorithm and GPAP algorithm.

24 September 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YCYing Chen
Ying Chen
JZJie Zhao
Jie Zhao
YWYuan Wu
Yuan Wu
JHJiwei Huang
Jiwei Huang
XSXuemin Sherman Shen
Xuemin Sherman Shen
Unmanned Aerial Vehicle (UAV)-assisted Low Earth Orbit (LEO) satellite edge computing (ULSE) networks can address the challenge communications issues in areas with harsh terrain and achieve global wireless coverage to provide services for mobile user devices (MUDs). This paper studies the LEO-UAV task offloading problem where MUDs compete for limited resources in the ULSE networks. We formulate the optimization problem with the goal of minimizing the cost of all MUDs while meeting resource constraint and satellite coverage time constraint. We first theoretically prove that this problem is NP-hard. We then reformulate the problem as a LEO-UAV task offloading game (LUTO-Game), and show that there is at least one Nash equilibrium solution for the LUTO-Game. We propose a joint UAV and LEO satellite task offloading (JULTO) algorithm to obtain the Nash equilibrium offloading strategy, and analyze the performance of the worst-case offloading strategy obtained by the JULTO algorithm. Finally, extensive experiments, including convergence analysis and comparison experiments, are carried out to validate the effectiveness of our JULTO algorithm.

5 July 2024 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
YGYuzhou Gao
Yuzhou Gao
JBJiarong Bao
Jiarong Bao
YWYaqi Wang
Yaqi Wang
JZJie Zhao
Jie Zhao
YCYing Chen
Ying Chen
JHJiwei Huang
Jiwei Huang
In Non-Orthogonal Multiple Access(NOMA)-enabled D2D cellular networks, geographically distributed devices compete for limited channels, making D2D pairing and channel selection a challenging but unexplored research problem. To this end, we formulate an optimization problem from the perspective of game theory with the objective of maximizing the data transmission rate while satisfying geographical and performance constraints, and theoretically prove that it is an Exact Potential Game (EPG). To find such solution, we propose an algorithm called Game-based D2D Pairing and Channel Selection(GDPCS) and prove its convergence. Also, the simulation experiments validate the effectiveness of GDPCS Algorithm and demonstrate its superior to existing state-of-the-art approaches.

18 December 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
JZJie Zhao
Jie Zhao
FLFeng Lyu
Feng Lyu
HWHao Wu
Hao Wu
FWFan Wu
Fan Wu
SLShucheng Li
Shucheng Li
The rise of vehicular edge computing (VEC) enables vehicles to offload resource-intensive tasks to roadside units (RSUs), improving efficiency and reducing latency. However, high mobility, dynamic resource availability, and heterogeneous quality-of-experience (QoE) requirements make task offloading and coordination highly challenging. In this paper, we investigate the heterogeneous task offloading problem in dynamic VEC environments by proposing a two-stage optimization framework, TOVEC. Our TOVEC decouples the spatio-temporally coupled decision space into two tractable subproblems and solves it with a two-stage design. In the first stage, we employ a TD3-based deep reinforcement learning algorithm to handle RSU-channel access decisions under dynamic network conditions. In the second stage, we formulate the interaction between vehicular users (VUs) and RSUs as a Stackelberg game, enabling joint task scheduling and dynamic pricing that balances VUs’ QoE optimization and RSUs’ revenue maximization. We theoretically prove the existence of a Stackelberg equilibrium and validate our TOVEC using real-world vehicular traces. The experimental results show that our method has improved the QoE (measured by task delay and energy cost) of VU and the benefits of RSU by 6.8%-41.3% and 2.2%-117.4%, respectively, compared with the baseline schemes.

8 October 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
JHJintao Hu
Jintao Hu
JXJiajie Xu
Jiajie Xu
JZJie Zhao
Jie Zhao
YCYing Chen
Ying Chen
JHJiwei Huang
Jiwei Huang
Urban Internet of Things (IoT) plays an extremely important role in our daily life by deploying smart cities and urban brains. Orthogonal multiple access (OMA) technology has been a commonly used communication method in recent years, but nonorthogonal multiple access (NOMA) attracts the attention of many researchers due to its superiority of successive interference cancellation (SIC) technology. We consider adding the base station (BS) and unmanned aerial vehicle (UAV) to perform collaborative data offloading services with urban IoT devices and introduce the NOMA technology to improve offloading efficiency. In order to solve the data unloading problem in this model cost-effectively, we formulate the model as a game model based on noncooperative competition and propose the iterative game-based data offloading algorithm (GDOA) to obtain the Nash equilibrium (NE) solution. Finally, we use the simulation data to conduct parametric analysis experiments and comparison experiments on GDOA to evaluate its real performance.