Abstract
Vehicle time-sensitive communication (VTSC) is an emerging paradigm where the Time-Sensitive Networking together with V2X provides connected vehicle with deterministic and low communication latency. Scheduling is a critical step to realize the determinism. Recently, as the scale and variety of VTSCs increase, the requirements of simultaneously achieve multicast supportment, short runtime, dynamic schduling ability and low resource overhead challenge the traditional TSN scheduling algorithms. This paper proposes a scheduling scheme with multiple stages to achieve both efficient and rapid scheduling. This paper first formulates the joint routing and scheduling problems by proposing a cluster-Integer Linear Programming (CILP). It aims to accelerate the static scheduling and realize real-time response for dynamic incremental scheduling. An improved topology pruning method and a clustering-aggregation ILP procedure are presented. Then, since the dynamic scheduling will gradually reduce the resource utilization, this paper proposes an adaptive genetic algorithm (AGA) to rapidly perform the resource optimization. The crossover operator, mutation operator, adaptive probability and fitness function are designed, supporting multicast TSN flows. Finally, this paper conducts extensive simulations to validate the proposed algorithms. The results show that, comparing with traditional methods, the proposed CILP method can reduce the average runtime by up to 86.7% for static scheduling and realize real-time dynamic scheduling. The proposed AGA method can reduce the resource optimization runtime by up to 70% while improving the schedulability. The overall multi-stage scheduling mechanism could satisfy the VTSC scheduling requirements.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.