Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Long Chen has a total of 84 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • HARBOR: Harnessing Bandwidth, Computation, and Batch for Fair QoE Having Collaborative Edge-AI Services in Industrial CPS

    by Long Chen, Shaojie Zheng, Jigang Wu, Hong-Ning Dai, Dusit Niyato, Jiafu Wan, Jiale Huang

    Inadequate resource coordination and control can result in poor quality of experience (QoE) for user devices in heterogeneous edge-enabled cyber-physical systems. Unfortunately, in a cooperative edge network, existing studies have rarely jointly optimized communication, computing resources, and batch size for QoE guarantee when controlling task offloading. To this end, we investigate the problem of harnessing bandwidth, computation, and batch size for fair quality of experience (HARBOR) in a practical collaborative edge-AI environment, where UEs have different accuracy requirements of inference services and edge devices possess different batch processing capabilities. Specifically, we introduce the task completion efficiency as the task-completion-time-to-deadline ratio to quantify individual QoE. Then, we formulate the problem HARBOR as a mixed integer nonlinear programming with constraints of accuracy, bandwidth, computation, task hard deadlines and so on. The objective is to minimize the maximum task completion efficiency among all tasks to achieve task-level fairness. After providing the NP-hardness proof for HARBOR, we then devise an efficient scheme named e-HARBOR with a competitive ratio guarantee, to solve the decoupled sub-problems of HARBOR with calibrated long short-term memory network for resource prediction. Both testbed and simulation experiments evidently demonstrate that the proposed scheme works efficiently and scales well compared to baselines.


  • D-SPAC: Double-Sided Preference-Aware Carpooling of Private Cars for Maximizing Passenger Utility

    by Long Chen, Hong-Ning Dai, Xingyi Yuan, Jiale Huang, Yalan Wu, Jigang Wu

    Private car-based carpooling (PCC) has become an important transportation mode in our daily life. Unlike ride-hailing or taxi-based carpooling, PCC has two unique features that have yet to be fully explored: (i) A private-car driver has more bargaining space than a non-private car driver; (ii) There exists unfriendly congestion in private car-based carpooling if not handled well. Existing carpooling schemes are not tailored for PCC services with an oversimplified assumption that passengers pay detour fees and there is no guarantee on the passenger’s travel time. Consequently, such limitations not only harm the passenger’s carpooling incentive but also hurt the passenger’s quality of experience as well as the driver’s utility. We propose a novel framework for the double-sided preference-aware carpooling (D-SPAC) problem, after comprehensively addressing the above two unique features. We formulate the D-SPAC problem as a mixed-integer non-linear programming problem, which is proved to be NP-hard, to maximize the total utility of passengers while meeting the driver’s buyout asking price, traversal radius, passenger’s waiting time, budget and both sides’ detour length constraints. We design a coalitional double auction-based scheme that can better motivate both sides with guaranteed economic properties. We further design a deep reinforcement learning algorithm to cope with the position dynamics and the changing user requests. Extensive experimental results based on real-world data sets demonstrate the effectiveness of proposed algorithms over three benchmark algorithms.


  • Share-Aware Joint Model Deployment and Task Offloading for Multi-Task Inference

    by Yalan Wu, Jigang Wu, Long Chen, Bosheng Liu, Mianyang Yao, Siew Kei Lam

    In vehicular edge computing, efficient strategies for model deployment and task offloading offer tremendous potential to reduce response time for machine learning inference. However, existing works do not pay much attention to that there are shared structures among different types of inference tasks. This limits the improvement in response time. This paper aims to fill this gap by investigating a share-aware joint model deployment and task offloading problem for multi-task inference in vehicular edge computing. We formulate the problem with an objective to minimize the total response time of all inference requests, under constraints of per task response time, per roadside unit storage capacity, etc. We prove that the formulated problem is NP-hard. To solve the problem, a time period aware algorithm, called TPA, is proposed with guaranteed approximation ratio. In TPA, an iterative approach is designed to solve the problem of maximizing system throughput during a certain time period. Then, the certain time period approximates to the minimum time period of completing all requests. The algorithms are evaluated in the environment comprising two CPUs, two GPUs, state-of-the-art multi-task learning models and the dataset of Google cluster-usage trace. Simulation results derived from this environment show that, the proposed TPA outperforms the state-of-the-art methods for all cases, in terms of the total response time of all requests. For example, TPA can significantly reduce the total response time by at least $73.72\%$ for different numbers of RSUs considered, compared with state-of-the-art methods.


  • Data Collection Algorithms for Model Training in Internet of Vehicles

    by Yifei Sun, Jigang Wu, Yalan Wu, Long Chen, Weijun Sun, Yidong Li

    In Internet of Vehicles (IoV), it is critical to collect sufficient data for model training, to support vehicular intelligent applications. However, the environment of IoV is highly dynamic due to the mobility of vehicles, making it challenging to efficiently allocate resources for data collection. Additionally, timely training of machine learning models with collected data is important for accurate representation in a constantly changing environment. This article aims to improve the performance of model training by collecting sufficient data from vehicles in IoV. A system throughput maximization problem is formulated under the limited bandwidth, storage, and computing resources, which is an NP-hard problem. To solve the problem, an iterative algorithm, namely, the iterative algorithm based on approaching minimum bandwidth (IAMB), is proposed to preferentially collect data from the vehicles with sufficient data and reliable communication quality. Besides, a genetic algorithm, namely, the genetic algorithm based on approaching minimum bandwidth (GAMB), is proposed to further improve the probability of superior individual by replacing operation. We also customize three greedy strategy-based algorithms as the baselines. Extensive experimental results show that our proposed algorithms outperform the baseline algorithms for all cases. Specifically, IAMB and GAMB can improve the throughput by up to 5% and 8%, respectively, compared with baseline algorithms. In addition, the customized genetic algorithm is also superior to the iterative algorithm on performance of system throughput. Moreover, the customized genetic algorithm is more stable than the proposed iterative algorithm in terms of system throughput for model training in the dynamic network environment.


  • Resource and Fairness-Aware Digital Twin Service Caching and Request Routing With Edge Collaboration

    by Long Chen, Shaojie Zheng, Yalan Wu, Hong-Ning Dai, Jigang Wu

    Intelligent edge services should consider not only service provider’s resource constraints but also end user’s quality of experience (QoE) demands. In this regard, we study a digital twin service caching and request routing problem with consideration of both resource and fairness-awareness under the collaboration of multi-access edge computing (MEC) servers. We first formulate the problem as an integer nonlinear programming by maximizing the minimum task completion ratio when there are multiple heterogeneous digital twin services, subject to computation, storage, and heterogeneous task delay constraints. Then, we propose an online stochastic randomized rounding algorithm (ORA) and an efficient online greedy algorithm (OGA) to solve the formulated problem. Extensive simulation results demonstrate the effectiveness of the proposed ORA and OGA algorithms in terms of the minimum application completion ratio.


  • Joint Dataset Reconstruction and Power Control for Distributed Training in D2D Edge Network

    by Jiaxin Wu, Jigang Wu, Long Chen, Yifei Sun, Yalan Wu

    The intrinsic nature of non-independent and identically distributed datasets on heterogeneous devices slows down the distributed model training process and reduces the training accuracy. To settle this problem, we propose a dataset reconstruction scheme to transform the data distribution of training device’s dataset into independent and identically distributed dataset via data exchange among trusted devices. For energy efficiency, we further consider power control for the devices. We then formulate an optimization problem, which is a mixed integer non-linear programming problem, to minimize the total energy consumption for each round of distributed training. Due to the NP-hardness and coupling property of the optimization problem, we decompose it into two subproblems for dataset reconstruction and power control, respectively. An approximation algorithm is designed to obtain a near-optimal auxiliary devices set for dataset reconstruction with minimum energy consumption, while meeting the variance constraint of the optimization problem. We prove that approximation algorithm has a worst-case approximation ratio of 1+ln|Ωi(t)|, where |Ωi(t)| is the required data samples for dataset reconstruction of each training device. For power control, we design a dynamic programming algorithm to further reduce the energy consumption. For comparison, we propose three benchmark schemes that adopt either one of the algorithms or neither. We also customize three baseline algorithms based on the state-of-the-arts to compare with our proposed algorithm. Numerical results show that, our proposed algorithm outperforms three benchmarks on the average energy consumption for one round for different cases. When varying the labels that each device owns, our proposed algorithm outperforms the other three baseline algorithms on training accuracy. Besides, when setting a target accuracy, our proposed algorithm always has the lowest energy consumption.

  • Two-Level Scheduling Algorithms for Deep Neural Network Inference in Vehicular Networks

    by Yalan Wu, Jigang Wu, Mianyang Yao, Bosheng Liu, Long Chen, Siew Kei Lam

    In vehicular networks, task scheduling at the microarchitecture-level and network-level offers tremendous potential to improve the quality of computing services for deep neural network (DNN) inference. However, existing task scheduling works only focus on either one of the two levels, which results in inefficient utilization of computing resources. This paper aims to fill this gap by formulating a two-level scheduling problem for DNN inference tasks in a vehicular network, with an objective of minimizing total weighted sum of response time and energy consumption for all tasks under the following constraints: per task response time, per vehicle energy consumption, per vehicle storage capacity. We first formulate the problem and prove that it is NP-hard. A group transformation based algorithm, called GTA, is proposed. GTA makes scheduling decisions at the network-level using the group transformation based approach, and at the microarchitecture-level using a greedy strategy. In addition, an algorithm, denoted as DRL, is proposed to decrease total weighted sum of response time and energy consumption for all tasks. DRL trains two models with deep reinforcement learning to achieve two-level scheduling. The proposed algorithms are evaluated on a platform consisting of a desktop, Raspberry Pi, Eyeriss, OSM, SUMO, NS-3. Simulation results show that DRL outperforms the state-of-the-art methods for all cases, while the proposed GTA outperforms the state-of-the-art methods for most cases, in terms of total weighted sum of response time and energy consumption. Compared with four baseline algorithms, GTA and DRL reduce the total weighted sum of response time and energy consumption by $41.49\%$ and $62.38\%$ , on average respectively, for different numbers of tasks.


  • Energy-efficient cooperative offloading for mobile edge computing

    by Wenjun Shi, Jigang Wu, Long Chen, Xinxiang Zhang, Huaiguang Wu


  • Open Access

    EECDN: Energy-efficient Cooperative DNN Edge Inference in Wireless Sensor Networks

    by Long Chen, Mianyang Yao, Yalan Wu, Jigang Wu

    Multi-access edge computing (MEC) is emerging to improve the quality of experience of mobile devices including internet of things sensors by offloading computing intensive tasks to MEC servers. Existing MEC-enabled cooperative computation offloading works focus on the optimization of total energy consumption but fail to exploit multi-relay diversity and min-max fairness of energy consumption on participated sensors. We explore a typical wireless sensor network with multi-source, multi-relay, and one edge server, where relay nodes can provide both cooperative communication and computation services. We divide the energy efficiency optimization problem into two sub-problems: One is to minimize the weighted average total energy consumption per time slot, and the other is to minimize the maximum weighted energy consumption. For the first sub-problem, we propose an optimal algorithm named as optimal weighted average total energy consumption algorithm (OTCA) based on bipartite matching. For the second sub-problem, greedy algorithm for fairness guarantee (GAF) is proposed with an approximation ratio of (1 + ε), where ε is a small positive constant. Extensive numerical results show that OTCA outperforms the baseline algorithms by 26.7–77.4% on the average total weighted energy consumption while GAF outperforms benchmark algorithms by 30.7–84.4%. NS-3 simulation experiments comply with numerical results.