Kai Yang

Kai Yang

Auto-generated profile, based on publicly available information

Kai Yang

School of Computer, Electronics and Information, Guangxi University, Nanning, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
17 September 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
TLTing Li
Ting Li
YLYinlong Liu
Yinlong Liu
TOTao Ouyang
Tao Ouyang
HZHangsheng Zhang
Hangsheng Zhang
KYKai Yang
Kai Yang
XZXu Zhang
Xu Zhang
To bridge the gap of conventional single-hop task offloading schemes in infrastructure-free scenarios, multi-hop task offloading schemes for IoT devices in Mobile Edge Computing (MEC) are desired to jointly optimize task offloading decisions and routing paths. In this paper, we investigate a hierarchical multi-hop edge computing framework and propose a joint Task Offloading and Relay Selection (TORS) scheme. It considers real-time computation at each relay node and employs directional searches to facilitate the task execution and results reporting at the fastest speed. However, finding the optimal TORS solution is a formidable challenge due to the time-varying network environments, the strong interdependence of decision sets across different time slots, and the high computational complexity. To address these challenges, we first leverage Lyapunov optimization to transform the stochastic TORS problem into a deterministic per-slot block problem, avoiding the need for extensive system prior knowledge. Subsequently, we propose a Soft Actor-Critic (SAC)-based algorithm, SAC-TORS, to find a satisfactory TORS solution with minimal computational complexity in a distributed manner. Accordingly, each IoT device can independently make self-determined and directional decisions with observable network information. Through extensive experiments, we demonstrate that the SAC-TORS outperforms state-of-the-art solutions, achieving performance improvements of up to 66%.

3 November 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
KYKai Yang
Kai Yang
QLQiang Li
Qiang Li
HWHaining Wang
Haining Wang
LSLimin Sun
Limin Sun
JLJiqiang Liu
Jiqiang Liu

15 April 2024
Verified
Conference Paper
Open access
JHJintao Huang
Jintao Huang
KYKai Yang
Kai Yang
GWGaosheng Wang
Gaosheng Wang
ZSZhiqiang Shi
Zhiqiang Shi
SLShichao Lv
Shichao Lv
LSLimin Sun
Limin Sun
The principal tasks of program analysis, including bug searching and code similarity detection, are executed at the function level. However, the accurate identification of functions within stripped binary files poses a significant challenge. This difficulty is exacerbated by unformatted monolithic firmware images typically found in industrial controlling device, rendering existing methods ineffective due to their dependence on specific metadata, which may be absent. In this paper, we propose a new function identification scheme and a tool that target on monolithic firmware images, referred to as TaiE. Our scheme recognizes functions based on stack characteristics and does not rely on auxiliary information provided by the target file. We evaluate TaiE's performance on synthetic and real-world targets comprising a total of 160 hardware platforms and 1,105 firmware images. The results show that TaiE achieves a precision greater than 97% and a recall higher than 87%, outperforming state-of-the-art tools.

9 June 2026 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
TLTing Li
Ting Li
HMHuiting Mo
Huiting Mo
TOTao Ouyang
Tao Ouyang
YLYinlong Liu
Yinlong Liu
KYKai Yang
Kai Yang
Personalized Federated Learning (PFL) enables client-specific models to address data heterogeneity but suffers from high communication overhead and unstable participation in resource-constrained and self-interested environments. Existing mainstream approaches predominantly prioritize training process efficiency but lack explicit consideration of incentive mechanisms and rational client behaviors, which may lead to clients behaving conservatively, reducing participation and limiting the effectiveness and scalability of PFL in real-world deployments. In this paper, we propose IncenPNS, the first incentive-driven adaptive framework that jointly optimizes model pruning, neighbor selection, and incentive mechanisms for communication-efficient PFL. IncenPNS formulates the joint design as a unified optimization objective that balances personalization performance, communication efficiency, and incentive utility under dynamic and heterogeneous environments. To solve the resulting coupled and high-dimensional decision problem, we develop a Multi-Agent Soft Actor-Critic (MASAC)-based learning algorithm that enables clients to adapt pruning rates and collaboration decisions through online interaction. Moreover, a budget-balanced incentive mechanism is incorporated to operate under partial observability, aligning individual rationality with system-level objectives and ensuring reliable participation of self-interested clients. Extensive experiments on representative benchmarks show that IncenPNS achieves up to 34.8% reduction in communication cost, 68.8% faster convergence, and 83.3% improvement in personalization accuracy compared with state-of-the-art baselines.

1 August 2025 in IEEE Communications Letters
Verified
Journal Article
Closed access
TLTing Li
Ting Li
JCJiechen Cai
Jiechen Cai
HCHuajun Cui
Huajun Cui
HChaiqiang chen
haiqiang chen
KYKai Yang
Kai Yang
While multi-hop task offloading can alleviate the limitations of single-hop schemes in infrastructure-free scenarios, most existing methods depend on global state information, neglect directional searches for the next hop, and ignore resource probing cost. Accordingly, we propose a Resource Probing based Task Offloading (RPTO) solution in hierarchical multi-hop edge computing networks, enabling directional searches while balancing probing cost and service performance. We then formulate RPTO as a joint optimization problem to minimize service cost and design a Deep Deterministic Policy Gradient (DDPG)-based algorithm to solve it. Simulation results demonstrate that the proposed algorithm outperforms baselines, reducing service cost by 67%.

1 June 2026 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
TLTing Li
Ting Li
LCLingxian Chen
Lingxian Chen
JWJing Wen
Jing Wen
YLYinlong Liu
Yinlong Liu
HChaiqiang chen
haiqiang chen
KYKai Yang
Kai Yang
Edge computing plays a critical role in supporting low-latency IoT applications, yet the susceptibility of edge nodes to faults can disrupt services and degrade Quality of Service (QoS). Fault prediction offers a proactive solution by identifying potential failures through spatio-temporal feature learning from historical observations. However, existing spatio-temporal prediction models are typically designed for fixed network topologies with predefined input-output structures, which limits their effectiveness in dynamic edge networks where nodes are frequently added or removed. Adapting these models to topology variations often requires full retraining or architectural redesign, resulting in substantial computational overhead and limited real-time applicability. To overcome these limitations, this paper proposes ASTFNet, an adaptive spatio-temporal fault prediction framework for dynamic edge networks. The framework integrates a spatio-temporal fault prediction model that incorporates node identity embeddings to enable flexible representation learning under evolving topologies and an adaptive fine-tuning mechanism that detects topology changes and performs targeted model updates without full retraining. Experiments on real-world datasets demonstrate that ASTFNet significantly reduces retraining time while maintaining high prediction accuracy and achieves robust performance under dynamic node additions and removals.