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

Localization for mobile sensor network based on unscented Kalman filter with clipping and uncorrelated conversion

Author

Listed:
  • Dan Jia
  • Weihua Li
  • Peng Wang

Abstract

This article studies localization for mobile sensor network with incomplete range measurements, that is, the ranges between some pairs of sensors cannot be measured. Different from existing works that localize sensors one by one, the localization problem in this article is solved for the whole mobile sensor network. According to whether the ranges can be measured or not, all the sensors in the network are grouped to construct basic localization units. For the sensors in basic localization units, a constrained nonlinear model is first established to formulate their relative motion, where the motion states are chosen as ranges and cosine values of angles between ranges. Then, based on the established model, a constrained unscented Kalman filter is adopted to provide motion state estimation. In the constrained unscented Kalman filter, the clipping technique is introduced to handle the model constraints, and the uncorrelated conversion technique is introduced to make full use of measurements. Hence, the estimation accuracy can be improved. Finally, the distributed multidimensional scaling-map method is used to localize the whole sensor network using the estimated ranges, and a localization algorithm is presented. The effectiveness and advantages of the proposed algorithm are demonstrated through several simulation examples.

Suggested Citation

  • Dan Jia & Weihua Li & Peng Wang, 2017. "Localization for mobile sensor network based on unscented Kalman filter with clipping and uncorrelated conversion," International Journal of Distributed Sensor Networks, , vol. 13(11), pages 15501477177, November.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717741104
    DOI: 10.1177/1550147717741104
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717741104
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147717741104?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:13:y:2017:i:11:p:1550147717741104. 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.