IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v10y2014i3p489563.html
   My bibliography  Save this article

The Hybrid Taguchi-Genetic Algorithm for Mobile Location

Author

Listed:
  • Chien-Sheng Chen
  • Jium-Ming Lin
  • Chin-Tan Lee
  • Chyuan-Der Lu

Abstract

To estimate the mobile location is an important topic in wireless communication. It is well known that non-line-of-sight (NLOS) problem is the most pivotal part that causes the estimated error. When we transmit the signal from mobile station (MS) to base stations (BSs), the direct path between MS and BS is sealed off by some obstacles, and the signal measurements will measure the error due to the signal reflection or diffraction. The hybrid Taguchi-genetic algorithm (HTGA) combines the Taguchi method with the genetic algorithm (GA). In this paper, we bring up a novel HTGA algorithm that utilizes time of arrival (TOA) measurements from three BSs to locate MS. The proposed algorithm utilizes the intersections of three TOA circles based on HTGA to estimate the MS location. Finally, we compare HTGA with GA and find that the Taguchi algorithm can enhance genetic algorithm. We also can find that the average convergence of generation number will not be affected no matter which propagation models we use. Obviously HTGA is more robust, statistically sound, and quickly convergent than the other algorithms. The simulation results show that the HTGA can converge more quickly than GA and furthermore the HTGA can enhance the accuracy of the mobile location.

Suggested Citation

  • Chien-Sheng Chen & Jium-Ming Lin & Chin-Tan Lee & Chyuan-Der Lu, 2014. "The Hybrid Taguchi-Genetic Algorithm for Mobile Location," International Journal of Distributed Sensor Networks, , vol. 10(3), pages 489563-4895, March.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:3:p:489563
    DOI: 10.1155/2014/489563
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/489563
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/489563?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:sae:intdis:v:10:y:2014:i:3:p:489563. 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: SAGE Publications (email available below). General contact details of provider: .

    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.