Name
Abstract | ||
|---|---|---|
Most existing research about task allocation in mobile crowdsensing mainly focus on requester-centric mobile crowdsensing (RCMCS), where the requester assigns tasks to workers to maximize his/her benefits. A worker in RCMCS might suffer benefit damage because the tasks assigned to him/her may not maximize his/her benefit. Contrarily, worker-centric mobile crowdsensing (WCMCS), where workers autonomously select tasks to accomplish to maximize their benefits, does not receive enough attention. The workers in WCMCS can maximize their benefits, but the requester in WCMCS will suffer benefit damage (cannot maximize the number of expected completed tasks). It is hard to maximize the number of expected completed tasks in WCMCS, because some tasks may be selected by no workers, while others may be selected by many workers. In this paper, we apply task bundling to address this issue, and we formulate a novel task bundling problem in WCMCS with the objective of maximizing the number of expected completed tasks. To solve this problem, we design an algorithm named LocTrajBundling which bundles tasks based on the location of tasks and the trajectories of workers. Experimental results show that, compared with other algorithms, our algorithm can achieve a better performance in maximizing the number of expected completed tasks. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1002/int.22497 | INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS |
Keywords | DocType | Volume |
heuristic algorithm, mobile crowdsensing, NP-Hard, simulated annealing, task bundling | Journal | 36 |
Issue | ISSN | Citations |
9 | 0884-8173 | 2 |
PageRank | References | Authors |
0.39 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tianlu Zhao | 1 | 2 | 0.39 |
| Yongjian Yang | 2 | 39 | 14.05 |
| En Wang | 3 | 21 | 8.13 |
| Shahid Mumtaz | 4 | 878 | 110.36 |
| Xiaochun Cheng | 5 | 75 | 10.15 |