On stochastic sensor network scheduling for multiple processes

• Main Authors: Han, Duo, Wu, Junfeng, Mo, Yilin, Xie, Lihua
• Other Authors: School of Electrical and Electronic Engineering
• Format: Article
• Language: English
• Published: 2017
• Subjects: Optimal Scheduling; Schedules
• Online Access: https://hdl.handle.net/10356/86255; http://hdl.handle.net/10220/44021
• Institution: Nanyang Technological University

We consider the problem of multiple sensor scheduling for remote state estimation of multiple process over a shared link. In this problem, a set of sensors monitor mutually independent dynamical systems in parallel but only one sensor can access the shared channel at each time to transmit the data packet to the estimator. We propose a stochastic event-based sensor scheduling in which each sensor makes transmission decisions based on both channel accessibility and distributed event-triggering conditions. The corresponding minimum mean squared error (MMSE) estimator is explicitly given. Considering information patterns accessed by sensor schedulers, time-based ones can be treated as a special case of the proposed one. By ultilizing realtime information, the proposed schedule outperforms the time-based ones in terms of the estimation quality. Resorting to solving an Markov decision process (MDP) problem with average cost criterion, we can find optimal parameters for the proposed schedule. As for practical use, a greedy algorithm is devised for parameter design, which has rather low computational complexity. We also provide a method to quantify the performance gap between the schedule optimized via MDP and any other schedules.