Sciweavers

338 search results - page 47 / 68
» Fast distributed random walks
Sort
View
74
Voted
IPPS
2006
IEEE
15 years 3 months ago
Preserving source location privacy in monitoring-based wireless sensor networks
While a wireless sensor network is deployed to monitor certain events and pinpoint their locations, the location information is intended only for legitimate users. However, an eav...
Yong Xi, Loren Schwiebert, Weisong Shi
CORR
2008
Springer
123views Education» more  CORR 2008»
14 years 9 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...
82
Voted
ICRA
2009
IEEE
185views Robotics» more  ICRA 2009»
15 years 4 months ago
Ad-hoc wireless network coverage with networked robots that cannot localize
— We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless ...
Nikolaus Correll, Jonathan Bachrach, Daniel Vicker...
108
Voted
EUROPAR
2009
Springer
14 years 7 months ago
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
Giorgos Georgiadis, Marina Papatriantafilou
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
15 years 2 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan