Probabilistic feasibility assessment of real-time wireless networks for factory automation with mobile nodes

This paper proposes a framework for probabilistic schedulability assessment of a real-time wireless factory automation network consisting of multiple automation cells, in the presence of mobile nodes that roam from one cell to another one to accomplish application tasks along a set of predefined paths. The paper contribution is an offline analysis which, on the basis of information about the parameters of the real-time flows, the network topology and the movement patterns of mobile nodes, allows the designer to obtain the probability that the network, at runtime and in the absence of faults, will be schedulable. A case study shows how to apply the proposed analysis to offline dimensioning of the wireless network.