4.7 Article

Dynamic Participant Selection for Large-Scale Mobile Crowd Sensing

Journal

IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 18, Issue 12, Pages 2842-2855

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2018.2884945

Keywords

Sensors; Task analysis; Smart phones; Heuristic algorithms; Memory; Data models; Approximation algorithms; Participant selection; greedy algorithm; caching; mobile crowd sensing

Funding

  1. U.S. National Science Foundation [CNS-1319915, CNS-1343355]
  2. National Natural Science Foundation of China (NSFC) [61428203, 61572347]
  3. U.S. Department of Transportation Center for Advanced Multimodal Mobility Solutions and Education [69A3351747133]

Ask authors/readers for more resources

With the rapid increasing of smart phones and the advances of embedded sensing technologies, mobile crowd sensing (MCS) becomes an emerging sensing paradigm for large-scale sensing applications. One of the key challenges of large-scale mobile crowd sensing is how to effectively select the minimum set of participants from the huge user pool to perform the tasks and achieve a certain level of coverage while satisfying some constraints. This becomes more complex when the sensing tasks are dynamic (coming in real time) and heterogeneous (with different temporal and spacial coverage requirements). In this paper, we consider such a dynamic participant selection problem with heterogeneous sensing tasks which aims to minimize the sensing cost while maintaining certain level of probabilistic coverage. Both offline and online algorithms are proposed to solve the challenging problem. Extensive simulations over a real-life mobile dataset confirm the efficiency of the proposed algorithms.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available