Sciweavers

97 search results - page 8 / 20
» Some Timestamping Protocol Failures
Sort
View
AINA
2007
IEEE
14 years 1 months ago
A Distributed and Dynamic Data Gathering Protocol for Sensor Networks
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor n...
Hüseyin Özgür Tan, Ibrahim Korpeogl...
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 7 months ago
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
Amit M. Bhosle, Teofilo F. Gonzalez
PPL
2000
110views more  PPL 2000»
13 years 7 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
ETFA
2006
IEEE
13 years 11 months ago
Verification of The Minimum Cost Forwarding Protocol for Wireless Sensor Networks
Wireless sensor networks (WSN) consist of small self-contained devices with computational, sensing and wireless communication capabilities. They allow flexible, powerful, tetherles...
William D. Henderson, Steven Tron
DSN
2008
IEEE
14 years 1 months ago
Byzantine replication under attack
Existing Byzantine-resilient replication protocols satisfy two standard correctness criteria, safety and liveness, in the presence of Byzantine faults. In practice, however, fault...
Yair Amir, Brian A. Coan, Jonathan Kirsch, John La...