Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1010.2262

On Sensor Network Localization Using SDP Relaxation

Davood Shamsi·Nicole Taheri·Zhisu Zhu·Yinyu Ye
View original source ↗Read source document ↗Export metadata ↓

Abstract

A Semidefinite Programming (SDP) relaxation is an effective computational method to solve a Sensor Network Localization problem, which attempts to determine the locations of a group of sensors given the distances between some of them [11]. In this paper, we analyze and determine new sufficient conditions and formulations that guarantee that the SDP relaxation is exact, i.e., gives the correct solution. These conditions can be useful for designing sensor networks and managing connectivities in practice. Our main contribution is twofold: We present the first non-asymptotic bound on the connectivity or radio range requirement of the sensors in order to ensure the network is uniquely localizable. Determining this range is a key component in the design of sensor networks, and we provide a result that leads to a correct localization of each sensor, for any number of sensors. Second, we introduce a new class of graphs that can always be correctly localized by an SDP relaxation. Specifically, we show that adding a simple objective function to the SDP relaxation model will ensure that the solution is correct when applied to a triangulation graph. Since triangulation graphs are very sparse, this is informationally efficient, requiring an almost minimal amount of distance information. We also analyze a number objective functions for the SDP relaxation to solve the localization problem for a general graph.

Explore related subjects

math.MGcs.DSmath.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Davood Shamsi, Nicole Taheri, Zhisu Zhu, Yinyu Ye. 2012-11-15. On Sensor Network Localization Using SDP Relaxation. https://arxiv.org/abs/1010.2262

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The disjoint disks property for Busemann $G$-spaces

We prove that every finite-dimensional Busemann \(G\)-space of dimension at least five has the disjoint disks property (DDP). For a sufficiently small metric sphere \(L=S(c,r)\), we show that every embedded arc contained in an exact distance level is a homotopical \(Z_2\)-set in \(L\). It follows that \(L\) has the disjoint arc-disk property and the disjoint homotopies property. Daverman's product theorem then gives DDP for \(L\times\mathbb R\), and a local avoidance argument at the center yields DDP for the ambient \(G\)-space. Since finite-dimensional Busemann \(G\)-spaces are generalized manifolds, in dimensions at least five the remaining obstruction to the Busemann conjecture is the resolution problem.

math.MG↗
arXiv2026

Every Compact Metric Space Is Isometrically Embeddable into the Gromov-Hausdorff Space

Let $(\mathcal{M},d_{\mathrm{GH}})$ denote the Gromov-Hausdorff space of isometry classes of nonempty compact metric spaces. We prove that every nonempty compact metric space is isometrically embeddable into $(\mathcal{M},d_{\mathrm{GH}})$. More precisely, for every $D>0$ and every nonempty compact metric space $K$ with $\operatorname{diam} K\le D$, we realize the space of all $1$-Lipschitz functions on $K$ with values in $[0,D]$ as a family of metrics on a fixed Cantor space. Under this realization, the Gromov-Hausdorff distance agrees exactly with the uniform distance between functions, and each resulting metric space has diameter at most $76D$. We also construct finite approximations for which the Gromov-Hausdorff distance is given by an exact formula, together with a uniform approximation estimate.

math.MG↗
arXiv2026

Measure contraction property on isometric leaves and monotone fibres

For finite measures with positive densities on convex Euclidean supports, we prove that $MCP(κ,N)$ passes with unchanged parameters to almost every isometric leaf of an arbitrary nonexpansive map. The proof rests on a sharp contraction inequality for geometric conditional densities, with exponent equal to the leaf codimension. The inherited dimension parameter is optimal. A total-variation limit on resolvent graphs extends the result to inverse fibres of maximal monotone relations, including convex gradient fibres. We also disprove Klartag's curvature-dimension inheritance conjecture by a firmly nonexpansive example in dimension three and a gradient example in dimension four. In codimension one, affinity of the geometric density yields curvature-dimension inheritance. The first example also gives failure on monotone fibres. Both constructions admit arbitrarily large curvature loss, including for a fixed Gaussian ambient measure on families of leaves of positive quotient measure.

math.MG↗