2149 search results - page 403 / 430 » Distributed Algorithms for Approximating Wireless Network Ca... |
110
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
ICDCS
2006
IEEE
15 years 7 months ago
2006
IEEE
Network coordinates provide a scalable way to estimate latencies among large numbers of hosts. While there are several algorithms for producing coordinates, none account for the f...
116
click to vote
MOBISYS
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we present a reliable storage service, called SolarStore, that adaptively trades-off storage reliability versus energy consumption in solar-powered sensor networks....
211
click to vote
GIS
2005
ACM
16 years 2 months ago
2005
ACM
Information about dynamic spatial fields, such as temperature, windspeed, or the concentration of gas pollutant in the air, is important for many environmental applications. At th...
138
click to vote
GI
2004
Springer
15 years 6 months ago
2004
Springer
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...