MSDR-D network localization algorithm

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

doi:10.1007/978-3-642-16988-5_13

MSDR-D network localization algorithm

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Scopus citations

Abstract

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. arizona.edu/.

Original language	English (US)
Title of host publication	Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Revised Selected Papers
Publisher	Springer-Verlag
Pages	148-160
Number of pages	13
ISBN (Print)	3642169872, 9783642169878
DOIs	https://doi.org/10.1007/978-3-642-16988-5_13
State	Published - 2010
Externally published	Yes

Publication series

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

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-16988-5_13

Cite this

Coogan, K., Khare, V., Kobourov, S. G., & Katz, B. (2010). MSDR-D network localization algorithm. In Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Revised Selected Papers (pp. 148-160). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6451 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-642-16988-5_13

MSDR-D network localization algorithm. / Coogan, Kevin; Khare, Varun; Kobourov, Stephen G. et al.
Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Revised Selected Papers. Springer-Verlag, 2010. p. 148-160 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6451 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Coogan, K, Khare, V, Kobourov, SG & Katz, B 2010, MSDR-D network localization algorithm. in Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6451 LNCS, Springer-Verlag, pp. 148-160. https://doi.org/10.1007/978-3-642-16988-5_13

Coogan K, Khare V, Kobourov SG, Katz B. MSDR-D network localization algorithm. In Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Revised Selected Papers. Springer-Verlag. 2010. p. 148-160. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-16988-5_13

Coogan, Kevin ; Khare, Varun ; Kobourov, Stephen G. et al. / MSDR-D network localization algorithm. Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Revised Selected Papers. Springer-Verlag, 2010. pp. 148-160 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{59a06f6c76b84a619582f32957b56e6a,

title = "MSDR-D network localization algorithm",

abstract = "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. arizona.edu/.",

author = "Kevin Coogan and Varun Khare and Kobourov, {Stephen G.} and Bastian Katz",

year = "2010",

doi = "10.1007/978-3-642-16988-5_13",

language = "English (US)",

isbn = "3642169872",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "148--160",

booktitle = "Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Revised Selected Papers",

}

TY - GEN

T1 - MSDR-D network localization algorithm

AU - Coogan, Kevin

AU - Khare, Varun

AU - Kobourov, Stephen G.

AU - Katz, Bastian

PY - 2010

Y1 - 2010

N2 - 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. arizona.edu/.

AB - 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. arizona.edu/.

UR - http://www.scopus.com/inward/record.url?scp=85037539645&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85037539645&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-16988-5_13

DO - 10.1007/978-3-642-16988-5_13

M3 - Conference contribution

AN - SCOPUS:85037539645

SN - 3642169872

SN - 9783642169878

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 148

EP - 160

BT - Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Revised Selected Papers

PB - Springer-Verlag

ER -

MSDR-D network localization algorithm

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this