Ting Li
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
Research Subjects
Research Interests
Ting Li has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Yinlong Liu
University of Chinese Academy of Sciences
8 shared publications - Kai Yang
Guangxi University
7 shared publications Dali Zhu
Institute of Information Engineering, Chinese Academy of Sciences and School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China
3 shared publications- Haiqiang Chen
Guangxi University
3 shared publications Jing Wen
Guangxi Zhuang Autonomous Region Information Center
3 shared publicationsLiru Geng
Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
3 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (11) , 9729-9740
Detecting Counterfeits Programmable Logic Controllers via Electrical Fingerprint
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (11) , 9729-9740
Detecting Counterfeits Programmable Logic Controllers via Electrical Fingerprint
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 24798-24813
Secure UAV Offloading in Active RIS-Assisted Mobile Edge Computing Systems
This paper investigates a secure Unmanned Aerial Vehicle (UAV) offloading solution in active Reconfigurable Intelligent Surface (RIS) assisted Mobile Edge Computing (MEC) system. In this system, an active RIS is employed to enhance the quality of the offloading link, while a full-duplex UAV extends service coverage and ensures security by simultaneously transmitting jamming signals. We formulate a joint optimization problem that integrates RIS amplitude, RIS phase shifts, UAV trajectory, and computation offloading strategy, with the objective of minimizing latency and energy consumption cost while guaranteeing robust communication security. However, implementing this scheme is challenging due to the NP-hard and tightly coupled multiple decision variables, the strong interdependence between UAV trajectory and RIS configuration, and the highly complex joint design of RIS and computation offloading that requires real-time adaptation beyond the capability of traditional heuristic approaches. To address these challenges, we propose a hybrid optimization framework that innovatively combines mathematical optimization and Deep Reinforcement Learning (DRL). Specifically, the original joint problem is decomposed into four sub-problems. For the UAV trajectory and RIS phase shift sub-problems, which are naturally compatible with mathematical decomposition as the latter involves a unit-modulus constraint, we employ Successive Convex Approximation (SCA) and Convex Semi-Definite Programming (CSDP) for efficient solutions. In contrast, the computation offloading and RIS amplitude sub problems feature unbounded solution spaces and require adaptive decision-making, and are thus addressed using the Soft Actor Critic (SAC) algorithm. Simulation results show a 22.4% performance gain over baselines, with the active RIS design further enhancing secrecy by 59.1% and 31.7% compared to non-RIS and passive RIS schemes, confirming its effectiveness for secure and efficient MEC offloading in dynamic environments.
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 24798-24813
Secure UAV Offloading in Active RIS-Assisted Mobile Edge Computing Systems
This paper investigates a secure Unmanned Aerial Vehicle (UAV) offloading solution in active Reconfigurable Intelligent Surface (RIS) assisted Mobile Edge Computing (MEC) system. In this system, an active RIS is employed to enhance the quality of the offloading link, while a full-duplex UAV extends service coverage and ensures security by simultaneously transmitting jamming signals. We formulate a joint optimization problem that integrates RIS amplitude, RIS phase shifts, UAV trajectory, and computation offloading strategy, with the objective of minimizing latency and energy consumption cost while guaranteeing robust communication security. However, implementing this scheme is challenging due to the NP-hard and tightly coupled multiple decision variables, the strong interdependence between UAV trajectory and RIS configuration, and the highly complex joint design of RIS and computation offloading that requires real-time adaptation beyond the capability of traditional heuristic approaches. To address these challenges, we propose a hybrid optimization framework that innovatively combines mathematical optimization and Deep Reinforcement Learning (DRL). Specifically, the original joint problem is decomposed into four sub-problems. For the UAV trajectory and RIS phase shift sub-problems, which are naturally compatible with mathematical decomposition as the latter involves a unit-modulus constraint, we employ Successive Convex Approximation (SCA) and Convex Semi-Definite Programming (CSDP) for efficient solutions. In contrast, the computation offloading and RIS amplitude sub problems feature unbounded solution spaces and require adaptive decision-making, and are thus addressed using the Soft Actor Critic (SAC) algorithm. Simulation results show a 22.4% performance gain over baselines, with the active RIS design further enhancing secrecy by 59.1% and 31.7% compared to non-RIS and passive RIS schemes, confirming its effectiveness for secure and efficient MEC offloading in dynamic environments.
- 3 August 2026
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 254
Privacy-preserving task offloading with flipped Huber distribution in mobile edge computing
- 3 August 2026
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 254
Privacy-preserving task offloading with flipped Huber distribution in mobile edge computing
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (16) , 1
Communication-Efficient Personalized Federated Learning with Incentive-Driven Adaptive Model Pruning and Neighbor Selection
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.
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (16) , 1
Communication-Efficient Personalized Federated Learning with Incentive-Driven Adaptive Model Pruning and Neighbor Selection
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 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 5107-5121
ASTFNet: An Adaptive Spatio-Temporal Fault Prediction Framework for Dynamic Edge Networks
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.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 5107-5121
ASTFNet: An Adaptive Spatio-Temporal Fault Prediction Framework for Dynamic Edge Networks
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.
- 21 April 2026
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 251
Forecast-driven task offloading for reliable and adaptive mobile edge computing
- 21 April 2026
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 251
Forecast-driven task offloading for reliable and adaptive mobile edge computing
- 10 October 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 299
CCF-former: A transformer with cross-channel feature aggregation and frozen backbone for fault prediction
- 10 October 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 299
CCF-former: A transformer with cross-channel feature aggregation and frozen backbone for fault prediction
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (10) , 2351-2355
Resource Probing-Based Task Offloading in Hierarchical Multi-Hop Edge Computing Networks
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 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (10) , 2351-2355
Resource Probing-Based Task Offloading in Hierarchical Multi-Hop Edge Computing Networks
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%.
- 13 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (6) , 7195-7208
Detecting Time-Delay Attacks in Industrial Control Systems Through State-Aware Inference
The time-delay attacks pose serious security threats to the industrial control systems (ICSs), where ICS infrastructures (e.g., chemical factories) could suffer severe safety consequences. They could bypass current delay detection methods by avoiding triggering packet timeouts. In this article, we reveal that malicious states caused by the time-delay attacks in ICS scenarios can be detected by analyzing ICS programs. We propose detecting a time-delay attack in ICS scenarios by comparing the difference between malicious and benign states, meeting the real-time and noninterference requirements. Specifically, we utilize symbolic execution to analyze ICS programs to generate the benign states of ICS and leverage the key features of time-delay attacks to create the malicious states of ICS, where the states are transferred through the network for remote control and monitoring. We propose a multimodal neural network whose inputs are the malicious states sampled from the ICS network traffic and the time domain features, and the output is whether such a time-delay attack exists. We implement a prototype system and conduct real-world experiments to evaluate the performance of our detection approach. Our experiments cover 102 vulnerable ICS programs and five types of time-delay attacks. The evaluation results show that our approach can detect ICS time-delay attacks in 0.6 s, with 97.2% precision and 98% recall.
- 13 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (6) , 7195-7208
Detecting Time-Delay Attacks in Industrial Control Systems Through State-Aware Inference
The time-delay attacks pose serious security threats to the industrial control systems (ICSs), where ICS infrastructures (e.g., chemical factories) could suffer severe safety consequences. They could bypass current delay detection methods by avoiding triggering packet timeouts. In this article, we reveal that malicious states caused by the time-delay attacks in ICS scenarios can be detected by analyzing ICS programs. We propose detecting a time-delay attack in ICS scenarios by comparing the difference between malicious and benign states, meeting the real-time and noninterference requirements. Specifically, we utilize symbolic execution to analyze ICS programs to generate the benign states of ICS and leverage the key features of time-delay attacks to create the malicious states of ICS, where the states are transferred through the network for remote control and monitoring. We propose a multimodal neural network whose inputs are the malicious states sampled from the ICS network traffic and the time domain features, and the output is whether such a time-delay attack exists. We implement a prototype system and conduct real-world experiments to evaluate the performance of our detection approach. Our experiments cover 102 vulnerable ICS programs and five types of time-delay attacks. The evaluation results show that our approach can detect ICS time-delay attacks in 0.6 s, with 97.2% precision and 98% recall.
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (1) , 466-481
Multi-Hop Task Offloading and Relay Selection for IoT Devices in Mobile Edge Computing
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%.
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (1) , 466-481
Multi-Hop Task Offloading and Relay Selection for IoT Devices in Mobile Edge Computing
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%.