Han Li 0009

dblp:07/1429-9 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2025
0000-0001-8502-3794ORCID · conflict

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

Computer networks · 4 · 4 first-author · 4 since 2021
YearPublicationVenuePosition
2025 Collaborative Task Offloading and Resource Allocation in Small-Cell MEC: A Multi-Agent PPO-Based Scheme
abstract
Small-cell mobile edge computing (SE-MEC) networks amalgamate the virtues of MEC and small-cell networks, enhancing data processing capabilities of user devices (UDs). Nevertheless, time-varying wireless channels, dynamic UD requirements, and severe interference among UDs make it difficult to fully exploit the limited network resources and stably provide computing services for UDs. Therefore, efficient task offloading and resource allocation (TORA) is essential. Moreover, since multiple small cells are deployed, decentralized TORA schemes are preferred in practice. Thus, this paper aims to design distributed adaptive TORA schemes for SE-MEC networks. In pursuit of an eco-friendly design, an optimization problem is formulated to minimize the total energy consumption (TEC) of UDs subject to delay constraints. To effectively deal with network's dynamic characteristics, the reinforce learning framework is applied, where the TEC minimization problem is first modeled as a partially observable Markov decision process (POMDP), and then an efficient multi-agent proximal policy optimization (MAPPO)-based scheme is presented to solve it. In the presented scheme, each small-cell base station (SBS) serves as an agent and is capable of making TORA decisions only with its own local information. To promote collaboration among multiple agents, a global reward function is designed. A state normalization mechanism is also introduced into the presented scheme for enhancing learning performance. Simulation results show that although the proposed MAPPO-based scheme works in a distributed manner, it achieves very similar performance to the centralized one. In addition, it is demonstrated that the state normalization mechanism has a significant effect on reducing TEC.
Han Li 0009, Ke Xiong 0001, Yuping Lu, Wei Chen 0002, Pingyi Fan, Khaled Ben Letaief
IEEE Trans. Mob. Comput.1
2024 Energy-Efficient Coordinated Beamforming in Multi-Pair MISO Networks With CDI and Eavesdroppers
abstract
This paper investigates the energy-efficient coordinated beamforming design for multi-pair multiple-input single-output (MISO) networks with passive eavesdroppers. To be practical, it is assumed that only channel distribution information (CDI) of the network is known by the transmitters/sources, and the dynamic energy consumption model (DECM) is employed. In order to achieve a green network design, an energy efficiency (EE) maximization problem is formulated subjecting to the individual available power constraints, the rate outage probability constraints, and the information leakage probability constraints. To solve the formulated non-convex problem, semidefinite relaxation (SDR) and first-order lower bound are applied to transform the problem, and then an efficient algorithm is proposed based on successive convex approximation (SCA) and Dinkelbach's approaches. The proposed algorithm is theoretically proved to converge to a stationary point of the considered problem. Further, a distributed version of the proposed algorithm is designed, with which each transmitter is able to optimize its own beamforming vector with local CDI. Moreover, the computational complexities and the signaling overheads of the two developed algorithms are analyzed and compared. Simulation results show that both algorithms achieve good EE performance, and the EE performance achieved by the distributed algorithm is very similar to that achieved by the centralized one. Additionally, it is shown that similar to the conventional scenarios without eavesdroppers, the achieved system EE also has a saturation point w.r.t. the available power of the transmitters, and by employing our proposed algorithms, the network security is significantly enhanced.
Han Li 0009, Ke Xiong 0001, Yang Lu 0008, Bo Gao 0006, Pingyi Fan, Khaled Ben Letaief
IEEE Trans. Mob. Comput.1
2023 Deep Reinforcement Learning Based Task Offloading and Resource Allocation in Small Cell MEC
abstract
This paper investigates the joint optimization of the task offloading and resource allocation in small cell mobile edge computing (MEC) networks, where multiple small-cell base stations (SBSs) integrating MEC servers provide computing services for user devices (UDs) in their cells. In pursuit of green network design and also saving energy of the UDs, an optimization problem is formulated to minimize the total energy consumption of UDs subjecting to the delay constraints. Since the existing optimization schemes based on traditional optimization theory cannot adapt to the time-varying channel and highly dynamic UD requirements due to their complexity, we propose an efficient learning-enabled joint task offloading and resource allocation scheme based on proximal policy optimization (PPO) framework. Simulation results show that the total energy consumption of UDs is significantly reduced by our proposed PPO-based scheme, and also show the trade-off between the delay constraints satisfaction probability and the total energy consumption.
Han Li 0009, Ke Xiong 0001, Pingyi Fan, Khaled Ben Letaief
IPCCC1
2023 Distributed Design of Wireless Powered Fog Computing Networks With Binary Computation Offloading
abstract
This paper investigates a multi-user wireless powered fog computing (FC) network, where multiple energy-limited wireless sensor devices (WSDs) first harvest energy from a nearby hybrid access point (HAP), and then compute their tasks locally (i.e., the local computing (LC) mode) or offload the tasks to the HAP (i.e., the FC mode) via a binary offloading policy. In order to pursue the green computing network design, an optimization problem is formulated to minimize the transmit power at the HAP by jointly optimizing the time allocation ratio and the computing mode selection vector, under the energy causality constraints and the WSDs’ computing rate requirements constraints. To efficiently solve the formulated non-convex problem in a distributed manner, it is first transformed into an approximate form, and then an alternating direction method of multipliers (ADMM)-based algorithm is designed to solve the transformed problem, based on which the successive convex approximation (SCA) is adopted to improve the approximating precision in an iterative way. With the proposed ADMM-based distributed algorithm, each WSD is able to optimize its computing mode and offloading time with local channel state information (CSI), which thus is more suitable for large-scale networks. For comparison, a channel-sorting-based (CSB) centralized algorithm with global CSI is also presented, and the computational complexities of the proposed ADMM-based algorithm and the CSB algorithm are analyzed. Simulation results show that the proposed distributed algorithm achieves a comparable performance with the CSB centralized algorithm and the exhaustive search method. It is also observed that to minimize the transmit power at the HAP, the WSDs with the better channel quality are inclined to select the LC mode, which is much different from traditional sum-computation-rate maximization design.
Han Li 0009, Ke Xiong 0001, Yang Lu 0008, Bo Gao 0006, Pingyi Fan, Khaled Ben Letaief
IEEE Trans. Mob. Comput.1