2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR) 2012
DOI: 10.1109/acssc.2012.6489262
|View full text |Cite
|
Sign up to set email alerts
|

Joint localization and clock synchronization for wireless sensor networks

Abstract: A fully-asynchronous network with one target sensor and a few anchors (nodes with known locations) is considered. Localization and synchronization are traditionally treated as two separate problems. In this paper, localization and synchronization is studied under a unified framework. We present a new model in which time-stamps obtained either via twoway communication between the nodes or with a broadcast based protocol can be used in a simple estimator based on least-squares (LS) to jointly estimate the positi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
10
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 18 publications
(10 citation statements)
references
References 7 publications
0
10
0
Order By: Relevance
“…The listed methods consider asynchronity in clock skew and phase, and determine the unknown location of source nodes in a two dimensional space by means of anchor nodes at known locations. They mainly differ in the solution strategy (e.g., least squares, message passing, ...) and if the estimation is performed by a central computation unit [2]- [4] or in a distributed manner [4]- [6]. However, all methods require that anchors and source nodes actively participate in a predefined protocol, where the minimum requirement is the exchange of receive and transmit time information, or responding a round-trip request.…”
Section: Introductionmentioning
confidence: 98%
See 1 more Smart Citation
“…The listed methods consider asynchronity in clock skew and phase, and determine the unknown location of source nodes in a two dimensional space by means of anchor nodes at known locations. They mainly differ in the solution strategy (e.g., least squares, message passing, ...) and if the estimation is performed by a central computation unit [2]- [4] or in a distributed manner [4]- [6]. However, all methods require that anchors and source nodes actively participate in a predefined protocol, where the minimum requirement is the exchange of receive and transmit time information, or responding a round-trip request.…”
Section: Introductionmentioning
confidence: 98%
“…Consequently, a number of simultaneous localization and synchronization algorithms were proposed recently [2]- [6]. The listed methods consider asynchronity in clock skew and phase, and determine the unknown location of source nodes in a two dimensional space by means of anchor nodes at known locations.…”
Section: Introductionmentioning
confidence: 99%
“…Because distance estimates, which are the basis of many localization methods, are often obtained from time-of-arrival estimates, localization and synchronization tasks are tightly interconnected [4], [5]. This interconnection is leveraged by the distributed algorithms for cooperative simultaneous localization and synchronization (CoSLAS) that were recently proposed in [6], [7].…”
Section: Introductionmentioning
confidence: 99%
“…Practical implementations and the combination of recently proposed methods from both fields are analyzed. In Chapter 6, an overview of simultaneous approaches is presented, with a distinction in centralized and distributed computation [1,19,26,35,36,37,75,89,124,129,137,138,139,141,143,144]. In this review we provide a comprehensive orientation in this novel topic.…”
Section: Introductionmentioning
confidence: 99%