Results 1  10
of
700
Adaptive Broadcasting With Faulty Nodes
, 1996
"... We consider broadcasting from a faultfree source to all nodes of a completely connected nnode 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 packe ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We consider broadcasting from a faultfree source to all nodes of a completely connected nnode 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
Cycle Embedding in the Hypercube with Faulty Nodes
"... The hypercube is one of the most versatile and efficient interconnection networks yet discovered for parallel computation. In this paper, we show that a faultfree cycle of length of at least 2 n − 2f can be embedded in an n dimensional hypercube with f faulty nodes, where n ≥ 3 and 1 ≤ f ≤ 2n − 4. ..."
Abstract
 Add to MetaCart
The hypercube is one of the most versatile and efficient interconnection networks yet discovered for parallel computation. In this paper, we show that a faultfree cycle of length of at least 2 n − 2f can be embedded in an n dimensional hypercube with f faulty nodes, where n ≥ 3 and 1 ≤ f ≤ 2n − 4
On Boolean Decision Trees with Faulty Nodes
 In Random Structures and Algorithms
, 1994
"... We consider the problem of computing with faulty components in the context of the Boolean decision tree model, in which cost is measured by the number of input bits queried and the responses to queries are faulty with a fixed probability. We show that if f can be represented in kDNF form and in jC ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We consider the problem of computing with faulty components in the context of the Boolean decision tree model, in which cost is measured by the number of input bits queried and the responses to queries are faulty with a fixed probability. We show that if f can be represented in kDNF form and in j
Eviction of Misbehaving and Faulty Nodes in Vehicular Networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 2007
"... Vehicular networks (VNs) are emerging, among civilian applications, as a convincing instantiation of the mobile networking technology. However, security is a critical factor and a significant challenge to be met. Misbehaving or faulty network nodes have to be detected and prevented from disrupting n ..."
Abstract

Cited by 51 (6 self)
 Add to MetaCart
Vehicular networks (VNs) are emerging, among civilian applications, as a convincing instantiation of the mobile networking technology. However, security is a critical factor and a significant challenge to be met. Misbehaving or faulty network nodes have to be detected and prevented from disrupting
Broadcasting With a Bounded Fraction of Faulty Nodes
, 1995
"... We consider the problem of broadcasting a message from one node of a completely connected (n+1)node network to all other nodes. We adopt the 1port halfduplex model in which every node can communicate with at most one neighbor in a unit of time and during this period one of the communicating node ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
nodes can only send information and the other can only receive it. The source is faultfree but all other nodes are subject to permanent failures. A faulty node can receive the message but cannot relay it. The fraction of faulty modes is bounded by a constant. We consider nonadaptive broadcasting
Parallel Routing in Hypercube Networks with Faulty Nodes
 in IEEE International Conference on Parallel and Distributed Systems (ICPADS ’01
, 2000
"... The concept of strong faulttolerance was introduced to characterize the property of parallel routing [15]. A network G of degree d is said strongly faulttolerant if with at most d 2 faulty nodes, any two nodes u and v in G are connected by minfdeg f (u); deg f (v)g nodedisjoint paths, where deg ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The concept of strong faulttolerance was introduced to characterize the property of parallel routing [15]. A network G of degree d is said strongly faulttolerant if with at most d 2 faulty nodes, any two nodes u and v in G are connected by minfdeg f (u); deg f (v)g nodedisjoint paths, where deg
Faultfree Paths in Hypercubes with More Faulty Nodes
 PROC. OF THE 19TH WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATION THEORY
, 2008
"... Faults in a network may take various forms such as hardware/software errors, node/link faults, etc. In this paper, nodefaults are addressed. Let F be a faulty set of f ≤ 2n − 6 conditional nodefaults in an injured ncube Qn such that every node of Qn still has at least two faultfree neighbors. Th ..."
Abstract
 Add to MetaCart
Faults in a network may take various forms such as hardware/software errors, node/link faults, etc. In this paper, nodefaults are addressed. Let F be a faulty set of f ≤ 2n − 6 conditional nodefaults in an injured ncube Qn such that every node of Qn still has at least two faultfree neighbors
DPA to Rectify Transient Faulty Nodes in Effective Manner
"... Wireless sensor networks faces a number of challenges; a wireless sensor network which includes a number of sensor nodes must provide reliability and fault tolerance against a number of odds such as scalability, hardware, environmental conditions, power and energy factors. In this paper, we address ..."
Abstract
 Add to MetaCart
Wireless sensor networks faces a number of challenges; a wireless sensor network which includes a number of sensor nodes must provide reliability and fault tolerance against a number of odds such as scalability, hardware, environmental conditions, power and energy factors. In this paper, we address
Embedding of Rings in 2D Meshes and Tori with Faulty Nodes
 Journal of Systems Architecture
, 1997
"... To increase the reliability of networks embedded in meshes or tori and to allow their use in the presence of faulty nodes, efficient faulttolerant schemes in meshes and tori are necessary. In this paper, we present algorithms for embedding a ring in a meshtype and torustype multiprocessor network ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
To increase the reliability of networks embedded in meshes or tori and to allow their use in the presence of faulty nodes, efficient faulttolerant schemes in meshes and tori are necessary. In this paper, we present algorithms for embedding a ring in a meshtype and torustype multiprocessor
Distributed Faulty Node Detection and Isolation in Delaytolerant Vehicular Sensor Networks
"... Abstract—Distributed faulty node detection and isolation in metropolitanarea delaytolerant vehicular sensor networks are investigated in this paper. For the intermittently connected largescale dynamic networks, we design a practical faulty node detection algorithm that vehicles can perform on bo ..."
Abstract
 Add to MetaCart
Abstract—Distributed faulty node detection and isolation in metropolitanarea delaytolerant vehicular sensor networks are investigated in this paper. For the intermittently connected largescale dynamic networks, we design a practical faulty node detection algorithm that vehicles can perform
Results 1  10
of
700