IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v1y2005i1-2p160-171.html
   My bibliography  Save this article

A combinatorial algorithm for message scheduling on controller area networks

Author

Listed:
  • Carlos A.S. Oliveira
  • Panos M. Pardalos
  • Tania M. Querido

Abstract

A controller area network (CAN) is a special-purpose communications system, used for real time control of embedded components in vehicles and other general purpose automation systems. A combinatorial algorithm based on network optimisation concepts is presented for scheduling messages on a CAN. The message scheduling (CANMS) problem in CAN requires that messages be allocated according to their priorities, to prevent excessive delays on important messages. The CANMS is an NP-hard problem. The objective of the proposed algorithm is to minimise the total time allocated for message occurrences, in order to avoid message loss. A graph construction is employed, transforming the original problem into the problem of finding cliques with restricted size. According to computer experiments conducted on representative instances, low latency schedules can be obtained through the use of the proposed algorithm. The low computational complexity of the procedure presents the possibility of efficiently solving larger instances of this NP-hard problem.

Suggested Citation

  • Carlos A.S. Oliveira & Panos M. Pardalos & Tania M. Querido, 2005. "A combinatorial algorithm for message scheduling on controller area networks," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 1(1/2), pages 160-171.
    • Handle: RePEc:ids:ijores:v:1:y:2005:i:1/2:p:160-171
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=7439
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhe Liang & Chungmok Lee & W. Chaovalitwongse, 2013. "Mathematical programming approaches for dual multicast routing problem with multilayer risk cost," Annals of Operations Research, Springer, vol. 203(1), pages 101-118, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:1:y:2005:i:1/2:p:160-171. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.