Task Allocation in Semi-Opportunistic Mobile Crowdsensing: Paradigm and Algorithms

Mobile crowdsensing paradigms can be categorized into two classes: opportunistic sensing and participatory sensing, each of which has its advantage and disadvantage. The high flexibility of worker mobility in participatory sensing leads to high task coverage but also high worker employment fee. The little human involvement in opportunistic sensing results in low worker employment fee but also low task coverage. In this paper, we propose a new mobile crowdsensing paradigm, named semi-opportunistic sensing, aiming to achieve both high task coverage and low worker employment fee. In this paradigm, each worker can provide multiple candidate moving paths for his/her trip, among which the service platform chooses one for the worker to undertake task(s). The platform selects workers and assigns tasks to them with an objective to optimize total task quality under the platform’s incentive budget and workers’ task performing time constraints. In this paper, we formulate the task allocation problem, prove its NP-hardness, and present two efficient heuristic algorithms. The first heuristic, named Best Path/Task first algorithm (BPT), always chooses the best path and task in a greedy manner. The second heuristic, named LP-Relaxation based algorithm (LPR), assigns paths and tasks with the largest values according to the LP-relaxation. We conduct extensive experiments on synthetic dataset and real-life traces. Experiment results show that the proposed semi-opportunistic sensing paradigm can significantly improve total task quality compared with opportunistic sensing. Moreover, the experiment results also validate the high efficiency of our proposed task allocation algorithms.

[1]  Jie Wu,et al.  QoI-Aware Multitask-Oriented Dynamic Participant Selection With Budget Constraints , 2014, IEEE Transactions on Vehicular Technology.

[2]  Cheng Li,et al.  Dense-Device-Enabled Cooperative Networks for Efficient and Secure Transmission , 2018, IEEE Network.

[3]  Daqing Zhang,et al.  iCrowd: Near-Optimal Task Allocation for Piggyback Crowdsensing , 2016, IEEE Transactions on Mobile Computing.

[4]  Yunhao Liu,et al.  SpatialRecruiter: Maximizing Sensing Coverage in Selecting Workers for Spatial Crowdsourcing , 2017, IEEE Transactions on Vehicular Technology.

[5]  Cyrus Shahabi,et al.  Real-time task assignment in hyperlocal spatial crowdsourcing under budget constraints , 2016, 2016 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[6]  Shaojie Tang,et al.  Quality-Aware Sensing Coverage in Budget-Constrained Mobile Crowdsensing Networks , 2016, IEEE Transactions on Vehicular Technology.

[7]  Tzu-Chieh Tsai,et al.  NCCU Trace: social-network-aware mobility trace , 2015, IEEE Communications Magazine.

[8]  Daqing Zhang,et al.  Task Allocation in Mobile Crowd Sensing: State-of-the-Art and Future Opportunities , 2018, IEEE Internet of Things Journal.

[9]  Fan Ye,et al.  Mobile crowdsensing: current state and future challenges , 2011, IEEE Communications Magazine.

[10]  Jie Wu,et al.  An Efficient Prediction-Based User Recruitment for Mobile Crowdsensing , 2018, IEEE Transactions on Mobile Computing.

[11]  Shuai Han,et al.  Self-Interference-Cancelation-Based SLNR Precoding Design for Full-Duplex Relay-Assisted System , 2018, IEEE Transactions on Vehicular Technology.

[12]  Daqing Zhang,et al.  Cell Selection with Deep Reinforcement Learning in Sparse Mobile Crowdsensing , 2018, 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS).

[13]  Lei Chen,et al.  Online mobile Micro-Task Allocation in spatial crowdsourcing , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[14]  Lin Gao,et al.  Scalable Mobile Crowdsensing via Peer-to-Peer Data Sharing , 2018, IEEE Transactions on Mobile Computing.

[15]  Cheng Li,et al.  Location-Based Online Task Scheduling in Mobile Crowdsensing , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[16]  Cheng Li,et al.  Task Assignment for Semi-opportunistic Mobile Crowdsensing , 2018, ADHOCNETS.

[17]  Salma Bradai,et al.  Real-time and energy aware opportunistic mobile crowdsensing framework based on people's connectivity habits , 2018, Comput. Networks.

[18]  Cheng Li,et al.  Location-Based Online Task Assignment and Path Planning for Mobile Crowdsensing , 2019, IEEE Transactions on Vehicular Technology.

[19]  Nuo Xu,et al.  Optimal Power Allocation for SCMA Downlink Systems Based on Maximum Capacity , 2019, IEEE Transactions on Communications.

[20]  Xing Xie,et al.  GeoLife: A Collaborative Social Networking Service among User, Location and Trajectory , 2010, IEEE Data Eng. Bull..

[21]  Yang Wang,et al.  TaskMe: multi-task allocation in mobile crowd sensing , 2016, UbiComp.

[22]  Cheng Li,et al.  A Markov Model for Batch-Based Opportunistic Routing in Multi-Hop Wireless Mesh Networks , 2018, IEEE Transactions on Vehicular Technology.

[23]  Cheng Li,et al.  Task Assignment in Mobile Crowdsensing: Present and Future Directions , 2018, IEEE Network.

[24]  Vassilis Kostakos,et al.  Evidence-Aware Mobile Computational Offloading , 2018, IEEE Transactions on Mobile Computing.

[25]  Ding-Zhu Du,et al.  Design and Analysis of Approximation Algorithms , 2011 .

[26]  Yunhao Liu,et al.  Quality-Aware Online Task Assignment in Mobile Crowdsourcing , 2015, 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems.

[27]  Cheng Li,et al.  AUV-Aided Joint Localization and Time Synchronization for Underwater Acoustic Sensor Networks , 2018, IEEE Signal Processing Letters.

[28]  Yan Liu,et al.  ActiveCrowd: A Framework for Optimized Multitask Allocation in Mobile Crowdsensing Systems , 2016, IEEE Transactions on Human-Machine Systems.