An Du

dblp:284/5311 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
10since 2021 · last 2026
—ORCID · conflict

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

Computer networks · 5 · 1 first-author · 5 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021Software engineering, systems software and programming languages · 2 · 2 first-author · 2 since 2021
YearPublicationVenuePosition
2026 FLISC$^{3}$3: Federated Learning-Oriented Resource Optimization in ISCC-Enabled Edge Collaborative Networks
abstract
Federated edge learning (FEEL) greatly facilitates the development of ubiquitous intelligence by combining federated learning and edge computing. However, traditional FEEL implementations assume fixed-sized local datasets, neglecting the potential of edge devices to acquire sensory information actively. Such a simplistic scenario leads to overestimating data availability and underestimating resource utilization in networks with varying resource capacity. Moreover, the existing FEEL-oriented systems with integrated sensing, communication, and computation (ISCC) have separate-based designs, leading to an inefficient use of wireless resources. To alleviate these issues, we propose a novel FEEL-oriented ISCC framework in edge collaborative networks, by leveraging the integrated sensing and communication (ISAC) technique to achieve the dual purpose of data sensing and parameter transmission. Then, over the designed framework, we present FEEL convergence analysis under non-independent and identically distributed (non-iid) and iid data. Correspondingly, we formulate a joint beamforming and flexible time duration optimization problem to maximize the convergence speed of FEEL, subject to limited resources on the devices and requirements for data sensing and communication. To address the problem efficiently, we propose an alternative optimization framework, in which the successive convex approximation (SCA) method is adopted to solve the nonconvex beamforming design subproblem, and a low-complexity method is derived for optimal time allocation. Extensive results reveal that the proposed framework can achieve excellent performance in model training accuracy by efficiently utilizing limited resources in edge collaborative networks, under iid and non-iid data.
An Du, Jie Jia 0001, Schahram Dustdar, Andrea Morichetta 0002, Jian Chen 0008, Xingwei Wang 0001
IEEE Trans. Serv. Comput.1
2025 Joint scheduling and routing for end-to-end deterministic transmission in TSN
Jie Jia 0001, Yiyue Zhang, Jian Chen 0008, An Du, Xingwei Wang 0001
Peer Peer Netw. Appl.5
2025 Online Service Placement, Task Scheduling, and Resource Allocation in Hierarchical Collaborative MEC Systems
abstract
Mobile edge computing (MEC) pushes cloud computing capabilities to the network edge, which provides real-time processing and caching flexibility for service-based applications. Conventionally, the individual node solution is insufficient to tackle the increasing computation workload and provide diverse services, especially for unpredictable spatiotemporal service request patterns. To address this, we first propose a hierarchical collaborative computing (HCC) framework to serve users’ demands by reaping sufficient computing capability in Cloud, ubiquitous service area in edge layer, and idle resources in device layer. To better unleash the benefits of HCC and pursue long-term performance, we investigate heterogeneity-aware resource management by collaborative service placement, task scheduling, and resource allocation both in-node and cross-node. We then propose an online optimization framework that first decouples the decisions across different slots. For each instant mixed integer non-linear programming problem, we introduce the surrogate Lagrangian relaxation method to reduce complexity and design hybrid numerical techniques to solve the subproblems. Theoretical analysis and extensive simulation results demonstrate the efficiency of the HCC framework in decreasing system cost on devices, and our proposed algorithms can effectively utilize the resources in the collaborative space to achieve the trade-off between system cost minimization and service placement cost stability.
An Du, Jie Jia 0001, Schahram Dustdar, Jian Chen 0008, Xingwei Wang 0001
IEEE Trans. Serv. Comput.1
2024 Online two-timescale service placement for time-sensitive applications in MEC-assisted network: A TMAGRL approach
An Du, Jie Jia 0001, Jian Chen 0008, Liang Guo 0018, Xingwei Wang 0001
Comput. Networks1
2024 DE-based resource allocation for D2D-assisted NOMA systems
Jie Jia 0001, Quanzhen Tian, An Du, Jian Chen 0008, Xingwei Wang 0001
Soft Comput.3
2024 Compressive sensing based indoor localization fingerprint collection and construction
Jie Jia 0001, Haowen Guan, Jian Chen 0008, Leyou Yang, An Du, Xingwei Wang 0016
Wirel. Networks5
2023 Reinforcement learning based joint trajectory design and resource allocation for RIS-aided UAV multicast networks
Pengshuo Ji, Jie Jia 0001, Jian Chen 0008, Liang Guo 0018, An Du, Xingwei Wang 0001
Comput. Networks5
2023 Deep reinforcement learning empowered joint mode selection and resource allocation for RIS-aided D2D communications
Liang Guo 0018, Jie Jia 0001, Jian Chen 0008, An Du, Xingwei Wang 0001
Neural Comput. Appl.4
2023 Online resource allocation for QoE optimization in CoMP-assisted eMBMS system
Jian Chen 0008, Kaili Zhai, Jie Jia 0001, An Du, Xingwei Wang 0016
Peer Peer Netw. Appl.4
2022 Joint Task Offloading and Resource Allocation in STAR-RIS assisted NOMA System
abstract
In this paper, the joint task offloading and resource allocation are investigated for the semi-grant-free (SGF) non-orthogonal multiple access (NOMA) assisted mobile edge computing (MEC) system. Moreover, simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RIS) are deployed to improve the quality of wireless communications under the mode switching protocol. Each MU can partially or fully offload its task to the base station (BS) based on its differentiated channel conditions and computing capacity in the proposed MEC system. We formulate the joint task offloading, channel assignment, power allocation, and the RIS coefficients design problem to save energy consumption. The formulated problem is modeled from a long-term optimization perspective as a multi-agent Markov game (MG). Then, a multi-agent deep reinforcement learning (MADRL) based joint task offloading and resource allocation (JTORA) algorithm is proposed to solve the problem. The simulation results confirm that the applied SGF-NOMA scheme can significantly reduce energy consumption under a stringent latency constraint. Moreover, the effectiveness of the STAR-RIS and the proposed algorithm are confirmed.
Liang Guo 0018, Jie Jia 0001, Jian Chen 0008, An Du, Xingwei Wang 0001
VTC Fall4