Localizability and distributed protocols for bearing-based network localization in arbitrary dimensions

This paper addresses the problem of bearing-based network localization, which aims to localize all the nodes in a static network given the locations of a subset of nodes termed anchors and inter-node bearings measured in a common reference frame. The contributions of the paper are twofold. Firstly,...

Full description

Saved in:
Bibliographic Details
Published inAutomatica (Oxford) Vol. 69; pp. 334 - 341
Main Authors Zhao, Shiyu, Zelazo, Daniel
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.07.2016
Subjects
Algebra
Anchors
Bearing Laplacian
Bearing rigidity
Bearings
Dimensional analysis
Distributed localization
Localization
Network localizability
Networks
Position (location)
Protocol (computers)
Sensor network
Bearing Laplacian
Sensor network
Network localizability
Bearing rigidity
Distributed localization
Online AccessGet full text

Cover

More Information
Summary:This paper addresses the problem of bearing-based network localization, which aims to localize all the nodes in a static network given the locations of a subset of nodes termed anchors and inter-node bearings measured in a common reference frame. The contributions of the paper are twofold. Firstly, we propose necessary and sufficient conditions for network localizability with both algebraic and rigidity theoretic interpretations. Secondly, we propose and analyze a linear distributed protocol for bearing-based network localization. One novelty of our work is that the localizability analysis and localization protocol are applicable to networks in arbitrary dimensional spaces.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2016.03.010