Relative kinematics of an anchorless network

Abstract The estimation of the coordinates of nodes their proximity (or distance) measurements, is a principal challenge in numerous fields. Conventionally, when localizing a static network of immobile nodes, non-linear dimensionality reduction techniques are applied on the measured distances to obtain the relative coordinates up to a rotation and translation. In this article, we consider an anchorless network of mobile nodes, where the distance measurements between the mobile nodes are time-varying. In such an anchorless framework, where the absolute knowledge of any node position, motion or reference frame is absent, we aim to estimate the relative positions using the measured time-varying distances. To this end, we derive a data model which relates the time-varying distances to the time-varying relative positions of an anchorless network. Given this data model, we estimate the relative (position, velocity) and higher order derivatives, which are collectively termed as the relative kinematics of the anchorless network. The derived data model is inherently ill-posed, however under certain immobility constraints, we propose closed-form solutions to recursively estimate the relative kinematics. For the sake of completeness, we also estimate the absolute node kinematics, given reference anchors. Theoretical bounds are derived, and simulations are conducted to benchmark the performance of proposed solutions.

[1]  Alle-Jan van der Veen,et al.  Joint motion estimation and clock synchronization for a wireless network of mobile nodes , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[2]  Yunhao Liu,et al.  Locating in fingerprint space: wireless indoor localization with little human intervention , 2012, Mobicom '12.

[3]  Geert Leus,et al.  Distributed Maximum Likelihood Sensor Network Localization , 2013, IEEE Transactions on Signal Processing.

[4]  Alle-Jan van der Veen,et al.  Joint Ranging and Synchronization for an Anchorless Network of Mobile Nodes , 2014, IEEE Transactions on Signal Processing.

[5]  Qun Wan,et al.  Multidimensional Scaling Analysis for Passive Moving Target Localization With TDOA and FDOA Measurements , 2010, IEEE Transactions on Signal Processing.

[6]  R. Bhatia,et al.  How and Why to Solve the Operator Equation AX−XB = Y , 1997 .

[7]  R. Rajan Relative Space-Time Kinematics of an Anchorless Network , 2016 .

[8]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[9]  Danna Zhou,et al.  d. , 1934, Microbial pathogenesis.

[10]  Karl F. MacDorman,et al.  Human emotion and the uncanny valley: A GLM, MDS, and Isomap analysis of robot video ratings , 2008, 2008 3rd ACM/IEEE International Conference on Human-Robot Interaction (HRI).

[11]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[12]  Wen-Wei Lin,et al.  On the ⋆-Sylvester equation AX ± X⋆ B⋆ = C , 2012, Appl. Math. Comput..

[13]  Thilo Penzl,et al.  Numerical solution of generalized Lyapunov equations , 1998, Adv. Comput. Math..

[14]  Richard H. Bartels,et al.  Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] , 1972, Commun. ACM.

[15]  Charles L. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[16]  Forrest W. Young Multidimensional Scaling: History, Theory, and Applications , 1987 .

[17]  Albert-Jan Boonstra,et al.  Space-based aperture array for ultra-long wavelength radio astronomy , 2015, 1505.04711.

[18]  H. W. Braden,et al.  The Equations ATX\pm XTA=B , 1999, SIAM J. Matrix Anal. Appl..

[19]  C. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[20]  Geert Leus,et al.  Dynamic Multidimensional Scaling for Low-Complexity Mobile Network Tracking , 2012, IEEE Transactions on Signal Processing.

[21]  Maja J. Mataric,et al.  A spatio-temporal extension to Isomap nonlinear dimension reduction , 2004, ICML.

[22]  Dimitris K. Agrafiotis,et al.  Multidimensional scaling and visualization of large molecular similarity tables , 2001, J. Comput. Chem..

[23]  B. C. Ng,et al.  On the Cramer-Rao bound under parametric constraints , 1998, IEEE Signal Processing Letters.

[24]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[25]  Wheeler Ruml,et al.  Improved MDS-based localization , 2004, IEEE INFOCOM 2004.

[26]  Gene H. Golub,et al.  Tikhonov Regularization and Total Least Squares , 1999, SIAM J. Matrix Anal. Appl..

[27]  G. Golub,et al.  A Hessenberg-Schur method for the problem AX + XB= C , 1979 .

[28]  J. H. Hodges Some matrix equations over a finite field , 1957 .

[29]  Bernard Tourancheau,et al.  MPI in Wireless Sensor Networks , 2008, PVM/MPI.

[30]  R.L. Moses,et al.  Locating the nodes: cooperative localization in wireless sensor networks , 2005, IEEE Signal Processing Magazine.

[31]  K. Chu Symmetric solutions of linear matrix equations by matrix decompositions , 1989 .

[32]  Geert Leus,et al.  Joint relative position and velocity estimation for an anchorless network of mobile nodes , 2015, Signal Process..

[33]  S. Kay Fundamentals of statistical signal processing: estimation theory , 1993 .

[34]  Alfred O. Hero,et al.  Relative location estimation in wireless sensor networks , 2003, IEEE Trans. Signal Process..

[35]  Brant E Fries,et al.  Measuring depression in nursing home residents with the MDS and GDS: an observational psychometric study , 2005, BMC Geriatrics.

[36]  Tongxing Lu,et al.  Solution of the matrix equation AX−XB=C , 2005, Computing.

[37]  Winston Khoon Guan Seah,et al.  Localization in underwater sensor networks: survey and challenges , 2006, Underwater Networks.