4.7 Article

Dynamic Participant Selection for Large-Scale Mobile Crowd Sensing

期刊

IEEE TRANSACTIONS ON MOBILE COMPUTING
卷 18, 期 12, 页码 2842-2855

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2018.2884945

关键词

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

资金

  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]

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据