Abstract

In the mobile crowdsensing task assignment, under the premise that the data platform does not know the user’s perceived quality or cost value, how to establish a suitable user recruitment mechanism is the critical issue that this article needs to solve. It is necessary to learn the user’s perceived quality in the execution p. It also needs to try its best to ensure the efficiency and profit maximization of the mobile group intelligence perception platform. Therefore, this paper proposes a mobile crowdsensing user recruitment algorithm based on Combinatorial Multiarmed Bandit (CMAB) to solve the recruitment problem with known and unknown user costs. Firstly, the user recruitment process is modeled as a combined multiarm bandit model. Each rocker arm represents the selection of different users, and the income obtained represents the user’s perceived quality. Secondly, it proposes the upper confidence bound (UCB) algorithm, which updates the user’s perceptual quality according to the completion of the task. This algorithm sorts the users’ perceived quality values from high to low, then selects the most significant ratio of perceived quality to recruitment costs under the budget condition, assigns tasks, and updates their perceived quality. Finally, this paper introduces the regret value to measure the efficiency of the user recruitment algorithm and conducts many experimental simulations based on real data sets to verify the feasibility and effectiveness of the algorithm. The experimental results show that the recruitment algorithm with known user cost is close to the optimal algorithm, and the recruitment algorithm with unknown user cost is more than 75% of the optimal algorithm result, and the gap tends to decrease as the budget cost increases, compared with other comparisons. The algorithm is 25% higher, which proves that the proposed algorithm has good learning ability and can independently select high-quality users to realize task assignments.

Highlights

  • Mobile crowdsensing (MCS) is a new type of perception mode

  • One of its core ideas is to recruit a large number of users to complete spatiotemporal perception tasks and obtain data resources so that each mobile user carrying an intelligent terminal device can be seen as a sensing node to meet the dynamic task types that cannot be achieved by traditional static sensing tasks [1]

  • Erefore, this paper proposes a user recruitment algorithm based on Combinatorial Multiarmed Bandit (CMAB), which can interact with the perception data platform in real time, use reinforcement learning to learn the perception quality of users, and solve the problem of maximizing the perception quality of tasks under a limited budget

Read more

Summary

Research Article

User Recruitment Algorithm for Maximizing Quality under Limited Budget in Mobile Crowdsensing. In the mobile crowdsensing task assignment, under the premise that the data platform does not know the user’s perceived quality or cost value, how to establish a suitable user recruitment mechanism is the critical issue that this article needs to solve. Erefore, this paper proposes a mobile crowdsensing user recruitment algorithm based on Combinatorial Multiarmed Bandit (CMAB) to solve the recruitment problem with known and unknown user costs. Each rocker arm represents the selection of different users, and the income obtained represents the user’s perceived quality. It proposes the upper confidence bound (UCB) algorithm, which updates the user’s perceptual quality according to the completion of the task. This paper introduces the regret value to measure the efficiency of the user recruitment algorithm and conducts many experimental simulations based on real data sets to verify the feasibility and effectiveness of the algorithm. e experimental results show that the recruitment algorithm with known user cost is close to the optimal algorithm, and the recruitment algorithm with unknown user cost is more than 75% of the optimal algorithm result, and the gap tends to decrease as the budget cost increases, compared with other comparisons. e algorithm is 25% higher, which proves that the proposed algorithm has good learning ability and can independently select high-quality users to realize task assignments

Introduction
User recruitment Return data results
Related Work
Task weight
2AP Ycmin
Total perceived quality
Number of issued tasks
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call