Sciweavers

270 search results - page 30 / 54
» Fault Detection in Routing Protocols
Sort
View
DIALM
2005
ACM
100views Algorithms» more  DIALM 2005»
13 years 10 months ago
On the pitfalls of geographic face routing
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
FGCS
2010
76views more  FGCS 2010»
13 years 6 months ago
Self-healing network for scalable fault-tolerant runtime environments
Scalable and fault tolerant runtime environments are needed to support and adapt to the underlying libraries and hardware which require a high degree of scalability in dynamic larg...
Thara Angskun, Graham E. Fagg, George Bosilca, Jel...
DCOSS
2010
Springer
13 years 11 months ago
Data Spider: A Resilient Mobile Basestation Protocol for Efficient Data Collection in Wireless Sensor Networks
Traditional deployments of wireless sensor networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, su...
Onur Soysal, Murat Demirbas
FORTE
2003
13 years 9 months ago
Correct Passive Testing Algorithms and Complete Fault Coverage
The aim of passive testing is to detect faults in a system while observing the system during normal operation, that is, without forcing the system to specialized inputs explicitly ...
Arun N. Netravali, Krishan K. Sabnani, Ramesh Visw...
DFT
2005
IEEE
132views VLSI» more  DFT 2005»
13 years 10 months ago
Low Power BIST Based on Scan Partitioning
A built-in self-test (BIST) scheme is presented which both reduces overhead for detecting random-pattern-resistant (r.p.r.) faults as well as reduces power consumption during test...
Jinkyu Lee, Nur A. Touba