Abstract:
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.