skip to main content
10.1145/1410012.1410038acmconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
poster

A note on the trackability of dynamic sensor networks

Published: 19 September 2008 Publication History

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.

References

[1]
James Aspnes, David Goldenberg, and Yang Richard Yang. On the computational complexity of sensor network localization. In Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, ALGOSENSORS 2004, Turku, Finland, July 16, 2004. Proceedings., volume 3121 of Lecture Notes in Computer Science, pages 32--44. Springer-Verlag, 2004.
[2]
P. BISWAS and Y. YE. Semidefinite programming for ad hoc wireless sensor network localization. In Information Processing In Sensor Networks, Proceedings of the third international symposium on Information processing in sensor networks, pages 46--54, Berkeley, Calif., 2004.
[3]
Michael W. Carter, Holly H. Jin, Michael A. Saunders, and Yinyu Ye. Spaseloc: An adaptive subproblem algorithm for scalable wireless sensor network localization. SIAM J. on Optimization, 17(4):1102--1128, 2006.
[4]
Y. DING, N. KRISLOCK, J. QIAN, and H. WOLKOWICZ. Sensor network localization, Euclidean distance matrix completions, and graph realization. Technical Report CORR 2006-23, accepted subject ro revision Nov./07, University of Waterloo, Waterloo, Ontario, 2006.
[5]
Bruce Hendrickson. Conditions for unique graph realizations. SIAM J. Comput., 21(1):65--84, 1992.
[6]
Bill Jackson and Tibor Jordán. Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory Ser. B, 94(1):1--29, 2005.
[7]
N. KRISLOCK, V. PICCIALLI, and H. WOLKOWICZ. Robust semidefinite programming approaches for sensor network localization with anchors. Technical Report CORR 2006--12, submitted April/06, University of Waterloo, Waterloo, Ontario, 2006.
[8]
A.M. SO and Y. YE. Theory of semidefinite programming for sensor network localization. Math. Programming, to appear, 2006.
[9]
Z. WANG, S. ZHENG, S. BOYD, and Y. YE. Further relaxations of the SDP approach to sensor network localization. Technical report, Stanford University, Stanford, CA, 2006.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
MELT '08: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments
September 2008
142 pages
ISBN:9781605581897
DOI:10.1145/1410012
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 September 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. infinitesimal rigidity
  2. semidefinite programming
  3. sensor network localization
  4. uniquely localizable

Qualifiers

  • Poster

Conference

MobiCom08
Sponsor:

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 154
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 27 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media