Name
Title | ||
|---|---|---|
A Markov Chain Monte Carlo Alternating Minimization Algorithm for Asynchronous Relay Network Localization |
Abstract | ||
|---|---|---|
This letter proposes an algorithm to locate an object by an asynchronous relay network using time of arrival (TOA) measurements. It applies the alternating minimization approach that iterates between measurement association and TOA localization. It solves the highly complex association problem between measurements and relays efficiently using the Markov Chain Monte Carlo method. Simulations show that the proposed method has high accuracy for measurement association and yields a localization accuracy near the Cramer Rao lower bound before the measurement noise becomes large. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/LWC.2017.2672671 | IEEE Wireless Commun. Letters |
Keywords | Field | DocType |
Relays,Noise measurement,Minimization,Markov processes,Clocks,Position measurement,Force | Cramér–Rao bound,Asynchronous communication,Mathematical optimization,Markov process,Noise measurement,Markov chain Monte Carlo,Computer science,Minification,Iterated function,Time of arrival | Journal |
Volume | Issue | ISSN |
6 | 2 | 2162-2337 |
Citations | PageRank | References |
1 | 0.39 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liyang Rui | 1 | 29 | 3.99 |
| K.C. Ho | 2 | 1311 | 148.28 |