YLYao Li

Yao Li

*This is an algorithmically generated author record based on publicly available information.

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


Yao Li has a total of 54 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Building Resilient ISAC in Maritime IoT: Dynamic Attack Detection and Energy-Efficient Scheduling Under DoS Jamming

    by Yao Li, Sinan Li, Xinping Guan

    Modern integrated sensing and communication (ISAC) technology enables the tight integration of sensing and transmission within the framework of maritime Internet of Things (IoT) to achieve enhanced performance. However, in actual maritime industrial environments, such maritime IoT systems are often susceptible to various sources of interference, particularly anthropogenic jamming, making the application of antijamming ISAC technology in maritime IoT an imperative challenge. To address this issue, this article proposes a novel algorithm integrating dynamic attack detection for solving transmission scheduling optimization problems under Denial-of-Service (DoS) attacks. First, a novel learning-based adaptive Kalman filter (LAKF) algorithm is introduced. Even in time-varying noise environments, the algorithm can still dynamically adjust the covariance matrix of observation noise through reinforcement learning to match the actual noise characteristics. Second, an intelligent detection algorithm is designed to counter time-varying attack patterns, which leverages a temporal window approach incorporating long short-term memory networks and an attention mechanism. Finally, we propose an energy-aware LAKF-attack pattern detection-twin delayed deep deterministic policy gradient tracking (APD-TD3T) algorithm, which integrates the LAKF and APD algorithms and uses the improved TD3 algorithm (an improvement of the DDPG algorithm) as the core algorithm. Specially, it also incorporates a delayed reward design, which effectively addresses the anti-DoS transmission scheduling optimization problem in continuous action space. Simulation experiment and comparison results demonstrate that the proposed LAKF-APD-TD3T algorithm achieves superior performance, significantly decreasing both tracking error and energy consumption in target tracking scenarios.

  • Optimal Hybrid Intrusion Schedule Against State Estimation for Cyber-Physical Systems

    by Zining Wang, Yao Li, Yancheng Li, Junjie Xu, Jianyong Zheng, Lu Sun

    The security issues of wireless cyber-physical systems (CPSs) have attracted widespread attentions in the decade. Existing research mainly focuses on the specific attack paradigm of a single attacker or eavesdropper. In this letter, we consider a smart intruder which has two options including eavesdropping and DoS attack. The intruder can switch between these two options based on the global cost function which is constructed as a trade-off between the intruder's estimation error, energy consumption, and estimation error at the estimator side. By modeling it as a Markov decision process (MDP), we give some structural properties of the optimal schedule analytically and explicitly. It can be theoretically proved that there remains a threshold structure for the optimal intrusion scheduling when the holding time of estimator is fixed. Further more, when intruder's holding time is fixed, the optimal strategy consists of two cases, both of which follow a threshold structure, and they exhibit opposing forms of the optimal solution. Numerical examples and comparisons with the state-of-art methods are presented to demonstrate the correctness and effectiveness of our proposed results.

  • Optimal Decentralized Sensor Scheduling for State Estimation Over Heterogeneous Multi-Hop Networks in Cyber-Physical Systems

    by Yao Li, Jiawang Zhao, Rui Song, Jianyong Zheng

    In this letter, an energy-efficient estimation-oriented sensor scheduling problem over heterogeneous multi-hop sensor networks in cyber-physical systems (CPSs) is studied. Different from most existing literature, we mainly consider the scenario where only local information can be accessed for decision making for each hop, and additionally, different hops may share different power constraints and communication parameters. Based on this, a totally decentralized scheduling scheme has been provided, where a stochastically triggered form is proposed with a Markovian model adopted to formulate the state transition relationship between the adjacent hops. For the propose of calculation of the switching threshold and selection probabilities, an explicit expression for parameters determination is further properly designed to overcome the coupling property between hops. It can be proved that the global optimality can be achieved under our proposed decentralized scheduling scheme, and additionally, capturing conspicuous increase in performance with respect to other baseline schemes. Numerical simulation and comparisons with the random schedule, optimal offline schedule and state-of-the-art method have demonstrated the correctness and effectiveness of our proposed scheduling scheme and theoretical results.


  • Energy-Efficient Power Scheduling for State Estimation Over Two-Hop Relay Networks

    by Xue Zhang, Yao Li, Xinping Guan

    In this article, an online power scheduling problem over two-hop relay networks is investigated. We first provide a general framework of the transmission scheduling problem for the two-hop case under power constraints. Due to the typical characteristics of the multihop transmissions, centralized and decentralized transmission scheduling schemes are introduced, where centralized and decentralized delays are properly defined, respectively. A threshold-triggered algorithm is figured out for the sensor/relay to switch between different power levels, where the triggering threshold and selection probabilities can be determined by the given power constraint. For the centralized scheme (CS), we explicitly analyze the performance by providing the upper and lower bounds of the estimation performance; for the decentralized scheme (DS), the estimation performance is also figured out in an analytical form. The comparisons between proposed online strategies and the offline ones have shown the superiority of online strategies over the optimal offline strategy. Numerical simulations have validated the effectiveness and superiority of our proposed algorithms.

  • Optimal Cross-Domain Path Planning and Data Collection Strategy: A Dual-Mapping Fermat Point and Adaptive Learning-Based Approach

    by Yao Li, Chenyu Wei, Jianjie Pan, Jianyong Zheng, Xinping Guan

    Cross-domain data collection in the maritime Internet of Things (IoT) requires coordinated operation between autonomous underwater vehicles (AUVs) and unmanned surface vehicles (USVs). This coordination is challenged by heterogeneous AUVs and USVs, environmental dynamics and uncertainty, stringent energy budgets, and the intrinsic coupling between task allocation and path optimization. These factors jointly degrade collection efficiency, inflate energy consumption, and reduce temporal responsiveness. Distinct from existing studies, we propose an integrated cross-domain path planning and data collection framework that combines a novel dual-mapping Fermat-point method, a learning-based adaptive distributed Kalman filter (LADKF), and an improved multiagent deep deterministic policy gradient (MADDPG) algorithm. By generating the individual AUV trajectories, the dual-mapping Fermat-point method then constructs the USV route, simplifying the original complex dynamic collaboration problem, which enables efficient collaborative task allocation for cross-domain data collection. Concurrently, the LADKF adjusts process and measurement noise covariance online to improve state estimation robustness under complex sea conditions. In addition, the improved MADDPG performs dynamic optimization that jointly accounts for data collection efficiency, energy expenditure, and task completion ratio. Simulation results show that, in scenarios affected by noise and ocean currents, the proposed dual-mapping Fermat-point method and LADKF-MADDPG framework significantly enhance cross-domain cooperative data collection efficiency, reduce energy consumption, and provide reliable support for large-scale maritime IoT deployments.


  • Energy-Efficient Optimal Denial-of-Service Attack Schedule Against Transmission Over Interactive Networks

    by Yao Li, Jiawang Zhao, Zhichao Zhang, Xue Zhang, Xinping Guan

    In this paper, we investigate a power-constrained optimal denial-of-service (DoS) attack schedule against transmission over interactive wireless sensor networks. A novel scenario is considered in which an attacker aims to attack the transmission links of the interactive networks to maximize the global error covariance with constrained energy budget. The attacker decides whether to launch an attack or not at each time slot. Two different cost functions are considered, i.e., terminal-error case and average-error case. Through decoupling analysis, the global error covariance can be separated into two portions: one part generated by the initial error, and the other by system noise. Based on this separation, the analytical solution for the terminalerror case is clearly derived. For the average-error case, the indices “occurrence” and “concentration” are introduced. These two indices are used to quantitatively describe the number of times a certain operator appears in a set of error terms generated by iteration, and the accumulative effect of attacks over a time scale, respectively. Aided by these two proposed indices, the optimal attack schedule for the average-error case is analytically derived. Additionally, a problem with regard to the maximization of occurrence is proposed, whose result can be proved to share the same form as the optimal attack schedule for average-error case with measurement noise. Moreover, we have extended our theoretical results to those of distributed scenarios, which follow the similar temporal distributions of global ones. Numerical simulations, including comparison with the learning-based state-of-the-art method, have demonstrated the correctness and effectiveness of our proposed scheduling strategies.

  • An Optimal Periodic Attack Schedule Against Estimation Over Infinite-Time Horizon

    by Junjie Xu, Yao Li, Zining Wang, Yancheng Li, Xinping Guan

    The security issues of cyber-physical systems have received wide attentions in recent years. In this letter, we consider an offline periodic Denial of Service (DoS) attack scheduling problem against the transmission between sensor and estimator over infinite-time horizon. In order to handle offline infinite-time scheduling, different from existing methods which only solve online scheduling problem or provide implicit sub-optimal solutions, we propose a novel approach based on sub-schedules and sub-costs to describe the infinite-time schedule and its cost. Furthermore, an interesting property of periodic decline is discovered for the state distribution, thus we equivalently transform the primal scheduling problem into a finite-time one within a period with respect to the introduced sub-schedules. By analyzing the optimal state distributions within a period, we derive out the global optimal attack schedule in an analytical and explicit form. Numerical comparisons with other schedules (including the online one obtained by the state-of-the-art reinforcement learning-based method) validate the correctness and superiority of the proposed schedule and approach.