Weighing strategy for network localization under scarce ranging information
IEEE Transactions on Wireless Communications
A 3D self-positioning method for wireless sensor nodes based on linear FMCW and TFDA
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
On the optimal performance of collaborative position location
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Reformulating the least-square source localization problem with contracted distances
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Cooperative positioning in underwater sensor networks
IEEE Transactions on Signal Processing
Mobile element assisted cooperative localization for wireless sensor networks with obstacles
IEEE Transactions on Wireless Communications
| Hi-index | 0.01 |
We discuss the challenge of node localization in ad-hoc wireless networks using range measurements and a few anchors. The measurements are assumed to be noisy with unknown bias. We propose an iterative Maximum Likelihood algorithm that is statistically efficient under these conditions. The algorithm is related to phase retrieval and can be viewed as an adaptation of the Gerchberg-Saxton Iterations alternating projection procedure. As a byproduct the algorithm estimates the bias of the range measurements. Closed form expressions for the Fisher Information Matrix are derived. Finally, simulations are used to corroborate the analysis.