109 search results - page 6 / 22 » Faulty Random Geometric Networks |
INTERSENSE
2006
ACM
14 years 3 months ago
2006
ACM
— In this paper, we consider the sensor replacement problem in hybrid wireless sensor networks composed of mobile and static sensors. Mobility equipped mobile sensors are utilize...
ISPDC
2008
IEEE
14 years 4 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
MST
2000
13 years 9 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
TMC
2011
13 years 4 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
SPAA
2005
ACM
14 years 3 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...