A Lightweight Sensor Scheduler Based on AoI Function for Remote State Estimation over Lossy Wireless Channels
Taige Chang, Xianghui Cao, Wei Xing Zheng

TL;DR
This paper introduces a lightweight sensor scheduling method based on AoI for remote state estimation over lossy wireless channels, balancing low complexity and high performance.
Contribution
It proposes a novel AoI-based scheduler that is indexable, sub-optimal, and computationally efficient, with proven stability and bounds.
Findings
Achieves near-optimal estimation performance
Reduces computation time significantly
Provides stability conditions for estimation error
Abstract
This paper investigates the problem of sensor scheduling for remotely estimating the states of heterogeneous dynamical systems over resource-limited and lossy wireless channels. Considering the low time complexity and high versatility requirements of schedulers deployed on the transport layer, we propose a lightweight scheduler based on an Age of Information (AoI) function built with the tight scalar upper bound of the remote estimation error. We show that the proposed scheduler is indexable and sub-optimal. We derive an upper and a lower bound of the proposed scheduler and give stability conditions for estimation error. Numerical simulations demonstrate that, compared to existing policies, the proposed scheduler achieves estimation performance very close to the optimal at a much lower computation time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAge of Information Optimization · IoT Networks and Protocols
