152848
Guided test generation for isolation and detection of embedded trojans in ics
Testing the genuineness of a manufactured chip is an important step in an IC product life cycle. This becomes more prominent with the outsourcing of the manufacturing process, since the manufacturer may tamper the internal circuit behavior using Trojan circuits in the original design. Traditional testing methods cannot detect these stealthy Trojans because the triggering scenario, which activates it, is unknown. Recently, approaches based on side-channel analysis have shown promising results in detecting Trojans. In this paper, we propose a novel test generation technique that aims at magnifying the disparity between side-channel signal waveforms of tampered and genuine circuits to indicate the possibility of internal tampering. Experimental results indicate that our approach could magnify the likelihood of Trojans 4 to 20 times more than existing side-channel analysis based approaches.
7962101
A New Hybrid Solution to Boost SAT Solver Performance
Due to the widespread demands for efficient SAT solvers in Electronic Design Automation applications, methods to boost the performance of the SAT solver are highly desired. We propose a Hybrid Solution to boost SAT solver performance in this paper, via an integration of local and DPLL-based search approaches. A local search is used to identify a subset of clauses to be passed to a DPLL SAT solver through an incremental interface. In addition, the solution obtained by the DPLL solver on the subset of clauses is fed back to the local search solver to jump over any locally optimal points. The proposed solution is highly portable to the existing SAT solvers. For satisfiable instances, up to an order of magnitude speedup can be obtained via the proposed hybrid solver.
22689188
Bilateral Testing of Nano-scale Fault-Tolerant Circuits
As the technology enters the nano dimension, the inherent unreliability of nanoelectronics is making fault-tolerant architectures increasingly necessary in building nano systems. Because fault-tolerant hardwares help to mask the effects caused by increased levels of defects, testing the functionality of the chip together with the embedded fault-tolerance becomes a tremendous challenge. In this paper, a new bilateral testing framework for nano circuits is proposed, where multiple stuck-at faults across different modules in a triple module redundancy (TMR) architecture are considered. In addition, a new test generator is presented for the bilateral testing that takes into account the enormous number of bilateral stuck-at faults possible with new types of guidance in the search, and it can generate a set of vectors that can test the TMR-based nano circuit as a single entity. Experimental results reported for ISCAS’85 and ITC99 circuits demonstrate that the bilateral testing can help to capture many more defects which the single stuck-at fault misses.
6039657
Bilateral Testing of Nano-scale Fault-tolerant Circuits
As the technology enters the nano dimension, the inherent unreliability of nanoelectronics is making fault-tolerant architectures increasingly necessary in building nano systems. Because fault-tolerant hardwares help to mask the effects caused by increased levels of defects, testing the functionality of the chip together with the embedded fault-tolerance becomes a tremendous challenge. In this paper, a new bilateral testing framework for nano circuits is proposed, where multiple stuck-at faults across different modules in a triple module redundancy (TMR) architecture are considered. In addition, a new test generator is presented for the bilateral testing that takes into account the enormous number of bilateral stuck-at faults possible with new types of guidance in the search, and it can generate a set of vectors that can test the TMR-based nano circuit as a single entity. Experimental results reported for ISCAS?85 and ITC99 circuits demonstrate that the bilateral testing can help to capture many more defects which the single stuck-at fault misses.
3191506
A Fast Approximation Algorithm for MIN-ONE SAT
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The constraints are gradually relaxed to eliminate the conflicts with the original Boolean SAT formula until a solution is found. The experiments demonstrate that RelaxSAT is able to handle very large instances which cannot be solved by existing MIN-ONE algorithms; furthermore, very tight bounds on the solution were obtained with one to two orders of magnitude speedup.
19803744
Effects of Similarity-Based Selection on WBMOIA: A Weight-Based Multiobjective Immune Algorithm
With a comparison to the random selection approach used in the weight-based multiobjective immune algorithm (WBMOIA), this paper proposes a new selection approach based on the truncation algorithm with similar individuals (TASI). Then the effect of the proposed selection approach is examined on the performance of WBMOIA. On one hand, the performance is compared between WBMOIA with the random selection approach and WBMOIA with the proposed selection approach. On the other hand, simulation results on a number of problems are presented to investigate if there exists any value of the reduction rate where WBMOIA performs well. Experiment results show that the performance of WBMOIA can be improved by the proposed selection approach and a better reduction rate can be obtained for each test problem.
1482280
SIGF: a family of configurable, secure routing protocols for wireless sensor networks
As sensor networks are deployed in adversarial environments and used for critical applications such as battlefield surveillance and medical monitoring, security weaknesses become a big concern. The severe resource constraints of WSNs give rise to the need for resource bound security solutions.In this paper we present SIGF (Secure Implicit Geographic Forwarding), a configurable secure routing protocol family for wireless sensor networks that provides "good enough" security and high performance. By avoiding or limiting shared state, the protocols prevent many common attacks against routing, and contain others to the local neighborhood.SIGF makes explicit the tradeoff between security provided and state which must be stored and maintained. It comprises three protocols, each forming a basis for the next: SIGF-0 keeps no state, but provides probabilistic defenses; SIGF-1 uses local history and reputation to protect against certain attacks; and SIGF-2 uses neighborhood-shared state to provide stronger security guarantees.Our performance evaluation shows that SIGF achieves high packet delivery ratios with low overhead and end-to-end delay. We evaluate the security of SIGF protocols under various security attacks and show that it effectively contains the damage from compromised nodes and defends against black hole, selective forwarding, Sybil, and some denial of service attacks.
1105662
A time window based approach for job shop scheduling
A time window based approach is developed for job shop scheduling problems to minimize the weighted earliness and tardiness cost. With the time windows provided by Lagrangian relaxation within which parts are processed to minimize the cost and an effective algorithm to find a feasible schedule within or approximately within the windows, the approach can generate schedules better than those generated by the Lagrangian relaxation approach for large problems in a similar computation time. This demonstrates that our approach can be used to solve practical scheduling problems with an improved performance.
393655
A Novel Artificial Immune System for Multiobjective Optimization Problems
This study presents a novel weight-based multiobjective artificial immune system (WBMOAIS) based on opt-aiNET. The proposed algorithm follows the elementary structure of opt-aiNET, but has the following distinct characteristics: At first,a randomly weighted sum of multiple objectives is used as a fitness function; Secondly, the individuals of the population are chosen from the memory, which is a set of elite solutions. Lastly, in addition to the clonal suppression algorithm similar to that used in opt-aiNET, a new truncation algorithm with similar individuals (TASI) is presented in order to eliminate the similar individuals in memory and obtain a well-distributed spread of non-dominated solutions. Simulation results show WBMOAIS outperforms the vector immune algorithm (VIS) and the elitist non-dominated sorting genetic system (NSGA-II).
13050911
Efficiency Centric Communication Model for Wireless Sensor Networks
Recent studies on radio reality provided strong evidence that radio links between low-power sensor devices are extremely unreliable. In this paper, we study how to improve energy efficiency for reliable communication using such unreliable links. We identify an optimal bound on energy efficiency for reliable communication, and propose a new communication model in the link layer that asymptotically approaches this bound. This new model indicates a better path metric compared to previous path metrics, and we validate this by establishing a routing infrastructure based on this metric, which indeed achieves a higher energy efficiency compared to other stateof-the-art approaches. We present results from a systematic analysis, simulations and prototype experiments based on the MicaZ platform. The results give us fundamental insights on communication efficiency over unreliable links.