In this lecture, we study the Byzantine Agreement problem, defined as follows: consider a network of n processors, where each pair of processors can communicate (this is the so-called “point-to-point” model). Furthermore, at most t processors within this network may be faulty; a faulty processor may exhibit arbitrary behavior. (We also assume that the behavior of these faulty processors may be ...

We propose a fault-tolerant broadcasting algorithm for hypercubes with link faults. This algorithm is based on an extended spanning binomial tree structure that still keeps the simplicity of conventional binomial-tree-based broadcasting. In addition, it is optimal in the sense that exactly n steps are required to complete a broadcast in an n-dimensional injured hypercube with up to n 2 faulty l...

Wireless sensor networks (WSNs) consist of hundreds or thousands of tiny sensor nodes that work together to do some special tasks. Detecting node with faulty readings is one of the important issues in WSNs. The weighted voting is usually used to detect faulty readings. Most of the existing algorithms use correlation of two nodes read vectors as weight to detect faulty readings, which result in ...

We present a real-time fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. The k-ary n-cube is augmented by spare nodes at stages one and two. We consider two modes of operations, one under heavy computation or hard deadline and the other under light computation or soft deadline. We assume that faulty nodes cannot compute, but retain their ability to com...

Labile blood pressure elevation is believed to have less clinical significance than "fixed hypertension." This assertion was examined in the Framingham cohort of 5209 men and women followed for 20 years for the development of cardiovascular events in relation to three routinely measured blood pressures at each of 10 biennial examinations. Variability of pressure judged from the standard deviati...

We consider broadcasting from a fault-free source to all nodes of a completely connected n-node network in the presence of k faulty nodes. Every node can communicate with at most one other node in a unit of time and during this period every pair of communicating nodes can exchange information packets. Faulty nodes can receive information but cannot send it. Broadcasting is adaptive, i.e. a node...