Sciweavers

52 search results - page 10 / 11
» Sparse Networks Tolerating Random Faults
Sort
View
ADHOCNOW
2009
Springer
13 years 6 months ago
An Efficient and Scalable Address Autoconfiguration in Mobile Ad Hoc Networks
Several protocols of address autoconfiguration in the mobile ad hoc network (MANET) are present in the current literature. Although some of these protocols perform decently in spar...
Syed Rafiul Hussain, Subrata Saha, Ashikur Rahman
ICPP
2002
IEEE
13 years 10 months ago
ART: Robustness of Meshes and Tori for Parallel and Distributed Computation
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
Chi-Hsiang Yeh, Behrooz Parhami
RANDOM
1998
Springer
13 years 9 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
P2P
2007
IEEE
161views Communications» more  P2P 2007»
13 years 11 months ago
The BitCod Client: A BitTorrent Clone using Network Coding
Network coding is an emerging field of research with sound and mature theory supporting it. Recent works shows that it has many benefits like improved fault tolerance, higher ...
Danny Bickson, Roy Borer
MOBIHOC
2005
ACM
14 years 4 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee