Sciweavers

102 search results - page 17 / 21
» A Step Towards Fault Tolerance for Multi-Agent Systems
Sort
View
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
13 years 11 months ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya
OPODIS
2010
13 years 5 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
CANS
2009
Springer
132views Cryptology» more  CANS 2009»
13 years 11 months ago
Fully Robust Tree-Diffie-Hellman Group Key Exchange
We extend the well-known Tree-Diffie-Hellman technique used for the design of group key exchange (GKE) protocols with robustness, i.e. with resistance to faults resulting from poss...
Timo Brecher, Emmanuel Bresson, Mark Manulis
DATE
2002
IEEE
96views Hardware» more  DATE 2002»
14 years 13 days ago
A Linear-Centric Simulation Framework for Parametric Fluctuations
The relative tolerances for interconnect and device parameter variations have not scaled with feature sizes which have brought about significant performance variability. As we sca...
Emrah Acar, Sani R. Nassif, Lawrence T. Pileggi
OPODIS
2008
13 years 9 months ago
Byzantine Consensus with Unknown Participants
Abstract. Consensus is a fundamental building block used to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being ...
Eduardo Adílio Pelinson Alchieri, Alysson N...