AP-Assisted Online Task Assignment Algorithms for Mobile Crowdsensing

Mobile crowdsensing has become a new way to perceive and collect information due to the widespread of smart devices. In this paper, we study the task assignment problem in mobile crowdsensing systems, which is aimed to reducing the average and largest makespan of all tasks. We consider scenarios where task requester needs the help of mobile users for task completion when they encounter directly or through AP cloud (i.e., several APs connected via wired/wireless links) in an opportunistic manner. We describe the mobile crowdsensing system and formulate the problems under study. We first derive the conditional expected encountering time between requester and different users by jointly considering the opportunities via direct encountering and indirect encountering via AP cloud. Then we propose an AP-assisted average makespan sensitive online task assignment (AP-AOTA) algorithm and an AP-assisted largest makespan sensitive online task assignment (AP-LOTA) algorithm. We present detailed design for both algorithms. We deduce the computational complexities of both algorithms to be O ( m n 2 ), where m represents the number of tasks and n represent the number of users. We conduct simulations on a real trace data set and a synthetic trace data set and the results show that our proposed algorithms significantly outperform existing work.