With the development of industrial networks, the demands for strict timing requirements and high reliability in transmission become more essential, which promote the establishment of a Time-Sensitive Network (TSN). TSN is a set of standards with the intention of extending Ethernet for safety-critical and real-time applications. In general, frame replication is used to achieve fault-tolerance, while the increased load has a negative effect on the schedule synthesis phase. It is necessary to consider schedulability and reliability jointly. In this paper, a heuristic-based routing method is proposed to achieve fault tolerance by spatial redundancy for TSNs containing unreliable links. A cost function is presented to evaluate each routing set, and a heuristic algorithm is applied to find the solution with higher schedulability. Compared to the shortest path routing, our method can improve the reliability and the success rate of no-wait scheduling by 5–15% depending on the scale of topology.

Logic locking is an efficient defense against attacks to the intellectual property of integrated circuits. However, in recent years, boolean satisfaction based attack (SAT attack) and a structural based attack named Valkyrie were proposed. As far as we know, most of the locking methods failed to achieve security for both of them and keep an acceptable overhead. In this paper, we present a self-adaptive striped-function logic locking method named SFLL-AD, based on repeatedly modifying the structure of the encryption block to a form that: (1) permits splitting and dispersing the encryption block across the netlist to have resilience to Valkryie (2) and guarantees not losing SAT resilience. Experimental results of our mehtod confirm the security to both attacks and show a small overhead (about 10% on average).