Optimal resource allocation in networked control systems using viterbi algorithm

Gökhan Çetin, M. Sami Fadali

Abstract


This paper proposes an optimal bandwidth allocation algorithm for a Networked Control System (NCS) that has time-driven sensor, event-driven controller and random channels. A Hidden Markov Model (HMM) with a discretized state space is formulated for the random traffic to predict the network states using a suitable data window. Network bandwidth is allocated based on the predicted traffic state subject to bounds on the deterministic traffic that guarantee acceptable NCS performance and do not exceed hardware limitations.  Bandwidth allocation uses  minimization of unmet bandwidth demand. A stability condition is derived for a variable but bounded sampling period interval. Computer simulation results are provided to show the effect of varying the number of discrete states for the HMM and the window width on bandwidth allocation. The results compare favorably with a published approach based on fuzzy logic.


Keywords


Bandwidth allocation; Hidden markov process; Networked control systems network congestion; Variable sampling periody; Viterbi algorithm



DOI: https://doi.org/10.11591/eei.v10i3.3022

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Bulletin of EEI Stats