Methods for Large-Scale Time-Triggered Network Scheduling
AbstractFuture cyber–physical systems may extend over broad geographical areas, like cities or regions, thus, requiring the deployment of large real-time networks. A strategy to guarantee predictable communication over such networks is to synthesize an offline time-triggered communication schedule. However, this synthesis problem is computationally hard (NP-complete), and existing approaches do not scale satisfactorily to the required network sizes. This article presents a segmented offline synthesis method which substantially reduces this limitation, being able to generate time-triggered schedules for large hybrid (wired and wireless) networks. We also present a series of algorithms and optimizations that increase the performance and compactness of the obtained schedules while solving some of the problems inherent to segmented approaches. We evaluate our approach on a set of realistic large-size multi-hop networks, significantly larger than those considered in the existing literature. The results show that our segmentation reduces the synthesis time by up to two orders of magnitude. View Full-Text
Share & Cite This Article
Pozo, F.; Rodriguez-Navas, G.; Hansson, H. Methods for Large-Scale Time-Triggered Network Scheduling. Electronics 2019, 8, 738.
Pozo F, Rodriguez-Navas G, Hansson H. Methods for Large-Scale Time-Triggered Network Scheduling. Electronics. 2019; 8(7):738.Chicago/Turabian Style
Pozo, Francisco; Rodriguez-Navas, Guillermo; Hansson, Hans. 2019. "Methods for Large-Scale Time-Triggered Network Scheduling." Electronics 8, no. 7: 738.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.