Time synchronization for an emulated CAN device on a Multi-Processor System on Chip

Breaban, GD Gabriela; Koedam, Mlpj Martijn; Stuijk, Sander; Goossens, Kgw Kees

doi:10.1016/j.micpro.2017.04.019

Cited by 3 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In which, BRP is the Baud rate prescale coefficient and for the device that adopts the same clock frequency of the master oscillator in CAN bus network, the normal bit rate NBR can be adjusted to the same numerical value only by setting BRP and the TQ in every time period [20,21].…”

Section: Can Bus Synchronizationmentioning

confidence: 99%

Optimization and Simulation of Controller Area Network Communication Model Based on Industrial Internet of Things Platform

Lin

2020

Complexity

View full text Add to dashboard Cite

The Internet of Things (IoT) is an information carrier based on network communication, and it can make all general physical objects which can be independently addressed from an interconnected network. Controller Area Network (CAN) is a kind of serial communication network which can effectively support distributed control or real-time control. This paper proposes the design of an IoT-oriented universal CAN bus. In order to build a complete CAN communication simulation model, message sending and message receiving models are constructed, respectively. The simulation experiment proves that the IoT-oriented network communication model designed in this paper not only has low power consumption, but it can also solve the front-end compatibility problems caused by different communication protocols.

show abstract

Section: Can Bus Synchronizationmentioning

confidence: 99%

Optimization and Simulation of Controller Area Network Communication Model Based on Industrial Internet of Things Platform

Lin

2020

Complexity

View full text Add to dashboard Cite

show abstract

“…For flow Fi, Ωi()t cannot be accurately calculated if we use a global priority assignment strategy in the multi-channel model. Considering that we do not know when the level- k busy period [9] starts, we use the Ωi()t upper bound [10,11,12] to calculate the upper bound of the WETED and set it to Ri.…”

Section: The End-to-end Delay Analyzementioning

confidence: 99%

“…Priority assignment and schedulability analysis of multi-channel real-time flows in the WirelessHART network are usually treated as problems for multi-processor real-time tasks in a CPU [8]. As a result, we do not know when the level- k busy period [9] begins. Therefore, the upper bound of multiprocessor interference is usually calculated instead of the exact solution [19].…”

Section: Related Workmentioning

confidence: 99%

A New Method of Priority Assignment for Real-Time Flows in the WirelessHART Network by the TDMA Protocol

Zhang

et al. 2018

Sensors

View full text Add to dashboard Cite

WirelessHART is a wireless sensor network that is widely used in real-time demand analyses. A key challenge faced by WirelessHART is to ensure the character of real-time data transmission in the network. Identifying a priority assignment strategy that reduces the delay in flow transmission is crucial in ensuring real-time network performance and the schedulability of real-time network flows. We study the priority assignment of real-time flows in WirelessHART on the basis of the multi-channel time division multiple access (TDMA) protocol to reduce the delay and improve the ratio of scheduled. We provide three kinds of methods: (1) worst fit, (2) best fit, and (3) first fit and choose the most suitable one, namely the worst-fit method for allocating flows to each channel. More importantly, we propose two heuristic algorithms—a priority assignment algorithm based on the greedy strategy for C (WF-C) and a priority assignment algorithm based on the greedy strategy for U(WF-U)—for assigning priorities to the flows in each channel, whose time complexity is Ofalse(max(N∗m∗logfalse(mfalse),(N−m)2)false). We then build a new simulation model to simulate the transmission of real-time flows in WirelessHART. Finally, we compare our two algorithms with WF-D and HLS algorithms in terms of the average value of the total end-to-end delay of flow sets, the ratio of schedulable flow sets, and the calculation time of the schedulability analysis. The optimal algorithm WF-C reduces the delay by up to 44.18% and increases the schedulability ratio by up to 70.7%, and it reduces the calculation time compared with the HLS algorithm.

show abstract

Evaluation of Clock Synchronization Algorithms for Controller Area Network

Akpinar

Schmidt

2020

2020 28th Signal Processing and Communications Applications Conference (SIU)

View full text Add to dashboard Cite

Time synchronization for an emulated CAN device on a Multi-Processor System on Chip

Cited by 3 publications

References 16 publications

Optimization and Simulation of Controller Area Network Communication Model Based on Industrial Internet of Things Platform

Optimization and Simulation of Controller Area Network Communication Model Based on Industrial Internet of Things Platform

A New Method of Priority Assignment for Real-Time Flows in the WirelessHART Network by the TDMA Protocol

Evaluation of Clock Synchronization Algorithms for Controller Area Network

Contact Info

Product

Resources

About