Optimal Sensor Scheduling under Denial-of-Service Attack for Remote State Estimation with Energy Constraint

This paper investigates the sensor scheduling problem under denial-of-service (DoS) attack. Specifically, a system is in consideration where a battery-powered sensor sends the data packet to the remote estimator over a wireless channel under the successive DoS attack. Due to the limited power budget, the sensor can transmit M times over the finite time horizon T. The issue of the optimal sensor scheduling for remote estimation to minimize the average expected estimation error has been studied. Most of the existing works considered the channel without attack such that it is assumed that no packet dropouts will happen, which is, however, no longer rational in the presence of DoS attack. And to the best of our knowledge, some sensor scheduling problem under DoS attack for remote estimation over the finite time horizon has not been addressed. To fill this gap, a novel analysis approach is proposed, based on which, we derive the conditions under which the optimal sensor scheduling is found. Numerical example is presented to substantiate the theoretical results.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/ddcls66240.2025.11065261
Primary Topic
Distributed Sensor Networks and Detection Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Sensor Scheduling under Denial-of-Service Attack for Remote State Estimation with Energy Constraint

Menglin Li, Qiang Wei, Changhong He, Yaolin Zhang
Distributed Sensor Networks and Detection Algorithms
article

Optimal Sensor Scheduling under Denial-of-Service Attack for Remote State Estimation with Energy Constraint

Menglin Li, Qiang Wei, Changhong He, Yaolin Zhang
article en

Abstract

This paper investigates the sensor scheduling problem under denial-of-service (DoS) attack. Specifically, a system is in consideration where a battery-powered sensor sends the data packet to the remote estimator over a wireless channel under the successive DoS attack. Due to the limited power budget, the sensor can transmit M times over the finite time horizon T. The issue of the optimal sensor scheduling for remote estimation to minimize the average expected estimation error has been studied. Most of the existing works considered the channel without attack such that it is assumed that no packet dropouts will happen, which is, however, no longer rational in the presence of DoS attack. And to the best of our knowledge, some sensor scheduling problem under DoS attack for remote estimation over the finite time horizon has not been addressed. To fill this gap, a novel analysis approach is proposed, based on which, we derive the conditions under which the optimal sensor scheduling is found. Numerical example is presented to substantiate the theoretical results.

Institute of Electronics (CN)
Affordable and clean energy
Openalex Percentile: Top 82%
Distributed Sensor Networks and Detection Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Optimal Sensor Scheduling under Denial-of-Service Attack for Remote State Estimation with Energy Constraint — Menglin Li, Qiang Wei, et al. · (2025) | TGRS Research Map | TGRS