Sparse multidimensional scaling for blind tracking in sensor networks

1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, we consider the problem of tracking a moving target using sensor network measurements. We assume no prior knowledge of the sensor locations and so we refer to this tracking as 'blind'. We use the distributed weighted multidimensional scaling (dwMDS) algorithm to obtain estimates of the sensor positions. Since dwMDS can only find sensor position estimates up to rotation and translation, there is a need for alignment of sensor positions from one time frame to another. We introduce a sparsity constraint to dwMDS to align current time sensor positions estimates with those of the previous time frame. In the presence of a target, location estimates of sensors in the vicinity of the target will vary from their initial values. We use this phenomenon to perform link level tracking relative to the initially estimated sensor locations. © 2008 Springer-Verlag US.

Cite

CITATION STYLE

APA

Rangarajan, R., Raich, R., & Iii, A. O. H. (2008). Sparse multidimensional scaling for blind tracking in sensor networks. In Networked Sensing Information and Control (pp. 39–60). Springer US. https://doi.org/10.1007/978-0-387-68845-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free