Zhipeng Cheng

Dr. Zhipeng Cheng

School of Future Science and Engineering, Soochow University, Suzhou, Anhui, China
orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 June 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZCZhipeng Cheng
Zhipeng Cheng
Minghui MinMinghui Min
Minghui Min
Minghui LiwangMinghui Liwang
Minghui Liwang
LHLianfen Huang
Lianfen Huang
Zhibin GaoZhibin Gao
Zhibin Gao
Fog computing is an energy-efficient and cost-effective paradigm to help alleviate the pressure of resource-constrained mobile devices (MDs) running computation-intensive applications. In this article, we investigate the joint task partitioning and power control problem in a fog computing network with multiple MDs and fog devices (FDs), where each MD has to complete a periodic computation task under the constraints of delay and energy consumption. Each task can be partitioned into multiple subtasks and offloaded to the FDs according to the task partition strategy and transmission power strategy to reduce task execution delay and energy consumption. To this end, we present a multiagent deep deterministic policy gradient (MADDPG)-based task offloading algorithm for MDs to maximize the long-term system utility including the execution delay and energy consumption. Each MD inputs the local information, e.g., the task requirements, the available communication, and computation resources of the FDs, the computation resources, and the battery level of the MD into a distributed actor network to generate a task offloading policy, while a centralized critic network is used to update the weights of the actor networks to improve offloading performance. Numerical simulation results demonstrate the effectiveness of the proposed scheme in improving the system utility, reducing the average execution delay as well as the average energy consumption.

17 June 2022 in Computer Communications
Verified
Journal Article
Closed access
ZCZhipeng Cheng
Zhipeng Cheng
MLMinghui Liwang
Minghui Liwang
NCNing Chen
Ning Chen
LHLianfen Huang
Lianfen Huang
XDXiaojiang Du
Xiaojiang Du
MGMohsen Guizani
Mohsen Guizani

9 October 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
ZCZhipeng Cheng
Zhipeng Cheng
XXXiaoyu Xia
Xiaoyu Xia
Minghui LiwangMinghui Liwang
Minghui Liwang
XFXuwei Fan
Xuwei Fan
Yanglong SunYanglong Sun
Yanglong Sun
LHLianfen Huang
Lianfen Huang
Implementing either Federated learning (FL) or split learning (SL) over clients with limited computation/communication resources faces challenges on achieving delay-efficient model training. To overcome such challenges, we investigate a novel distributed C lustering-based H ybrid f E d E rated S plit l E arning ( CHEESE ) framework, consolidating distributed resources among clients by device-to-device (D2D) communications, working in an intra-serial inter-parallel manner. In CHEESE , each learning client can form a cluster with its neighboring helping clients via D2D communications to train an FL model collaboratively. Inside each cluster, the model is split into multiple segments via a model splitting and allocation (MSA) strategy, while each cluster member trains one segment. After completing intra-cluster training, a transmission client (TC) is determined from each cluster to upload a complete model to the base station for global model aggregation under allocated bandwidth. Accordingly, an overall training delay cost minimization problem is formulated, involving the following subproblems: client clustering, MSA, TC selection, and bandwidth allocation. Due to its NP-Hardness, the problem is decoupled and solved iteratively. The client clustering problem is first transformed into a distributed clustering game based on potential game theory, where each cluster further investigates the remaining three subproblems to evaluate the utility of each clustering strategy. Specifically, a heuristic algorithm is proposed to solve the MSA problem under a given clustering strategy, while a greedy-based convex optimization approach is introduced to solve the joint TC selection and bandwidth allocation problem. Extensive experiments on practical models and datasets demonstrate that CHEESE can significantly reduce training delay costs.

8 November 2021 in IEEE Network
Verified
Journal Article
Closed access
ZCZhipeng Cheng
Zhipeng Cheng
ZGZhibin Gao
Zhibin Gao
MLMinghui Liwang
Minghui Liwang
LHLianfen Huang
Lianfen Huang
XDXiaojiang Du
Xiaojiang Du
MGMohsen Guizani
Mohsen Guizani
The arrival of big data and the Internet of Things (IoT) era greatly promotes innovative in-network computing techniques, where the edge-cloud continuum becomes a feasible paradigm in handling multi-dimensional resources such as computing, storage, and communication. In this article, an energy constrained unmanned aerial vehicle (UAV)-aided mobile edge-cloud continuum framework is introduced, where the offloaded tasks from ground IoT devices can be cooperatively executed by UAVs acts as an edge server and cloud server connected to a ground base station (GBS), which can be seen as an access point. Specifically, a UAV is powered by the laser beam transmitted from a GBS, and can further charge IoT devices wirelessly. Here, an interesting task offloading and energy allocation problem is investigated by maximizing the long-term reward subject to executed task size and execution delay, under constraints such as energy causality, task causality, and cache causality. A federated deep reinforcement learning (FDRL) framework is proposed to learn the joint task offloading and energy allocation decision while reducing the training cost and preventing privacy leakage of DRL training. Numerical simulations are conducted to verify the effectiveness of our proposed scheme as compared to three baseline schemes.

17 June 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
ZCZhipeng Cheng
Zhipeng Cheng
Minghui LiwangMinghui Liwang
Minghui Liwang
XXXiaoyu Xia
Xiaoyu Xia
Minghui MinMinghui Min
Minghui Min
Xianbin WangXianbin Wang
Xianbin Wang
Xiaojiang DuXiaojiang Du
Xiaojiang Du
Federated learning (FL) represents a promising distributed machine learning paradigm that allows smart devices to collaboratively train a shared model via providing local data sets. However, problems considering multiple co-existing FL services and different types of service providers are rarely studied. In this paper, we investigate a multiple FL service trading problem in Unmanned Aerial Vehicle (UAV)-aided networks, where FL service demanders (FLSDs) aim to purchase various data sets from feasible clients (smart devices, e.g., smartphones, smart vehicles), and model aggregation services from UAVs, to fulfill their requirements. An auction-based trading market is established to facilitate the trading among three parties, i.e., FLSDs acting as buyers, distributed located client groups acting as data-sellers, and UAVs acting as UAV-sellers. The proposed auction is formalized as a 0-1 integer programming problem, aiming to maximize the overall buyers’ revenue via investigating winner determination and payment rule design. Specifically, since two seller types (data-sellers and UAV-sellers) are considered, an interesting idea integrating seller pair and joint bid is introduced, which turns diverse sellers into virtual seller pairs. Vickrey-Clarke-Groves (VCG)-based, and one-sided matching-based mechanisms are proposed, respectively, where the former achieves the optimal solutions, which, however, is computationally intractable. While the latter can obtain suboptimal solutions that approach to the optimal ones, with low computational complexity, especially upon considering a large number of participants. Significant properties such as truthfulness and individual rationality are comprehensively analyzed for both mechanisms. Extensive experimental results verify the properties and demonstrate that our proposed mechanisms outperform representative methods significantly.

17 November 2023 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
HQHouyi Qi
Houyi Qi
Minghui LiwangMinghui Liwang
Minghui Liwang
SHSeyyedali Hosseinalipour
Seyyedali Hosseinalipour
XXXiaoyu Xia
Xiaoyu Xia
ZCZhipeng Cheng
Zhipeng Cheng
ZJZhenzhen Jiao
Zhenzhen Jiao
By opportunistically engaging mobile users (workers), mobile crowdsensing (MCS) networks have emerged as important approach to facilitate sharing of sensed/gathered data of heterogeneous mobile devices. To assign tasks among workers and ensure low overheads, we introduce a series of stable matching mechanisms, which are integrated into a novel hybrid service trading paradigm consisting of futures trading and spot trading modes, to ensure seamless MCS service provisioning. In futures trading, we determine a set of long-term workers for each task through an o verbooking-enabled i n- a dvance m any-to- m any m atching (OIA3M) mechanism, while characterizing the associated risks under statistical analysis. In spot trading, we investigate the impact of fluctuations in long-term workers' resources on the violation of service quality requirements of tasks, and formalize a spot trading mode for tasks with violated service quality requirements under practical budget constraints, where the task-worker mapping is carried out via o nsite m any-to- m any m atching (O3M) and o nsite m any-to- o ne m atching (OMOM). We theoretically show that our proposed matching mechanisms satisfy stability, individual rationality, fairness, and computational efficiency. Comprehensive evaluations confirm the satisfaction of these properties in practical network settings and demonstrate our commendable performance in terms of service quality, running time, and decision-making overheads, e.g., delay and energy consumption.