109 search results - page 5 / 22 » Faulty Random Geometric Networks |
ICPP
2002
IEEE
14 years 2 months ago
2002
IEEE
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...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract-- We investigate cascade dynamics in thresholdcontrolled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, ...
WOWMOM
2009
ACM
14 years 4 months ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract—In wireless networks with random node distribution, the underlying point process model and the channel fading process are usually considered separately. A unified frame...