.png){kind=icon}
.png){kind=icon}
Return
Joint Synchronization and Localization in Wireless Sensor Networks Using Semidefinite Programming
.png){kind=icon}
PRE
AI
DOI：10.1109/JIOT.2017.2777917.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new joint synchronization and localization method for wireless sensor networks using two-way exchanged time-stamps is proposed in this paper. The goal is to jointly localize and synchronize the source node, assuming that the locations and clock parameters of the anchor nodes are known. We first form the measurement model and derive the Cramer-Rao lower bound (CRLB). An analysis of the advantages and disadvantages of a recent scheme on joint synchronization and localization motivates us to develop a maximum likelihood estimator (MLE) that effectively resolves the issues of this existing scheme. A novel semidefinite programming method is then proposed to transform the nonconvex MLE problem into a convex optimization problem. Extensive simulation results are obtained to compare the synchronization and localization performances of proposed scheme and a few state-of-the-art existing schemes.
Keywords:
Maximum likelihood (ML)
semidefinite programming (SDP)
synchronization and localization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
1.4W
Citations:
7.8W