Performance Comparison of Asynchronous Ranging Algorithms

Several asynchronous ranging algorithms have been proposed and studied thus far to improve the inaccurate results of location positioning with conventional ranging algorithms. Even though asynchronous ranging algorithms could yield more accurate and stable ranging results than synchronous counterparts, it requires too much time to complete a ranging process. For this reason, we developed two asynchronous ranging algorithms, called SS-TWR-MA [1] and SDS-TWR-MA [2], [3]. In this paper, we compared the performance of 3 asynchronous ranging approaches, such as SDS-TWR, SS-TWR, and our SDS-TWR-MA, in terms of ranging accuracy and total ranging time. We found out that SDS-TWR-MA provides the best combination between ranging accuracy and total ranging time. That is, it takes least time to provide a specific degree of ranging accuracy.