A note on the trackability of dynamic sensor networks

  • Authors:

  • Yichuan Ding

  • Affiliations:

  • Stanford University, Stanford, CA, USA

  • Venue:
  • Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Since the last decade, Semidefinite programming (SDP) has found its important application in locating the ad hoc wireless sensor networks. By choosing proper decomposition and computation schemes, SDP has been shown very efficient to handle the localization problem. Previous research also has shown that the SDP locates the sensor networks in Rd correctly provided the underlying framework is strong uniquely localizable. In this paper, we consider the localization problem in a more general and practical scenario, that is, the sensors are in movement following a certain trajectory. We show that given the initial position of each sensor and the instantaneous distance data, the dynamic sensor networks can be can be tracked correctly in the near future when the underlying framework is infinitesimal rigid and the trajectories of the sensors are subject to mild conditions. Our result also provides a way to approximate the sensor trajectories using Taylor series based on the distance data.