IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v14y2021i5p1492-d513305.html
   My bibliography  Save this article

Mathematical Analysis of Line Intersection and Shortest Distance Algorithms

Author

Listed:
  • 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)

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.

Suggested Citation

  • Sajina Pradhan & Suk-seung Hwang & Dongbin Lee, 2021. "Mathematical Analysis of Line Intersection and Shortest Distance Algorithms," Energies, MDPI, vol. 14(5), pages 1-17, March.
  • Handle: RePEc:gam:jeners:v:14:y:2021:i:5:p:1492-:d:513305
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/14/5/1492/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/14/5/1492/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sangwoo Lee & Sunwoo Kim, 2022. "Guest Editorial: Special Issue on Designs and Algorithms of Localization in Vehicular Networks," Energies, MDPI, vol. 15(6), pages 1-3, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jeners:v:14:y:2021:i:5:p:1492-:d:513305. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.