Robust Priority Assignments for Extending Existing Controller Area Network Applications

Date

2014-02-01

Author

Schmidt, Klaus Verner

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

213
views

0
downloads

The usage of the controller area network (CAN) as an in-vehicle communication bus requires finding feasible and robust priority orders such that each message transmitted on the bus meets its specified deadline and tolerates potential transmission errors. Although such priority orders can be determined by available algorithms whenever they exist, it is always assumed that a CAN priority order is computed from scratch. In practical applications, it is frequently necessary to extend an existing message set by new messages. In this case, a feasible priority order that retains the standardized IDs of the existing messages and assigns suitable priorities to the new messages needs to be found. This paper proposes an algorithm for the computation of robust priority orders that solves the stated problem of extending existing message sets. First, bounds for the priorities of new messages are determined and then the most robust priority order that keeps the IDs of the existing messages is computed. The obtained algorithms are proved to yield correct results and are illustrated by detailed scheduling examples.

Subject Keywords

Control and Systems Engineering, Electrical and Electronic Engineering, Information Systems, Computer Science Applications

URI

https://hdl.handle.net/11511/37775

Journal

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS

DOI

https://doi.org/10.1109/tii.2013.2266636

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Cooperative Communications in Future Home Networks Genc, Zulkuf; Rizvi, Umar H.; Onur, Ertan; Niemegeers, Ignas (Springer Science and Business Media LLC, 2010-05-01) The basic idea behind cooperative communications is that mobile terminals collaborate to send data to each other. This effectively adds diversity in the system and improves the overall performance. In this paper, we investigate the potential gains of cooperative communication in future home networks. We derive analytical expressions for the error probability of binary phase shift keying (BPSK) signals over Nakagami-m fading channels in a multi relay communication network. Following to the analytical study, ...
Computation of Response Time Distributions for Messages on the Controller Area Network Batur, Ahmet; Schmidt, Şenan Ece; Schmidt, Klaus Verner (2018-08-23) The response time of messages is an important parameter for the design of in-vehicle networks based on the controller area network (CAN). The message transmission on CAN is affected by several non-deterministic factors such as stuff bits that are added to CAN frames depending on the message payload or changing phases among the asynchronous CAN nodes because of clock drifts. The resulting probabilistic nature of message response times on CAN is captured by the response time distribution (RTD) that quantifies...
A computation-implementation parallelization approach to the vehicle loading and routing problem Çavdar, Bahar; Sokol, Joel (Wiley, 2019-01-01) In this article, we address a version of the capacitated vehicle routing problem where there is a constraint on the total time that can be spent on computing delivery routes and loading the vehicles. This problem, which we call the vehicle loading and routing problem (VLRP), can arise, for example, in the delivery of small, quick-turnaround orders from a warehouse. We propose a computation-implementation parallelization (CIP) approach to solving large VLRP instances, and present computational results showin...
Synchronization of linear systems via relative actuation Tuna, Sezai Emre (Elsevier BV, 2019-12-01) Synchronization in networks of discrete-time linear time-invariant systems is considered under relative actuation. Neither input nor output matrices are assumed to be commensurable. A distributed algorithm that ensures synchronization via dynamic relative output feedback is presented.
An Investigation of Link Quality Assessment for Mobile Multi-hop and Multi-rate Wireless Networks Zhou, Jinglong; Jacobsson, Martin; Onur, Ertan; Niemegeers, Ignas (Springer Science and Business Media LLC, 2012-07-01) Wireless ad hoc networks will be an important component in future communication systems. The performance of wireless ad hoc networks can be improved by link quality-aware applications. Wireless link quality is dynamic in nature, especially in mobile scenarios. Therefore, accurate and fast packet delivery ratio estimation is a prerequisite to good performance in mobile, multi-hop and multi-rate wireless ad hoc networks. In this paper, we propose a novel packet delivery ratio estimation method that improves t...

Citation Formats

K. V. Schmidt, “Robust Priority Assignments for Extending Existing Controller Area Network Applications,” IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, pp. 578–585, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37775.