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

Sparse sensing data–based participant selection for people finding

Author

Listed:
  • Ye Tian
  • Zhirong Tang
  • Jian Ma

Abstract

With the emerging of participatory sensing, crowdsensing-based lost people finding is arising. As a special location-centric task, participant selection is a key factor to determine success or failure of lost people finding result. Besides traditional influence, like Quality of Information contribution, candidate’s spatial proximity to the lost people is crucial in participant selection procedure. In order to evaluate how possible a candidate can approach lost people, the probability distribution of their tracing points should be predicted. However, the sparse sensing data problem has been a bottleneck of estimating people’s probable position. To overcome these issues, we study the problem of selecting optimal participants according to each candidate’s spatial proximity and Quality of Information contribution. In the first procedure, we proposed a Received Signal Strength Indicator Positioning–Determined Compressive Sensing algorithm to interpolate missing Received Signal Strength Indicator data. Then, a location-important marking method is put forward to select a set of high-quality data for estimating missing people’s location. In the third procedure, a double-condition greedy participant selection approach, which guarantees candidates’ spatial proximity and Quality of Information contribution, is executed to select optimal participants. Simulation results demonstrate that the proposed mechanism outperforms the other algorithms both in accuracy of positioning and quality of uploaded sensing data.

Suggested Citation

  • Ye Tian & Zhirong Tang & Jian Ma, 2019. "Sparse sensing data–based participant selection for people finding," International Journal of Distributed Sensor Networks, , vol. 15(4), pages 15501477198, April.
  • Handle: RePEc:sae:intdis:v:15:y:2019:i:4:p:1550147719844930
    DOI: 10.1177/1550147719844930
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1177/1550147719844930?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:15:y:2019:i:4:p:1550147719844930. 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.