6533b860fe1ef96bd12c3208

RESEARCH PRODUCT

Performance comparison of residual related algorithms for ToA positioning in wireless terrestrial and sensor networks

Frank Y. LiLei JiaoJianping Xing

subject

Time of arrivalComputational complexity theoryComputer scienceIterative methodbusiness.industryVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552WirelessResidualCommunication complexitybusinessWireless sensor networkAlgorithmWeighting

description

©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE." Article also available from publisher: http://dx.doi.org/10.1109/WIRELESSVITAE.2009.5172462 Time of Arrival (ToA) is a popular technique for terrestrial positioning. This paper presents a comparison of ToA based residual related positioning algorithms in wireless terrestrial and sensor networks in both long range outdoor and short range indoor environments. Using ToA distance measurement error models in both environments, we compare the performance of the Least Square Estimation (LSE), Residual Weighting (Rwgh), Iterative Minimum Residual (IMR), Select Residual Weighting (SRwgh) and Lower-Computational-Cost Residual Weighting (LCC-Rwgh) algorithms. The latter three algorithms are inherited from the Rwgh algorithm for wireless sensor networks. Two aspects of the performance comparison are addressed: computational complexity and positioning accuracy. In performance comparison, the complexity comparison is done by analyzing the number of LSE iterations while the accuracy comparison is conducted through a set of simulations in both environments.

yearjournalcountryeditionlanguage
2009-05-01
http://hdl.handle.net/11250/137727