Recursive Filtering for Time-Varying Systems with Random Access Protocol

This paper is concerned with the recursive filtering problem for a class of networked linear time-varying systems subject to the scheduling of the Random Access Protocol (RAP). The communication between the sensors nodes and the remote filter is implemented via a shared network. For the purpose of preventing the data from collisions, only one sensor node is allowed to get access to the network at each time instant. The transmission order of sensor nodes is orchestrated by the RAP scheduling, under which the selected nodes obtaining access to the network could be characterized by a sequence of independent and identically-distributed (i.i.d) variables. The aim of the addressed filtering problem is to design a recursive filter such that the filtering error covariance could be minimized by properly designing the filter gain at each time instant. The desired filter gain is calculated recursively by solving two Riccati-like difference equations. Furthermore, the boundedness issue of the corresponding filtering error covariance is investigated. Sufficient conditions are obtained to ensure the lower and upper bounds of the filtering error covariance. Two illustrative examp