Distributed localization and clustering using data correlation and the Occam's razor principle

Pankaj K. Agarwal, Alon Efrat, Christopher Gniady, Joseph S B Mitchell, Valentin Polishchuk, Girishkumar R. Sabhnani

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

2 Citations (Scopus)

Abstract

We present a distributed algorithm for computing a combined solution to three problems in sensor networks: localization, clustering, and sensor suspension. Assuming that initially only a rough approximation of the sensor positions is known, we show how one can use sensor measurements to refine the set of possible sensor locations, to group the sensors into clusters with linearly correlated measurements, and to decide which sensors may suspend transmission without jeopardizing the consistency of the collected data. Our algorithm applies the "Occam's razor principle" by computing a "simplest" explanation for the data gathered from the network. We also present centralized algorithms, as well as efficient heuristics.

Original languageEnglish (US)
Title of host publication2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11
DOIs
StatePublished - 2011
Event7th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS'11 - Barcelona, Spain
Duration: Jun 27 2011Jun 29 2011

Other

Other7th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS'11
CountrySpain
CityBarcelona
Period6/27/116/29/11

Fingerprint

Sensors
Parallel algorithms
Sensor networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Agarwal, P. K., Efrat, A., Gniady, C., Mitchell, J. S. B., Polishchuk, V., & Sabhnani, G. R. (2011). Distributed localization and clustering using data correlation and the Occam's razor principle. In 2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11 [5982164] https://doi.org/10.1109/DCOSS.2011.5982164

Distributed localization and clustering using data correlation and the Occam's razor principle. / Agarwal, Pankaj K.; Efrat, Alon; Gniady, Christopher; Mitchell, Joseph S B; Polishchuk, Valentin; Sabhnani, Girishkumar R.

2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11. 2011. 5982164.

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

Agarwal, PK, Efrat, A, Gniady, C, Mitchell, JSB, Polishchuk, V & Sabhnani, GR 2011, Distributed localization and clustering using data correlation and the Occam's razor principle. in 2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11., 5982164, 7th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS'11, Barcelona, Spain, 6/27/11. https://doi.org/10.1109/DCOSS.2011.5982164
Agarwal PK, Efrat A, Gniady C, Mitchell JSB, Polishchuk V, Sabhnani GR. Distributed localization and clustering using data correlation and the Occam's razor principle. In 2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11. 2011. 5982164 https://doi.org/10.1109/DCOSS.2011.5982164
Agarwal, Pankaj K. ; Efrat, Alon ; Gniady, Christopher ; Mitchell, Joseph S B ; Polishchuk, Valentin ; Sabhnani, Girishkumar R. / Distributed localization and clustering using data correlation and the Occam's razor principle. 2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11. 2011.
@inproceedings{dd75588c5cb2491ba23608d03dd43c88,
title = "Distributed localization and clustering using data correlation and the Occam's razor principle",
abstract = "We present a distributed algorithm for computing a combined solution to three problems in sensor networks: localization, clustering, and sensor suspension. Assuming that initially only a rough approximation of the sensor positions is known, we show how one can use sensor measurements to refine the set of possible sensor locations, to group the sensors into clusters with linearly correlated measurements, and to decide which sensors may suspend transmission without jeopardizing the consistency of the collected data. Our algorithm applies the {"}Occam's razor principle{"} by computing a {"}simplest{"} explanation for the data gathered from the network. We also present centralized algorithms, as well as efficient heuristics.",
author = "Agarwal, {Pankaj K.} and Alon Efrat and Christopher Gniady and Mitchell, {Joseph S B} and Valentin Polishchuk and Sabhnani, {Girishkumar R.}",
year = "2011",
doi = "10.1109/DCOSS.2011.5982164",
language = "English (US)",
isbn = "9781457705137",
booktitle = "2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11",

}

TY - GEN

T1 - Distributed localization and clustering using data correlation and the Occam's razor principle

AU - Agarwal, Pankaj K.

AU - Efrat, Alon

AU - Gniady, Christopher

AU - Mitchell, Joseph S B

AU - Polishchuk, Valentin

AU - Sabhnani, Girishkumar R.

PY - 2011

Y1 - 2011

N2 - We present a distributed algorithm for computing a combined solution to three problems in sensor networks: localization, clustering, and sensor suspension. Assuming that initially only a rough approximation of the sensor positions is known, we show how one can use sensor measurements to refine the set of possible sensor locations, to group the sensors into clusters with linearly correlated measurements, and to decide which sensors may suspend transmission without jeopardizing the consistency of the collected data. Our algorithm applies the "Occam's razor principle" by computing a "simplest" explanation for the data gathered from the network. We also present centralized algorithms, as well as efficient heuristics.

AB - We present a distributed algorithm for computing a combined solution to three problems in sensor networks: localization, clustering, and sensor suspension. Assuming that initially only a rough approximation of the sensor positions is known, we show how one can use sensor measurements to refine the set of possible sensor locations, to group the sensors into clusters with linearly correlated measurements, and to decide which sensors may suspend transmission without jeopardizing the consistency of the collected data. Our algorithm applies the "Occam's razor principle" by computing a "simplest" explanation for the data gathered from the network. We also present centralized algorithms, as well as efficient heuristics.

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

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

U2 - 10.1109/DCOSS.2011.5982164

DO - 10.1109/DCOSS.2011.5982164

M3 - Conference contribution

SN - 9781457705137

BT - 2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11

ER -