Force-directed approaches to sensor localization

Alon Efrat, David Forrester, Anand Iyer, Stephen G Kobourov, Cesim Erten, Ozan Kilic

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

As the number of applications of sensor networks increases, so does the interest in sensor network localization, that is, in recovering the correct position of each node in a network of sensors from partial connectivity information such as adjacency, range, or angle between neighboring nodes. In this article, we consider the anchor-free localization problem in sensor networks that report possibly noisy range information and angular information about the relative order of each sensor's neighbors. Previously proposed techniques seem to successfully reconstruct the original positions of the nodes for relatively small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with nonconvex or nonsimple underlying topology. Moreover, the distributed nature of the problem makes some of the centralized techniques inapplicable in distributed settings. To address these problems we describe a multiscale dead-reckoning (MSDR) algorithm that scales well for large networks, can reconstruct complex underlying topologies, and is resilient to noise. The MSDR algorithm takes its roots from classic force-directed graph layout computation techniques. These techniques are augmented with a multiscale extension to handle the scalability issue and with a dead-reckoning extension to overcome the problems arising with nonsimple topologies. Furthermore, we show that the distributed version of the MSDR algorithm performs as well as, if not better than, its centralized counterpart, as shown by the quality of the layout, measured in terms of the accuracy of the computed pairwise distances between sensors in the network.

Original languageEnglish (US)
Article number27
JournalACM Transactions on Sensor Networks
Volume7
Issue number3
DOIs
StatePublished - Sep 2010

Fingerprint

Sensor networks
Topology
Sensors
Directed graphs
Anchors
Scalability

Keywords

  • Force-directed
  • Node localization
  • Sensor networks

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Force-directed approaches to sensor localization. / Efrat, Alon; Forrester, David; Iyer, Anand; Kobourov, Stephen G; Erten, Cesim; Kilic, Ozan.

In: ACM Transactions on Sensor Networks, Vol. 7, No. 3, 27, 09.2010.

Research output: Contribution to journalArticle

Efrat, Alon ; Forrester, David ; Iyer, Anand ; Kobourov, Stephen G ; Erten, Cesim ; Kilic, Ozan. / Force-directed approaches to sensor localization. In: ACM Transactions on Sensor Networks. 2010 ; Vol. 7, No. 3.
@article{4ee8ad19b391407c879032e1fe9ff5a4,
title = "Force-directed approaches to sensor localization",
abstract = "As the number of applications of sensor networks increases, so does the interest in sensor network localization, that is, in recovering the correct position of each node in a network of sensors from partial connectivity information such as adjacency, range, or angle between neighboring nodes. In this article, we consider the anchor-free localization problem in sensor networks that report possibly noisy range information and angular information about the relative order of each sensor's neighbors. Previously proposed techniques seem to successfully reconstruct the original positions of the nodes for relatively small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with nonconvex or nonsimple underlying topology. Moreover, the distributed nature of the problem makes some of the centralized techniques inapplicable in distributed settings. To address these problems we describe a multiscale dead-reckoning (MSDR) algorithm that scales well for large networks, can reconstruct complex underlying topologies, and is resilient to noise. The MSDR algorithm takes its roots from classic force-directed graph layout computation techniques. These techniques are augmented with a multiscale extension to handle the scalability issue and with a dead-reckoning extension to overcome the problems arising with nonsimple topologies. Furthermore, we show that the distributed version of the MSDR algorithm performs as well as, if not better than, its centralized counterpart, as shown by the quality of the layout, measured in terms of the accuracy of the computed pairwise distances between sensors in the network.",
keywords = "Force-directed, Node localization, Sensor networks",
author = "Alon Efrat and David Forrester and Anand Iyer and Kobourov, {Stephen G} and Cesim Erten and Ozan Kilic",
year = "2010",
month = "9",
doi = "10.1145/1807048.1807057",
language = "English (US)",
volume = "7",
journal = "ACM Transactions on Sensor Networks",
issn = "1550-4859",
publisher = "Association for Computing Machinery (ACM)",
number = "3",

}

TY - JOUR

T1 - Force-directed approaches to sensor localization

AU - Efrat, Alon

AU - Forrester, David

AU - Iyer, Anand

AU - Kobourov, Stephen G

AU - Erten, Cesim

AU - Kilic, Ozan

PY - 2010/9

Y1 - 2010/9

N2 - As the number of applications of sensor networks increases, so does the interest in sensor network localization, that is, in recovering the correct position of each node in a network of sensors from partial connectivity information such as adjacency, range, or angle between neighboring nodes. In this article, we consider the anchor-free localization problem in sensor networks that report possibly noisy range information and angular information about the relative order of each sensor's neighbors. Previously proposed techniques seem to successfully reconstruct the original positions of the nodes for relatively small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with nonconvex or nonsimple underlying topology. Moreover, the distributed nature of the problem makes some of the centralized techniques inapplicable in distributed settings. To address these problems we describe a multiscale dead-reckoning (MSDR) algorithm that scales well for large networks, can reconstruct complex underlying topologies, and is resilient to noise. The MSDR algorithm takes its roots from classic force-directed graph layout computation techniques. These techniques are augmented with a multiscale extension to handle the scalability issue and with a dead-reckoning extension to overcome the problems arising with nonsimple topologies. Furthermore, we show that the distributed version of the MSDR algorithm performs as well as, if not better than, its centralized counterpart, as shown by the quality of the layout, measured in terms of the accuracy of the computed pairwise distances between sensors in the network.

AB - As the number of applications of sensor networks increases, so does the interest in sensor network localization, that is, in recovering the correct position of each node in a network of sensors from partial connectivity information such as adjacency, range, or angle between neighboring nodes. In this article, we consider the anchor-free localization problem in sensor networks that report possibly noisy range information and angular information about the relative order of each sensor's neighbors. Previously proposed techniques seem to successfully reconstruct the original positions of the nodes for relatively small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with nonconvex or nonsimple underlying topology. Moreover, the distributed nature of the problem makes some of the centralized techniques inapplicable in distributed settings. To address these problems we describe a multiscale dead-reckoning (MSDR) algorithm that scales well for large networks, can reconstruct complex underlying topologies, and is resilient to noise. The MSDR algorithm takes its roots from classic force-directed graph layout computation techniques. These techniques are augmented with a multiscale extension to handle the scalability issue and with a dead-reckoning extension to overcome the problems arising with nonsimple topologies. Furthermore, we show that the distributed version of the MSDR algorithm performs as well as, if not better than, its centralized counterpart, as shown by the quality of the layout, measured in terms of the accuracy of the computed pairwise distances between sensors in the network.

KW - Force-directed

KW - Node localization

KW - Sensor networks

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

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

U2 - 10.1145/1807048.1807057

DO - 10.1145/1807048.1807057

M3 - Article

VL - 7

JO - ACM Transactions on Sensor Networks

JF - ACM Transactions on Sensor Networks

SN - 1550-4859

IS - 3

M1 - 27

ER -