2017
DOI: 10.1109/joe.2017.2736951
|View full text |Cite
|
Sign up to set email alerts
|

LocDyn: Robust Distributed Localization for Mobile Underwater Networks

Abstract: How to self-localize large teams of underwater nodes using only noisy range measurements? How to do it in a distributed way, and incorporating dynamics into the problem? How to reject outliers and produce trustworthy position estimates? The stringent acoustic communication channel and the accuracy needs of our geophysical survey application demand faster and more accurate localization methods. We approach dynamic localization as a MAP estimation problem where the prior encodes dynamics, and we devise a convex … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
7
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 40 publications
0
7
0
Order By: Relevance
“…However, the authors did not consider the mobility of nodes as well as energy-saving, which is a big requirement for UWSN. Finally, Soares et al [16] addressed the benefit of encoding the dynamic conduct of moving vehicles. However, the authors did not address the range-based metrics to calculate the localization distance between ANs and TNs under energy efficiency requirements.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…However, the authors did not consider the mobility of nodes as well as energy-saving, which is a big requirement for UWSN. Finally, Soares et al [16] addressed the benefit of encoding the dynamic conduct of moving vehicles. However, the authors did not address the range-based metrics to calculate the localization distance between ANs and TNs under energy efficiency requirements.…”
Section: Introductionmentioning
confidence: 99%
“…However, this algorithm works well with a smaller number of ANs only. Soares et al [16] have addressed dynamic localization (DL) algorithm as LocDyn, where the maximum posteriori probability (MAP) estimation problem was also removed by using coded DL kinematics information. This method was distributed, fast, and had low computation at each node.…”
Section: Introductionmentioning
confidence: 99%
“…The authors in [29] employed half quadratic minimization to solve the localization problem in the presence of outliers. Soares et al converted the localization problem into a convex optimization problem using simple fast convex relaxation, and then they tested the method with 10% outlier measurements engaged [30].…”
Section: Introductionmentioning
confidence: 99%
“…It may be noted that the method in [28] is costly and has high complexity. The approaches proposed in [29] and [30] only considered outlier measurements that yielded Gaussian distribution, which was the ideal situation. In this paper, motivated by the above issues, we propose a practical, robust non-cooperative localization algorithm (RNLA) that regards the buoys as sensor nodes and uses RSSI in the presence of outlier measurements in OSNs.…”
Section: Introductionmentioning
confidence: 99%
“…In practice, the number of anchors might be larger to attain the desired positioning accuracy. Lately, signal processing researchers produced solutions for dynamic network localization; Schlupkothen et al [9] and Soares et al [10] incorporated velocity information from past position estimates to bias the solution of a static relaxation of the localization problem via a regularization term.…”
Section: Introductionmentioning
confidence: 99%