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

A location-dependent task assignment mechanism in vehicular crowdsensing

Author

Listed:
  • Lanlan Rui
  • Pan Zhang
  • Haoqiu Huang
  • Xuesong Qiu

Abstract

The development of modern vehicles equipped with various sensors and wireless communication has been the impetus for vehicular crowdsensing applications, which can be used to complete large-scale and complex social sensing tasks such as monitoring road surfaces condition. However, most of the sensing tasks are closely related with specific location and required to be performed in certain area, and in this article, we have proved these kind of location-based optimal task assignment to be an NP-hard (non-deterministic polynomial-time hard) problem. To solve this challenge, we first establish mathematical model of multi-vehicle collaborative task assignment problem, considering vehicle’s time budget constraint, location, and multiple requirements of sensing tasks. And we propose an approximation location-based task assignment mechanism for it, which is composed of two parts: the first part is to determine the allocating order among engaged vehicles and the second part is to schedule optimal sensing path for single vehicle, which in this article we propose an optimal sensing path scheduling algorithm to finish this task. Using Lingo software, we prove the efficiency of the proposed optimal sensing path scheduling algorithm. Extensive simulation results also demonstrate correctness and effectiveness of our approach.

Suggested Citation

  • Lanlan Rui & Pan Zhang & Haoqiu Huang & Xuesong Qiu, 2016. "A location-dependent task assignment mechanism in vehicular crowdsensing," International Journal of Distributed Sensor Networks, , vol. 12(9), pages 15501477166, September.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:9:p:1550147716669627
    DOI: 10.1177/1550147716669627
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1177/1550147716669627?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:12:y:2016:i:9:p:1550147716669627. 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.