Graph theoretic techniques in the analysis of uniquely localizable sensor networks

Bill Jackson, T. Jordán

Research output: Chapter in Book/Report/Conference proceedingChapter

16 Citations (Scopus)

Abstract

In the network localization problem the goal is to determine the location of all nodes by using only partial information on the pairwise distances (and by computing the exact location of some nodes, called anchors). The network is said to be uniquely localizable if there is a unique set of locations consistent with the given data. Recent results from graph theory and combinatorial rigidity made it possible to characterize uniquely localizable networks in two dimensions. Based on these developments, extensions, related optimization problems, algorithms, and constructions also became tractable. This chapter gives a detailed survey of these new results from the graph theorist's viewpoint.

Original languageEnglish
Title of host publicationLocalization Algorithms and Strategies for Wireless Sensor Networks
PublisherIGI Global
Pages146-173
Number of pages28
ISBN (Print)9781605663968
DOIs
Publication statusPublished - 2009

Fingerprint

Sensor networks
Graph theory
Anchors
Rigidity

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Jackson, B., & Jordán, T. (2009). Graph theoretic techniques in the analysis of uniquely localizable sensor networks. In Localization Algorithms and Strategies for Wireless Sensor Networks (pp. 146-173). IGI Global. https://doi.org/10.4018/978-1-60566-396-8.ch006

Graph theoretic techniques in the analysis of uniquely localizable sensor networks. / Jackson, Bill; Jordán, T.

Localization Algorithms and Strategies for Wireless Sensor Networks. IGI Global, 2009. p. 146-173.

Research output: Chapter in Book/Report/Conference proceedingChapter

Jackson, B & Jordán, T 2009, Graph theoretic techniques in the analysis of uniquely localizable sensor networks. in Localization Algorithms and Strategies for Wireless Sensor Networks. IGI Global, pp. 146-173. https://doi.org/10.4018/978-1-60566-396-8.ch006
Jackson B, Jordán T. Graph theoretic techniques in the analysis of uniquely localizable sensor networks. In Localization Algorithms and Strategies for Wireless Sensor Networks. IGI Global. 2009. p. 146-173 https://doi.org/10.4018/978-1-60566-396-8.ch006
Jackson, Bill ; Jordán, T. / Graph theoretic techniques in the analysis of uniquely localizable sensor networks. Localization Algorithms and Strategies for Wireless Sensor Networks. IGI Global, 2009. pp. 146-173
@inbook{a4b912767aed4b7faa70dba3f9810b22,
title = "Graph theoretic techniques in the analysis of uniquely localizable sensor networks",
abstract = "In the network localization problem the goal is to determine the location of all nodes by using only partial information on the pairwise distances (and by computing the exact location of some nodes, called anchors). The network is said to be uniquely localizable if there is a unique set of locations consistent with the given data. Recent results from graph theory and combinatorial rigidity made it possible to characterize uniquely localizable networks in two dimensions. Based on these developments, extensions, related optimization problems, algorithms, and constructions also became tractable. This chapter gives a detailed survey of these new results from the graph theorist's viewpoint.",
author = "Bill Jackson and T. Jord{\'a}n",
year = "2009",
doi = "10.4018/978-1-60566-396-8.ch006",
language = "English",
isbn = "9781605663968",
pages = "146--173",
booktitle = "Localization Algorithms and Strategies for Wireless Sensor Networks",
publisher = "IGI Global",

}

TY - CHAP

T1 - Graph theoretic techniques in the analysis of uniquely localizable sensor networks

AU - Jackson, Bill

AU - Jordán, T.

PY - 2009

Y1 - 2009

N2 - In the network localization problem the goal is to determine the location of all nodes by using only partial information on the pairwise distances (and by computing the exact location of some nodes, called anchors). The network is said to be uniquely localizable if there is a unique set of locations consistent with the given data. Recent results from graph theory and combinatorial rigidity made it possible to characterize uniquely localizable networks in two dimensions. Based on these developments, extensions, related optimization problems, algorithms, and constructions also became tractable. This chapter gives a detailed survey of these new results from the graph theorist's viewpoint.

AB - In the network localization problem the goal is to determine the location of all nodes by using only partial information on the pairwise distances (and by computing the exact location of some nodes, called anchors). The network is said to be uniquely localizable if there is a unique set of locations consistent with the given data. Recent results from graph theory and combinatorial rigidity made it possible to characterize uniquely localizable networks in two dimensions. Based on these developments, extensions, related optimization problems, algorithms, and constructions also became tractable. This chapter gives a detailed survey of these new results from the graph theorist's viewpoint.

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

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

U2 - 10.4018/978-1-60566-396-8.ch006

DO - 10.4018/978-1-60566-396-8.ch006

M3 - Chapter

AN - SCOPUS:84863728604

SN - 9781605663968

SP - 146

EP - 173

BT - Localization Algorithms and Strategies for Wireless Sensor Networks

PB - IGI Global

ER -