Journal of Systems Engineering and Electronics ›› 2008, Vol. 19 ›› Issue (6): 1250-1257.

• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles     Next Articles

Research of improving the dynamic scheduling algorithm in the CAN bus control networks

Wang Liming1, Shao Ying1, Wang Mingzhe2 & Shan Yong1   

  1. 1. Electric and Information Coll., Naval Engineering Univ., Wuhan 430033, P. R. China;
    2. Huazhong Univ. of Science and Technology, Wuhan 430074, P. R. China
  • Online:2008-12-23 Published:2010-01-03

Abstract:

Currently, the article analyzes the CAN bus’s rule of priority’s arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority’s messages will be delayed considerably more, even some data will be lost when the bus’s bandwidth is widely used. The scheduling cannot be modified neither during the system when static priority is used. The dynamic priority promoting method and the math model of SQSA and SQMA are presented; it analyzes the model’s rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, it is confirmed that the method of improving dynamic priority has good performances on the network rate of taking in and sending out in large quantities, the average delay, and the rate of network usage by emulational experiments.