Abstract

This paper studies scheduling multiple sensors for jointly optimizing remote state estimation and wireless sensor network lifetime. Each sensor in the network sends its packet to the remote center for further estimation over wireless communication channels. Sensors in the network will inevitably run out of battery power due to transmission consumption and then reach the end of sensor network lifetime. This article focuses on the problem how to schedule multiple sensors minimizing the total remote estimation errors and simultaneously prolonging the sensor network lifetime. The problem is formulated as a special class of Markov decision process (MDP), stochastic shortest path (SSP) problem. Under this framework, we first derive a set of conditions to guarantee the optimality of structural policies in SSP. Subsequently, threshold structure of the optimal scheduling scheme is obtained by verifying the conditions. Moreover, two Value-of-Information-based multi-sensor scheduling algorithms and a linear-architecture-based learning algorithm are designed to tackle the curse of dimensionality and unknown channel statistics in large-scale sensor networks. Numerical simulations are given to validate effectiveness of our results.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call