Referenced Items are not available for this document.
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.
Published in:
Wireless Communications, IEEE Transactions on
(Volume:7
,
Issue:
1
)
Date of Publication: Jan. 2008
- Page(s):
- 298 - 304
- ISSN :
- 1536-1276
- INSPEC Accession Number:
- 9775766
- Digital Object Identifier :
- 10.1109/TWC.2008.060511
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 16 January 2008
- Issue Date :
- Jan. 2008
- Sponsored by :
- IEEE Communications Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
