Menglin Li

Dr. Menglin Li


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 June 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JQJiahu Qin
Jiahu Qin
MLMenglin Li
Menglin Li
LSLing Shi
Ling Shi
XYXinghuo Yu
Xinghuo Yu
The recent years have seen a surge of security issues of Cyber-Physical Systems (CPS). In this paper, Denial-of-Service (DoS) attack scheduling is investigated in depth. Specifically, we consider a system where a remote estimator receives the data packet sent by a sensor over a wireless network at each time instant, and an energy-constrained attacker that cannot launch DoS attacks all the time designs an optimal DoS attack scheduling to maximize the average expected estimation error. Most of the existing works focus on the ideal scenario in which data packets can be received successfully if there is no DoS attack. To capture the unreliability nature of practical networks, we study the packet-dropping network in which packet dropouts may occur even in the absence of attack. We derive the optimal attack scheduling scheme that maximizes the average expected estimation error and the one which maximizes the expected terminal estimation error over packet-dropping networks. We also present some countermeasures against DoS attacks, and discuss the optimal defense strategy, and how the optimal attack schedule can serve for more effective and resource-saving countermeasures. We further investigate the optimal attack schedule with multiple sensors. The optimality of the theoretical results is demonstrated by numerical simulations.

31 August 2022 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
CZCong Zhang
Cong Zhang
JQJiahu Qin
Jiahu Qin
QMQichao Ma
Qichao Ma
YSYang Shi
Yang Shi
MLMenglin Li
Menglin Li
This article studies the resilient distributed state estimation over the sensor networks under measurement attacks, which make the measurements of variant subsets of sensors aberrant at different time instants. For this problem, while most of the existing works focus on the static target states that do not change over time, we investigate the estimation for the dynamic ones, which evolve according to general linear time-invariant (LTI) systems. To achieve the resilient distributed state estimation for the general LTI systems under the measurement attacks, we propose a dynamic-target regulative gain estimation (DTRGE) algorithm, in which an attack detector, a regulative gain matrix, and an adaptive gain are designed. The detector helps agents monitor the measurement anomalies, and once the attacks are detected, the adaptive gain can counteract the deviation of the estimates induced by them. The regulative gain matrix restrains the negative effects on the convergence of the estimates caused by the system matrix of the target LTI system, especially the unstable one. We demonstrate that all the sensors can recover the target state by running the DTRGE algorithm, if the topology and the observability of the sensor network satisfy certain conditions. Moreover, we further apply the DTRGE algorithm to the sensor networks with switching topologies, and demonstrate that the estimation task can also be completed by these sensors. Finally, simulation and experiment results are given to illustrate the performance of the DTRGE algorithm.

23 November 2020 in arXiv
Verified
Preprint
Open access
PDF file
JWJie Wang
Jie Wang
JQJiahu Qin
Jiahu Qin
MLMenglin Li
Menglin Li
YSYang Shi
Yang Shi
In this paper, we investigate remote state estimation against an intelligent denial-of-service (DoS) attack over a vulnerable wireless network whose channel undergoes attenuation and distortion caused by fading. We use the sensor to observe system states and transmit its local state estimates to the remote center. Meanwhile, the attacker injects a jamming signal to destroy the packet accepted by the remote center and causes the performance degradation. Most of the existing works are built on a time-invariant channel state information (CSI) model in which the channel fading is stationary. However, the wireless communication channels are more prone to dynamic changes. To capture this time-variant property in the channel quality of the real-world networks, we study the fading channel network whose channel model is characterized by a generalized finite-state Markov chain. With the goals of two players in infinite-time horizon, we describe the conflicting characteristic between the attacker and the sensor with a general-sum stochastic game. Moreover, the Q-learning techniques are applied to obtain an optimal strategy pair at a Nash equilibrium. Also the monotone structure of the optimal stationary strategy is constructed under a sufficient condition. Besides, when channel gain is known a priori, except for the full Channel State Information (CSI), we also investigate the partial CSI, where Bayesian games are employed. Based on the player's own channel information and the belief on the channel distribution of other players, the energy strategy at a Nash equilibrium is obtained.