Sciweavers

1969 search results - page 230 / 394
» Financial Theory 1
Sort
View
IPSN
2007
Springer
16 years 2 days ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
PODC
2006
ACM
15 years 12 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
CCGRID
2005
IEEE
15 years 11 months ago
Evaluating high-throughput reliable multicast for grid applications in production networks
Grid computing can be characterized as a distributed infrastructure that is a collection of computing resources within or across locations that are aggregated to act as a unified ...
Marinho P. Barcellos, Maziar Nekovee, M. Koyabe, M...
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
15 years 11 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze
MOBICOM
2003
ACM
15 years 11 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas