In this paper, we present a strongly faulttolerant design for the l-level k-ary tree multiprocessor and examine its reconfigurability. Our design assigns one spare node to the regular nodes of each subtree with lc levels. Moreover, spare nodes are interconnected to form a spare tree. Our approach utilizes the circuit-switched capabilities of the communication modules of the spare nodes to toler...

Accurate information is most important in Wireless Sensor Networks (WSNs). Incorrect (faulty data) information makes wrong decision; it decreases the reliability in communication. Fault tolerance is one of the issues in WSNs .Proposed fault tolerant data aggregation scheme for identifying the faulty data sent by the sensors to the cluster head, where the aggregation is performed. Identified fau...

A strategy based on principal component analysis (PCA) is presented for detection, identification and reconstruction of faulty sensors. In this strategy, sensor fault detection is carried out by using multivariate statistics, faulty sensors are isolated using principal component score contributions and reconstruction of faulty sensors is accomplished through the analysis of fault direction vect...

The twisted cube TQn is an alternative to the popular hypercube network. Recently, some interesting properties of TQn were investigated. In this paper, we study the pancycle problem on faulty twisted cubes. Let fe and fv be the numbers of faulty edges and faulty vertices in TQn, respectively. We show that, with fe + fv 6 n 2, a faulty TQn still contains a cycle of length l for every 4 6 l 6 jV(...

A fault is an attribute of a program that precludes it from satisfying its specification; while this definition may sound clear-cut, it leaves many details unspecified. An incorrect program may be corrected in many different ways, involving different numbers of modifications. Hence neither the location nor the number of of faults may be defined in a unique manner; this, in turn, sheds a cloud o...

We consider the problem of exploration of networks, some of whose edges are faulty. A mobile agent, situated at a starting node and unaware of which edges are faulty, has to explore the connected fault-free component of this node by visiting all of its nodes. The cost of the exploration is the number of edge traversals. For a given network and given starting node, the overhead of an exploration...

A family outbreak of methaemoglobinaemia following ingestion of sausages made using 'saltpetre' is reported. Saltpetre is a generic term for several potassium and sodium based compounds. On this occasion imprecise ordering led to the use of sodium nitrite rather than the usual potassium nitrate, with extremely serious consequences.

We study the problem of broadcasting in point-to-point networks with faulty links. The usual approach in which the number of faulty links in each step is bounded by a fixed constant does not reflect the intuition that the probability of a certain link to fail while transmitting a particular message is a fixed constant. In our model the number of faulty links in a given step depends on the total...

A hypercube may operate in a gracefully degraded manner, after faults arise, by supporting the execution of parallel algorithms in smaller fault-free subcubes. In order to reduce execution slowdown in a hypercube with given faults, it is essential to identify the maximum healthy subcubes in the faulty hypercube because the time for executing a parallel algorithm tends to depend on the dimension...

System-level fault diagnosis deals with the problem of identifying faulty nodes (processors) in a multiprocessor system. Each node is faulty or fault-free, and it can test other nodes in the system, and outputs the test results. The test result from a node is reliable if the node is fault-free, but the result is unreliable if it is faulty. In this paper, we prove that four variants of the hyper...