Force-directed approaches to sensor localization

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

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

15 Citations (Scopus)

Abstract

We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information about the relative order of each sensor's neighbors. We experimented with classic and new force-directed techniques. The classic techniques work well for small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with noisy data. We describe a new force-directed technique, based on a multi-scale dead-reckoning, that scales well for large networks, is resilient under range errors, and can reconstruct complex underlying regions.

Original languageEnglish (US)
Title of host publicationProceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
Pages108-118
Number of pages11
Volume2006
StatePublished - 2006
Event8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics - Miami, FL, United States
Duration: Jan 21 2006Jan 21 2006

Other

Other8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
CountryUnited States
CityMiami, FL
Period1/21/061/21/06

Fingerprint

Sensors
Anchors
Sensor networks

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Efrat, A., Forrester, D., Iyer, A., Kobourov, S. G., & Erten, C. (2006). Force-directed approaches to sensor localization. In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics (Vol. 2006, pp. 108-118)

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

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. Vol. 2006 2006. p. 108-118.

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

Efrat, A, Forrester, D, Iyer, A, Kobourov, SG & Erten, C 2006, Force-directed approaches to sensor localization. in Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. vol. 2006, pp. 108-118, 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics, Miami, FL, United States, 1/21/06.
Efrat A, Forrester D, Iyer A, Kobourov SG, Erten C. Force-directed approaches to sensor localization. In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. Vol. 2006. 2006. p. 108-118
Efrat, Alon ; Forrester, David ; Iyer, Anand ; Kobourov, Stephen G ; Erten, Cesim. / Force-directed approaches to sensor localization. Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. Vol. 2006 2006. pp. 108-118
@inproceedings{a089d9b92d8f4925aa0b75cbf5fcbf02,
title = "Force-directed approaches to sensor localization",
abstract = "We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information about the relative order of each sensor's neighbors. We experimented with classic and new force-directed techniques. The classic techniques work well for small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with noisy data. We describe a new force-directed technique, based on a multi-scale dead-reckoning, that scales well for large networks, is resilient under range errors, and can reconstruct complex underlying regions.",
author = "Alon Efrat and David Forrester and Anand Iyer and Kobourov, {Stephen G} and Cesim Erten",
year = "2006",
language = "English (US)",
isbn = "0898716101",
volume = "2006",
pages = "108--118",
booktitle = "Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics",

}

TY - GEN

T1 - Force-directed approaches to sensor localization

AU - Efrat, Alon

AU - Forrester, David

AU - Iyer, Anand

AU - Kobourov, Stephen G

AU - Erten, Cesim

PY - 2006

Y1 - 2006

N2 - We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information about the relative order of each sensor's neighbors. We experimented with classic and new force-directed techniques. The classic techniques work well for small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with noisy data. We describe a new force-directed technique, based on a multi-scale dead-reckoning, that scales well for large networks, is resilient under range errors, and can reconstruct complex underlying regions.

AB - We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information about the relative order of each sensor's neighbors. We experimented with classic and new force-directed techniques. The classic techniques work well for small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with noisy data. We describe a new force-directed technique, based on a multi-scale dead-reckoning, that scales well for large networks, is resilient under range errors, and can reconstruct complex underlying regions.

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

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

M3 - Conference contribution

SN - 0898716101

SN - 9780898716108

VL - 2006

SP - 108

EP - 118

BT - Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

ER -