Journal of Northeastern University(Natural Science) ›› 2022, Vol. 43 ›› Issue (3): 350-358.DOI: 10.12068/j.issn.1005-3026.2022.03.007

• Information & Control • Previous Articles     Next Articles

Security Scheduling Algorithm of CAN Bus Based on Dynamic ID Hopping

DING Shan, ZANG Shi-yi, CAO Dian-ming, SHE Li-huang   

  1. School of Computer Science & Engineering, Northeastern University, Shenyang 110169, China.
  • Revised:2021-03-11 Accepted:2021-03-11 Published:2022-05-18
  • Contact: DING Shan
  • About author:-
  • Supported by:
    -

Abstract: CAN(controller area network) bus is the most widely used field bus. Due to the lack of authentication and message checking mechanism, CAN bus has great security risks, so it is necessary to design a defense mechanism for CAN bus. In this paper, a priority hopping mechanism is designed, which introduces the dynamic hopping of identifiers by Hash function into a real-time scheduling algorithm. The fixed priority is calculated by a genetic algorithm, and the compromise range of priority is found out. Each frame is grouped, and the ID segment of data frame is segmented and reconstructed. The former part of the ID segment determines the priority and performs priority hopping, while the latter part of the ID segment hops dynamically at one time. Experimental results show that using dynamic priority and one-time ID Hopping to hop has a greater security improvement than the existing ID Hopping mechanism.

Key words: CAN(controller area network)bus; genetic algorithm; ID reconstruction; dynamic ID Hopping; real-time scheduling

CLC Number: