Sciweavers

3047 search results - page 367 / 610
» Randomized Parallel Selection
Sort
View
OPODIS
2010
15 years 29 days ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
EUROPAR
2009
Springer
15 years 26 days 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
PODC
2011
ACM
14 years 5 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
CLUSTER
2011
IEEE
14 years 2 months ago
Incorporating Network RAM and Flash into Fast Backing Store for Clusters
—We present Nswap2L, a fast backing storage system for general purpose clusters. Nswap2L implements a single device interface on top of multiple heterogeneous physical storage de...
Tia Newhall, Douglas Woos
ICDCS
2011
IEEE
14 years 2 months ago
JR-SND: Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks
Abstract—Secure neighbor discovery is fundamental to mobile ad hoc networks (MANETs) deployed in hostile environments and refers to the process in which two neighboring nodes exc...
Rui Zhang 0007, Yanchao Zhang, Xiaoxia Huang