Sparsity-Exploiting Anchor Placement for Localization in Sensor Networks

Abstract

We consider the anchor placement problem in localization based on one-way ranging, in which either the sensor or the anchors send the ranging signals. The number of anchors deployed over a geographical area is generally sparse, and we show that the anchor placement can be formulated as the design of a sparse selection vector. Interestingly, the case in which the anchors send the ranging signals, results in a joint ranging energy optimization and anchor placement problem. We make abstraction of the localization algorithm and instead use the Cramér-Rao lower bound (CRB) as the performance constraint. The anchor placement problem is formulated as an elegant convex optimization problem which can be solved efficiently.

5 pages, 2 figures, submitted to EUSIPCO 2013 conference

References in corpus (3)

• A weakly informative default prior distribution for logistic and other regression models
• The prior can generally only be understood in the context of the likelihood
• A class of covariate-dependent spatiotemporal covariance functions for the analysis of daily ozone concentration

Cited by in corpus (4)

• Sensor placement by maximal projection on minimum eigenspace for linear inverse problems
• Sensor scheduling with time, energy and communication constraints
• Rigid Body Localization Using Sensor Networks: Position and Orientation Estimation
• Collision Tolerant Packet Scheduling for Underwater Acoustic Localization