Close

Presentation

Obfuscated Priority Assignment to CAN-FD Messages with Dependencies: A Swapping-based and Affix-Matching Approach
Time
Location
Event Type
Research Manuscript
Virtual Programs
Hosted in Virtual Platform
Keywords
Design of Cyber-physical Systems and IoT
Topics
Design
DescriptionWe propose a novel priority assignment approach, which assigns the ordered positions (named priorities) in a flow to the messages. It dynamically generates new valid flows (i.e., flows with only dependencies respected and deadlines not considered) by message swapping. We apply pruning through affix-matching to further enhance the efficiency. That is, the prefix, infix, and suffix are all compared when determining whether a certain flow should be discarded without evaluating its availability. Experimental results show that our work dominates the state-of-the-art approach, in the number of available flows found (up to 80x) and time consumption (up to 200x).