661 search results - page 124 / 133 » On Distributed Computation in Noisy Random Planar Networks |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
MOBICOM
2010
ACM
13 years 7 months ago
2010
ACM
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
TCS
2002
13 years 7 months ago
2002
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined...
CCS
2003
ACM
14 years 19 days ago
2003
ACM
Network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate “stepping stones” to conceal their identity and origin...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...