MSDR-D network localization algorithm

Kevin Coogan, Varun Khare, Stephen G. Kobourov, Bastian Katz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations


We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. The algorithm is anchor-free and does not require particular network topology, rigidity of the underlying communication graph, or high average connectivity. The algorithm scales well to large and sparse networks with complex topologies and outperforms previous algorithms when the noise levels are high. The algorithm is simple to implement and is available, along with source code, executables, and experimental results, at http://msdr-d.cs.

Original languageEnglish (US)
Title of host publicationAlgorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Revised Selected Papers
Number of pages13
ISBN (Print)3642169872, 9783642169878
StatePublished - 2010
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6451 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'MSDR-D network localization algorithm'. Together they form a unique fingerprint.

Cite this