184 search results - page 21 / 37 » Communication in Networks with Random Dependent Faults |
116
click to vote
ICDCN
2011
Springer
14 years 1 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
PERCOM
2010
ACM
14 years 11 months ago
2010
ACM
This paper addresses the problem of engineering energy-efficient target detection applications using unattended Wireless Sensor Networks (WSNs) for long-lasting surveillance of are...
VTC
2010
IEEE
14 years 8 months ago
2010
IEEE
— Systematic Luby Transform (SLT) codes constitute rateless codes, which are capable of adaptively adjusting their code rate depending on the channel quality without any explicit...
ATC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Jgroup/ARM is a middleware for developing and operating dependable distributed Java applications. Jgroup integrates the distributed object model of Java RMI with the obje...
MSN
2007
Springer
15 years 3 months ago
2007
Springer
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault toleranc...