Dacheng He

dblp:140/1051 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
6since 2021 · last 2026
0000-0001-7739-7163ORCID · corroborated

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

Systems, architecture and hardware · 3 · 3 since 2021Computer networks · 3 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 StarCPFL: Star-Centric Personalized Federated Learning with layer-wised clustering
Wei Liang 0005, Dacheng He, Kuanching Li, Kim Fung Tsang
Future Gener. Comput. Syst.4
2025 MCDS: An Effective Multi-UAV Collaborative Decision-Making System in Mobile-Edge Computing Networks
abstract
Mobile Edge Computing (MEC) pushes computing resources from the network center to the network edge to provide efficient and reliable computing services. However, due to the mobility and diversity of mobile users (MUs), edge servers (ESs) are likely to be overloaded, which leads to a rapid decline in the quality of service provided by the MEC system. This paper introduces unmanned aerial vehicles (UAVs) to solve the problem of ES overload. This paper presents an effective Multi-UAV Collaborative Decision-Making System (MCDS) tailored to optimize task offloading and resource allocation in MEC networks. The proposed system seeks to reduce task computing delays and energy consumption while guaranteeing timely task completion and compliance with resource constraints. We design a distributed two-stage optimization algorithm to jointly optimize the task offloading decision and resource allocation of the collaborative computing system (UAVs, ESs, and MUs). To address the flight cooperation problem of multi-UAVs, we also proposed a task-aware scheduling algorithm for multi-UAVs. In addition, we conducted a large number of simulation experiments. Experimental results show that our two-stage optimization scheme is lower than other benchmark algorithms in terms of task completion delay, energy consumption and total cost of objective function. Specifically, compared with seven baseline algorithms under three different system setting scenarios, our algorithm reduces the total cost by an average of 38.79%, the energy consumption by an average of 40.70%, and the delay by an average of 15.67%.
Naixue Xiong, Weiyu Zhong, Dacheng He, Linshu Chen, Wei Liang 0005
IEEE Internet Things J.4
2025 PHFL: a federated learning framework based on a hybrid mechanism
Wei Liang 0005, Dacheng He, Kuanching Li, Mirjana Ivanovic
J. Supercomput.4
2025 N-Lock: a transaction-released shard reconfiguration protocol with zero-knowledge proof
Nengxiang Xu, Wei Liang 0005, Dacheng He, Kuanching Li, Nam Ling
J. Supercomput.4
2022 Data Fusion Approach for Collaborative Anomaly Intrusion Detection in Blockchain-Based Systems
abstract
Blockchain technology is rapidly changing the transaction behavior and efficiency of businesses in recent years. Data privacy and system reliability are critical issues that is highly required to be addressed in Blockchain environments. However, anomaly intrusion poses a significant threat to a Blockchain, and therefore, it is proposed in this article a collaborative clustering-characteristic-based data fusion approach for intrusion detection in a Blockchain-based system, where a mathematical model of data fusion is designed and an AI model is used to train and analyze data clusters in Blockchain networks. The abnormal characteristics in a Blockchain data set are identified, a weighted combination is carried out, and the weighted coefficients among several nodes are obtained after multiple rounds of mutual competition among clustering nodes. When the weighted coefficient and a similarity matching relationship follow a standard pattern, an abnormal intrusion behavior is accurately and collaboratively detected. Experimental results show that the proposed algorithm has high recognition accuracy and promising performance in the real-time detection of attacks in a Blockchain.
Wei Liang 0005, Mingdong Tang, Dacheng He, Kuanching Li
IEEE Internet Things J.5
2021 An efficient and DoS-resilient name lookup for NDN interest forwarding
abstract
As a novel Internet architecture focused on data contents, Named Data Networking (NDN) has been proven to be of great value in supporting the Internet of Things, Edge computing, Blockchain, and other popular topics. They can benefit mainly from NDN's intrinsic properties, such as flexible multicasting, in-network caching, among several others. However, once NDN's forwarding plane suffers Denial of Service (DoS) attacks, the overall system performance would be affected significantly. In NDN data transmission, interest forwarding is the most time-consuming operation and thus opens a possible vector of DoS attacks. It is proposed in this paper a fast name lookup algorithm for NDN interest forwarding, which selects feature prefixes instead of lengths to filter out interest packets in NDN interest forwarding. Due to the excellent filtration with feature prefixes, the algorithm accelerates NDN forwarding processes. Compared with other existing solutions, the proposed algorithm shows more than 70% of time improvement in forwarding malicious interests, while remaining at the same performance level in standard cases.
Dacheng He, Da-Fang Zhang 0001, Yanbiao Li 0001, Wei Liang 0005, Meng-Yen Hsieh
Connect. Sci.1
2014 A memory-efficient parallel routing lookup model with fast updates
Yanbiao Li 0001, Da-Fang Zhang 0001, Kun Huang 0003, Dacheng He, Weiping Long
Comput. Commun.4