bigge2025hierarchical
Abstract
Inside highly mobile vehicles, In-Vehicle Networks (IVNs) are designed to meet the requirements of reliable and deterministic communication. When two vehicles communicate, however, decentralized best-effort wireless connections threaten to re-introduce the problems that IVNs were designed to solve. Moving to centralized coordination cannot meet the requirements of Vehicle to Everything (V2X) systems for a wealth of reasons from capacity bounds to privacy and safety. In this paper, we thus propose hierarchical cooperative Time Sensitive Networking (TSN) as an approach for cooperating (rather than centrally managed) TSN networks via best-effort wireless links. Our approach is both suited to mixed IVN and V2X systems of highly mobile nodes like platooning and generalizable to similar systems requiring streams across cooperating TSN networks. We also present an approach for the simulative performance evaluation of such systems and describe an Open Source reference implementation using well-established simulation tools. We conclude with the results of a proof of concept evaluation to demonstrate the feasibility and dynamic adaptivity of our approach.
Quick access
Contact
BibTeX reference
@inproceedings{bigge2025hierarchical,
author = {Bigge, Jannusch and Sommer, Christoph},
title = {{Hierarchical Scheduling of Cooperative TSN for Mixed Critical Wireless Systems}},
booktitle = {20th IEEE/IFIP Wireless On-demand Network systems and Services Conference (WONS 2025)},
address = {Hintertux, Austria},
month = {January},
publisher = {IEEE},
year = {2025},
}
Copyright notice
Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.
The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
The following applies to all papers listed above that have IFIP copyrights: © IFIP, (YEAR). This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)}, http://IFIP DL URL.