Results 1  10
of
2,756,891
Local Approximation Schemes for Topology Control
 IN: PROC. OF THE 25 TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC). (2006
, 2006
"... This paper presents a distributed algorithm on wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a linear size, lightweight, (1 + ε)spanner for any given ε> 0. A wireless network is modeled by a ddimensional αquasi unit ball graph ( ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
This paper presents a distributed algorithm on wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a linear size, lightweight, (1 + ε)spanner for any given ε> 0. A wireless network is modeled by a ddimensional αquasi unit ball graph (αUBG), which is a higher dimensional generalization of the standard unit disk graph (UDG) model. The ddimensional αUBG model goes beyond the unrealistic “flat world ” assumption of UDGs and also takes into account transmission errors, fading signal strength, and physical obstructions. The main result in the paper is this: for any fixed ε> 0, 0 < α ≤ 1, and d ≥ 2 there is a distributed algorithm running in O(log n·log ∗ n) communication rounds on an nnode, ddimensional αUBG G that computes a (1+ε)spanner G ′ of G with maximum degree ∆(G ′ ) = O(1) and total weight w(G ′ ) = O(w(MST (G)). This result is motivated by the topology control problem in wireless adhoc networks and improves on existing topology control algorithms along several dimensions. The technical contributions of the paper include a new, sequential, greedy algorithm with relaxed edge ordering and lazy updating, and clustering techniques for filtering out unnecessary edges.
Local approximation schemes for ad hoc and sensor networks
 In Proc. 3rd Joint Workshop on Foundations of Mobile Computing (DialMPOMC
, 2005
"... We present two local approaches that yield polynomialtime approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1 + ε)approximation to the problems at hand for any given ε> 0. ..."
Abstract

Cited by 39 (9 self)
 Add to MetaCart
We present two local approaches that yield polynomialtime approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1 + ε)approximation to the problems at hand for any given ε> 0
An Optimal Localized Approximation Scheme for Euclidean MST
"... We consider the problem of locally constructing a spanning subgraph that approximates the Euclidean minimum spanning tree of a unit disk graph. We show that for any k ≥ 2 there exists a klocalized distributed algorithm that, given a unit disk graph U in the plane, constructs a planar subgraph of U ..."
Abstract
 Add to MetaCart
We consider the problem of locally constructing a spanning subgraph that approximates the Euclidean minimum spanning tree of a unit disk graph. We show that for any k ≥ 2 there exists a klocalized distributed algorithm that, given a unit disk graph U in the plane, constructs a planar subgraph of U
Localitysensitive hashing scheme based on pstable distributions
 In SCG ’04: Proceedings of the twentieth annual symposium on Computational geometry
, 2004
"... inÇÐÓ�Ò We present a novel LocalitySensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate ..."
Abstract

Cited by 513 (10 self)
 Add to MetaCart
inÇÐÓ�Ò We present a novel LocalitySensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate
Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes
 J. COMP. PHYS
, 1981
"... Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution ..."
Abstract

Cited by 959 (2 self)
 Add to MetaCart
Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution
Loopy Belief Propagation for Approximate Inference: An Empirical Study
 In Proceedings of Uncertainty in AI
, 1999
"... Recently, researchers have demonstrated that "loopy belief propagation"  the use of Pearl's polytree algorithm in a Bayesian network with loops  can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performa ..."
Abstract

Cited by 680 (18 self)
 Add to MetaCart
limit performance of "Turbo Codes"  codes whose decoding algorithm is equivalent to loopy belief propagation in a chainstructured Bayesian network. In this paper we ask: is there something special about the errorcorrecting code context, or does loopy propagation work as an approximate
Random key predistribution schemes for sensor networks
 IN PROCEEDINGS OF THE 2003 IEEE SYMPOSIUM ON SECURITY AND PRIVACY
, 2003
"... Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. We present three new mechanisms for key establishment using the ..."
Abstract

Cited by 813 (14 self)
 Add to MetaCart
the framework of predistributing a random set of keys to each node. First, in the qcomposite keys scheme, we trade off the unlikeliness of a largescale network attack in order to significantly strengthen random key predistribution’s strength against smallerscale attacks. Second, in the multipath
Results 1  10
of
2,756,891