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

Interval analysis-based Bi-iterative algorithm for robust TDOA-FDOA moving source localisation

Author

Listed:
  • Ningning Qin
  • Chao Wang
  • Changxu Shan
  • Le Yang

Abstract

In this study, an interval extension method of a bi-iterative is proposed to determine a moving source. This method is developed by utilising the time difference of arrival and frequency difference of arrival measurements of a signals received from several receivers. Unlike the standard Gaussian noise model, the time difference of arrival - frequency difference of arrival measurements are obtained by interval enclosing, which avoids convergence and initialisation problems in the conventional Taylor-series method. Using the bi-iterative strategy, the algorithm can alternately calculate the position and velocity of the moving source in interval vector form. Simulation results indicate that the proposed scheme significantly outperforms other methods, and approaches the Cramer-Rao lower bound at a sufficiently high noise level before the threshold effect occurs. Moreover, the interval widths of the results provide the confidence degree of the estimate.

Suggested Citation

  • Ningning Qin & Chao Wang & Changxu Shan & Le Yang, 2021. "Interval analysis-based Bi-iterative algorithm for robust TDOA-FDOA moving source localisation," International Journal of Distributed Sensor Networks, , vol. 17(2), pages 15501477219, February.
    • Handle: RePEc:sae:intdis:v:17:y:2021:i:2:p:1550147721991770
    DOI: 10.1177/1550147721991770
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147721991770
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147721991770?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
    ---><---

    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:17:y:2021:i:2:p:1550147721991770. 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.