Near-Optimal Allocation Algorithms for Location-Dependent Tasks in Crowdsensing

Shibo He, Dong Hoon Shin, Junshan Zhang, Jiming Chen

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

Crowdsensing offers an efficient way to meet the demand in large-scale sensing applications. In crowdsensing, optimal task allocation is challenging since sensing tasks with different requirements of quality of sensing are typically associated with specific locations, and mobile users have time constraints. We show that the allocation problem is NP-hard. We then focus on approximation algorithms and devise an efficient local-ratio-based algorithm (LRBA). Our analysis shows that the approximation ratio of the aggregate rewards obtained by optimal allocation to those by LRBA is 5. This reveals that LRBA is efficient, since a lower (but not tight) bound on the approximation ratio is 4. We extend the results to the general scenario where mobile users are heterogeneous. A distributed version of LRBA, namely DLRBA, is designed, which can be iteratively executed at each mobile user without the need for the platform to collect all the information of mobile users. We prove that both centralized and distributed versions can output the same solution. Extensive simulation results are provided to demonstrate the advantages of our proposed algorithms.

Original languageEnglish (US)
Article number7515176
Pages (from-to)3392-3405
Number of pages14
JournalIEEE Transactions on Vehicular Technology
Volume66
Issue number4
DOIs
StatePublished - Apr 1 2017

Fingerprint

Optimal Allocation
Dependent
Sensing
Approximation algorithms
Task Allocation
Approximation
Computational complexity
Reward
Approximation Algorithms
NP-complete problem
Scenarios
Output
Requirements
Demonstrate
Simulation

Keywords

  • Approximation ratio
  • crowdsensing applications
  • location-dependent task allocation

ASJC Scopus subject areas

  • Automotive Engineering
  • Aerospace Engineering
  • Computer Networks and Communications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Near-Optimal Allocation Algorithms for Location-Dependent Tasks in Crowdsensing. / He, Shibo; Shin, Dong Hoon; Zhang, Junshan; Chen, Jiming.

In: IEEE Transactions on Vehicular Technology, Vol. 66, No. 4, 7515176, 01.04.2017, p. 3392-3405.

Research output: Contribution to journalArticle

@article{f5c5ad3c193446d181e7c075ca86da20,
title = "Near-Optimal Allocation Algorithms for Location-Dependent Tasks in Crowdsensing",
abstract = "Crowdsensing offers an efficient way to meet the demand in large-scale sensing applications. In crowdsensing, optimal task allocation is challenging since sensing tasks with different requirements of quality of sensing are typically associated with specific locations, and mobile users have time constraints. We show that the allocation problem is NP-hard. We then focus on approximation algorithms and devise an efficient local-ratio-based algorithm (LRBA). Our analysis shows that the approximation ratio of the aggregate rewards obtained by optimal allocation to those by LRBA is 5. This reveals that LRBA is efficient, since a lower (but not tight) bound on the approximation ratio is 4. We extend the results to the general scenario where mobile users are heterogeneous. A distributed version of LRBA, namely DLRBA, is designed, which can be iteratively executed at each mobile user without the need for the platform to collect all the information of mobile users. We prove that both centralized and distributed versions can output the same solution. Extensive simulation results are provided to demonstrate the advantages of our proposed algorithms.",
keywords = "Approximation ratio, crowdsensing applications, location-dependent task allocation",
author = "Shibo He and Shin, {Dong Hoon} and Junshan Zhang and Jiming Chen",
year = "2017",
month = "4",
day = "1",
doi = "10.1109/TVT.2016.2592541",
language = "English (US)",
volume = "66",
pages = "3392--3405",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Near-Optimal Allocation Algorithms for Location-Dependent Tasks in Crowdsensing

AU - He, Shibo

AU - Shin, Dong Hoon

AU - Zhang, Junshan

AU - Chen, Jiming

PY - 2017/4/1

Y1 - 2017/4/1

N2 - Crowdsensing offers an efficient way to meet the demand in large-scale sensing applications. In crowdsensing, optimal task allocation is challenging since sensing tasks with different requirements of quality of sensing are typically associated with specific locations, and mobile users have time constraints. We show that the allocation problem is NP-hard. We then focus on approximation algorithms and devise an efficient local-ratio-based algorithm (LRBA). Our analysis shows that the approximation ratio of the aggregate rewards obtained by optimal allocation to those by LRBA is 5. This reveals that LRBA is efficient, since a lower (but not tight) bound on the approximation ratio is 4. We extend the results to the general scenario where mobile users are heterogeneous. A distributed version of LRBA, namely DLRBA, is designed, which can be iteratively executed at each mobile user without the need for the platform to collect all the information of mobile users. We prove that both centralized and distributed versions can output the same solution. Extensive simulation results are provided to demonstrate the advantages of our proposed algorithms.

AB - Crowdsensing offers an efficient way to meet the demand in large-scale sensing applications. In crowdsensing, optimal task allocation is challenging since sensing tasks with different requirements of quality of sensing are typically associated with specific locations, and mobile users have time constraints. We show that the allocation problem is NP-hard. We then focus on approximation algorithms and devise an efficient local-ratio-based algorithm (LRBA). Our analysis shows that the approximation ratio of the aggregate rewards obtained by optimal allocation to those by LRBA is 5. This reveals that LRBA is efficient, since a lower (but not tight) bound on the approximation ratio is 4. We extend the results to the general scenario where mobile users are heterogeneous. A distributed version of LRBA, namely DLRBA, is designed, which can be iteratively executed at each mobile user without the need for the platform to collect all the information of mobile users. We prove that both centralized and distributed versions can output the same solution. Extensive simulation results are provided to demonstrate the advantages of our proposed algorithms.

KW - Approximation ratio

KW - crowdsensing applications

KW - location-dependent task allocation

UR - http://www.scopus.com/inward/record.url?scp=85018272898&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85018272898&partnerID=8YFLogxK

U2 - 10.1109/TVT.2016.2592541

DO - 10.1109/TVT.2016.2592541

M3 - Article

AN - SCOPUS:85018272898

VL - 66

SP - 3392

EP - 3405

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 4

M1 - 7515176

ER -