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

A Multiple Target Localization with Sparse Information in Wireless Sensor Networks

Author

Listed:
  • Liping Liu
  • Shaoqing Yuan
  • Weijie Lv
  • Qiang Zhang

Abstract

It is a great challenge for wireless sensor network to provide enough information for targets localization due to the limits on application environment and its nature, such as energy, communication, and sensing precision. In this paper, a multiple targets localization algorithm with sparse information (MTLSI) was proposed using compressive sensing theory, which can provide targets position with incomplete or sparse localization information. It does not depend on extra hardware measurements. Only targets number detected by sensors is needed in the algorithm. The monitoring region was divided into a plurality of small grids. Sensors and targets are randomly dropped in grids. Targets position information is defined as a sparse vector; the number of targets detected by sensor nodes is expressed as the product of measurement matrix, sparse matrix, and sparse vector in compressive sensing theory. Targets are localized with the sparse signal reconstruction. In order to investigate MTLSI performance, BP and OMP are applied to recover targets localization. Simulation results show that MTLSI can provide satisfied targets localization in wireless sensor networks application with less data bits transmission compared to multiple targets localization using compressive sensing based on received signal strengths (MTLCS-RSS), which has the same computation complexity as MTLIS.

Suggested Citation

  • Liping Liu & Shaoqing Yuan & Weijie Lv & Qiang Zhang, 2016. "A Multiple Target Localization with Sparse Information in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 12(5), pages 6198636-619, May.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:5:p:6198636
    DOI: 10.1155/2016/6198636
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2016/6198636
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/6198636?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:12:y:2016:i:5:p:6198636. 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.