Software/Hardware Integration Lab, Federal University of Santa Catarina, Florianópolis, SC 88040-900, Brazil.
Sensors (Basel). 2020 Mar 25;20(7):1818. doi: 10.3390/s20071818.
In this paper, we present an approach to assess the schedulability and scalability of CPS Networks through an algorithm that is capable of estimating the load of the network as its utility grows. Our approach evaluates both the network load and the laxity of messages, considering its current topology and real-time constraints while abstracting environmental specificities. The proposed algorithm also accounts for the network unreliability by applying a margin-of-safety parameter. This approach enables higher utilities as it evaluates the load of the network considering a margin-of-safety that encapsulates phenomena such as collisions and interference, instead of performing a worst-case analysis. Furthermore, we present an evaluation of the proposed algorithm over three representative scenarios showing that the algorithm was able to successfully assess the network capacity as it reaches a higher use.
在本文中，我们提出了一种通过算法评估 CPS 网络可调度性和可扩展性的方法，该算法能够随着网络效用的增长估计网络的负载。我们的方法评估网络负载和消息的松弛度，同时考虑当前拓扑和实时约束，抽象环境特异性。所提出的算法还通过应用安全裕度参数来考虑网络不可靠性。由于该方法通过评估网络的负载来考虑安全裕度，从而封装了碰撞和干扰等现象，而不是进行最坏情况分析，因此可以实现更高的效用。此外，我们在三个具有代表性的场景中对所提出的算法进行了评估，结果表明，该算法能够成功地评估网络容量，因为它达到了更高的利用率。
