Hybrid TOA Trilateration Algorithm Based on Line Intersection and Comparison Approach of Intersection Distances
Sajina Pradhan,
Youngchul Bae,
Jae-Young Pyun,
Nak Yong Ko and
Suk-seung Hwang
Additional contact information
Sajina Pradhan: Department of Advanced Parts and Materials Engineering, Chosun University, Gwangju 61449, Korea
Youngchul Bae: Division of Electrical, Electronic and Communication Engineering, Chonnam National University, Kwangju 500757, Korea
Jae-Young Pyun: Department of Information and Communication Engineering, Chosun University, Gwangju 61449, Korea
Nak Yong Ko: School of Electronic Engineering, Chosun University, Gwangju 61449, Korea
Suk-seung Hwang: School of Electronic Engineering, Chosun University, Gwangju 61449, Korea
Energies, 2019, vol. 12, issue 9, 1-26
Abstract:
The ever-growing mobile station (MS) localization technologies provide an increasingly important role in all aspects of the wireless cellular systems and Internet of Things (IoT). The accurate MS location information is the basis in connection of different devices in IoT. The MS localization techniques based on time of arrival (TOA) trilateration algorithm, which determines the location of MS using an intersection point of three circles based on distances between MS and base stations (BS) and coordinates of BSs, have been actively studied. In general, the distance between the MS and BS is calculated by counting the number of delay samples or measuring the power of the received signal. Since the estimated distance (radius of a circle) between MS and BS is commonly increased, three circles may not meet at a single point, resulting in the estimation error of MS localization. In order to improve this problem, in this paper, we propose the hybrid TOA trilateration algorithm based on the line intersection algorithm for the general case for intersection of three circles and the comparison approach of intersection distances for the specific case where a small circle is located inside the area of two large circles. The line intersection algorithm has an excellent location estimation performance in the general case, but it does not work in the specific case. The comparison approach of intersection distances has good performance only for the specific case. In addition, we propose the mode selection algorithm to efficiently select a proper mode between the general and specific cases. The representative computer simulation examples are provided to verify the localization performance of the proposed algorithm.
Keywords: location estimation; time of arrival; trilateration; mode selection (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: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
https://www.mdpi.com/1996-1073/12/9/1668/pdf (application/pdf)
https://www.mdpi.com/1996-1073/12/9/1668/ (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:12:y:2019:i:9:p:1668-:d:227712
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 ().