.png){kind=icon}
.png){kind=icon}
Return
Angle-Based Distributed Node Localizability and Localization
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2023.3339437.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To determine the positions of free nodes in a wireless sensor network, angle-based localization approaches have been recently proposed. However, the existing angle-only localizability conditions are for the whole network, for which the existence of only one unlocalizable node implies that the whole network is unlocalizable. To efficiently obtain specific information on the free nodes' localizability, this article proposes to check each node's localizability in a distributed manner. First, we propose an algebraic condition for node localizability, based on which a distributed node localizability checking algorithm is proposed. Then, a strategy on adding triangular angle measurements to those unlocalizable nodes is proposed, under which an unlocalizable network can become localizable. Finally, by using the local information of each node's triangle degree in the network, a fully distributed localization algorithm is designed, which does not require any globally graphic information or additional internode communication. Simulation examples are provided to validate the results.
Keywords:
Angle measurements
distributed localization
node localizability
triangular network
wireless sensor network
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
No organization information available