z-logo
open-access-imgOpen Access
Optimal sensor scheduling for state estimation over lossy channel
Author(s) -
Sui Tianju,
You Keyou,
Fu Minyue
Publication year - 2015
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2014.1038
Subject(s) - estimator , scheduling (production processes) , lossy compression , computer science , real time computing , network packet , channel (broadcasting) , wireless sensor network , algorithm , mathematical optimization , computer network , mathematics , statistics , artificial intelligence
This study studies a sensor scheduling problem for the state estimation of a stochastic discrete‐time system where the measurements are to be sent from multiple sensors to a centralised estimator through a lossy channel. By adopting a carrier sense multiple access/collision avoidance (CSMA/CA) protocol, the packet loss rate of the channel increases with the number of competing sensors for data communication. To increase the channel utilisation, it requires to smartly select informative sensors to transmit their measurements. Depending on the availability of the acknowledgment (ACK) messages from the estimator, both online and offline algorithms for scheduling sensor communication are proposed to optimise the expected performance of minimum mean‐square error state estimator. Particularly, the online scheduling uses the ACK to trigger the sensor communication while the offline version adopts a random transmission framework and only decides the probability of sending measurements for each sensor in an offline manner. The optimal online scheduler is given by the solution of an integer programming, which is approximated by a practically solvable optimisation. Simulations are included to demonstrate the effectiveness of the proposed algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here