A distributed randomized algorithm for relative localization in sensor networks

Chiara Ravazzi; Paolo Frasca; Hideaki Ishii; Roberto Tempo

A distributed randomized algorithm for relative localization in sensor networks

Chiara Ravazzi, Paolo Frasca, Hideaki Ishii, Roberto Tempo

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

This paper regards the relative localization problem in sensor networks.We propose for its solution a distributed randomized algorithm, which is based on input-driven consensus dynamics and features pairwise “gossip‿ communications and updates. Due to the randomness of the updates, the state of this algorithm oscillates in time around a certain limit value. We show that the time-average of the state asymptotically converges, in the mean-square sense, to the least-squares solution of the localization problem. Furthermore, we describe an update scheme ensuring that the time-averaging process is accomplished in a fully distributed way.

Original language	Undefined
Title of host publication	Proceedings of the 2013 European Control Conference (ECC)
Publisher	European Control Association (EUCA)
Pages	1776-1781
Number of pages	6
ISBN (Print)	978-3-952-41734-8
Publication status	Published - Jul 2013
Event	2013 European Control Conference, ECC 2013 - Zürich, Switzerland Duration: 17 Jul 2013 → 19 Jul 2013

Publication series

Name
Publisher	European Control Association (EUCA)

Conference

Conference	2013 European Control Conference, ECC 2013
Abbreviated title	ECC
Country/Territory	Switzerland
City	Zürich
Period	17/07/13 → 19/07/13

Keywords

EWI-24150
METIS-300241
IR-88308

Access to Document

http://eprints.eemcs.utwente.nl/secure2/24150/01/RFIT_ecc13.pdf

Cite this

@inproceedings{b8cccff485d144dcbf89ca40839ae8ca,

title = "A distributed randomized algorithm for relative localization in sensor networks",

abstract = "This paper regards the relative localization problem in sensor networks.We propose for its solution a distributed randomized algorithm, which is based on input-driven consensus dynamics and features pairwise “gossip‿ communications and updates. Due to the randomness of the updates, the state of this algorithm oscillates in time around a certain limit value. We show that the time-average of the state asymptotically converges, in the mean-square sense, to the least-squares solution of the localization problem. Furthermore, we describe an update scheme ensuring that the time-averaging process is accomplished in a fully distributed way.",

keywords = "EWI-24150, METIS-300241, IR-88308",

author = "Chiara Ravazzi and Paolo Frasca and Hideaki Ishii and Roberto Tempo",

note = "eemcs-eprint-24150 ; null ; Conference date: 17-07-2013 Through 19-07-2013",

year = "2013",

month = jul,

language = "Undefined",

isbn = "978-3-952-41734-8",

publisher = "European Control Association (EUCA)",

pages = "1776--1781",

booktitle = "Proceedings of the 2013 European Control Conference (ECC)",

}

Ravazzi, C, Frasca, P, Ishii, H & Tempo, R 2013, A distributed randomized algorithm for relative localization in sensor networks. in Proceedings of the 2013 European Control Conference (ECC). European Control Association (EUCA), pp. 1776-1781, 2013 European Control Conference, ECC 2013, Zürich, Switzerland, 17/07/13. <http://eprints.eemcs.utwente.nl/secure2/24150/01/RFIT_ecc13.pdf>

A distributed randomized algorithm for relative localization in sensor networks. / Ravazzi, Chiara; Frasca, Paolo; Ishii, Hideaki et al.

Proceedings of the 2013 European Control Conference (ECC). European Control Association (EUCA), 2013. p. 1776-1781.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - A distributed randomized algorithm for relative localization in sensor networks

AU - Ravazzi, Chiara

AU - Frasca, Paolo

AU - Ishii, Hideaki

AU - Tempo, Roberto

N1 - eemcs-eprint-24150

PY - 2013/7

Y1 - 2013/7

N2 - This paper regards the relative localization problem in sensor networks.We propose for its solution a distributed randomized algorithm, which is based on input-driven consensus dynamics and features pairwise “gossip‿ communications and updates. Due to the randomness of the updates, the state of this algorithm oscillates in time around a certain limit value. We show that the time-average of the state asymptotically converges, in the mean-square sense, to the least-squares solution of the localization problem. Furthermore, we describe an update scheme ensuring that the time-averaging process is accomplished in a fully distributed way.

AB - This paper regards the relative localization problem in sensor networks.We propose for its solution a distributed randomized algorithm, which is based on input-driven consensus dynamics and features pairwise “gossip‿ communications and updates. Due to the randomness of the updates, the state of this algorithm oscillates in time around a certain limit value. We show that the time-average of the state asymptotically converges, in the mean-square sense, to the least-squares solution of the localization problem. Furthermore, we describe an update scheme ensuring that the time-averaging process is accomplished in a fully distributed way.

KW - EWI-24150

KW - METIS-300241

KW - IR-88308

M3 - Conference contribution

SN - 978-3-952-41734-8

SP - 1776

EP - 1781

BT - Proceedings of the 2013 European Control Conference (ECC)

PB - European Control Association (EUCA)

Y2 - 17 July 2013 through 19 July 2013

ER -