Mathematical Analysis of Line Intersection and Shortest Distance Algorithms

Sajina Pradhan, Suk-seung Hwang and Dongbin Lee
Additional contact information
Sajina Pradhan: Department of Advanced Parts and Materials Engineering, Chosun University, Gwangju 61452, Korea
Suk-seung Hwang: Interdisciplinary Program in IT-Bio Convergence System, School of Electronic Engineering, Chosun University, Gwangju 61452, Korea
Dongbin Lee: Mechanical, Manufacturing Engineering and Technology, Oregon Institute of Technology, Klamath Falls, OR 97603, USA

Energies, 2021, vol. 14, issue 5, 1-17

Abstract: The time of arrival (TOA) trilateration is one of the representative location detection technologies (LDT) that determines the true location of a mobile station (MS) using a unique intersection point of three circles based on three radii corresponding to distances between MS and base stations (BSs) and center coordinates of BSs. Since the distance between MS and BS is estimated by using the number of time delays, three circles based on the estimated radii are generally increased and they may not meet at a single point, resulting in the location estimation error. In order to compensate this estimation error and to improve estimation performance, we present two advanced TOA trilateration localization algorithms with detail mathematical expressions. The considered algorithms are the shortest distance algorithm, which calculates an average of three interior intersection points among an entire six intersection points from three intersecting circles, and the line intersection algorithm, which calculates an intersection point of three lines connecting two intersection points of two circles among the three circles, as the estimated location of the MS. In this paper, we present both algorithms with detailed mathematical expressions. The computer simulation results are provided to compare the location estimation performance of both algorithms. In addition, in this paper, mathematical analysis is provided to indicate the relation between the line intersection algorithm and the shortest distance algorithm. In this analysis, we verify that line equations based on the intersection points obtained from the shortest distance algorithm are identical to those obtained from the line intersection algorithm.

Keywords: location detection technology (LDT); localization; three circle intersection; time of arrival (TOA); trilateration (search for similar items in EconPapers)
JEL-codes: Q Q0 Q4 Q40 Q41 Q42 Q43 Q47 Q48 Q49 (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/1996-1073/14/5/1492/pdf (application/pdf)
https://www.mdpi.com/1996-1073/14/5/1492/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jeners:v:14:y:2021:i:5:p:1492-:d:513305

Access Statistics for this article

Energies is currently edited by Ms. Agatha Cao

More articles in Energies from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().