661 search results - page 48 / 133 » On Distributed Computation in Noisy Random Planar Networks |
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...
JSAC
2008
14 years 9 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
159
click to vote
CLUSTER
2011
IEEE
13 years 9 months ago
2011
IEEE
In the last decade, numerous efforts have been devoted to design efficient algorithms for clustering the wireless mobile ad‐hoc networks (MANET) consider...
ACSC
2005
IEEE
15 years 3 months ago
2005
IEEE
We examine the robustness of critical infrastructure networks in the face of terrorist attack, using a simulation experiment that incorporates link capacity; and an extension of d...