Abstract
Mobile crowdsensing (MCS) has been widely studied with the popularization of mobile intelligent devices, while a large number of sensing data can be obtained by using existing mobile devices. Multi-task allocation is an important problem for MCS. In this paper, we propose a highly reliable multi-task allocation (RMA) framework that considers the offline stage and online stage. In the offline stage, we propose a network flow model based on reverse auction, while adding the bid price compensation (BPC) strategy to ensure workers we recruit are reliable. In the online stage, we propose the asynchronous k-secretary strategy to achieve dynamic real-time recruitment of workers and prove the competitive ratio is \(1/e^k\). Experimental results over the Rome taxi track data set show that our two-stage framework has better coverage and budget consumption, as well as good computational efficiency.
P. Li—This work is partially supported by the NSF of China (No. 61802286), the Hubei Provincial Natural Science Foundation of China (No. 2018CFB424).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998)
Gao, H., Liu, C.H., Tang, J., Yang, D., Hui, P., Wang, W.: Online quality-aware incentive mechanism for mobile crowd sensing with extra bonus. IEEE Trans. Mob. Comput. 18(11), 2589–2603 (2018)
Li, C., Zhang, B., Gong, W.: Location-based online task assignment and path planning for mobile crowdsensing. IEEE Trans. Veh. Technol. 68(2), 1772–1783 (2018)
Liu, J., Shen, H., Narman, H.S., Chung, W., Lin, Z.: A survey of mobile crowdsensing techniques: a critical component for the Internet of Things. ACM Trans. Cyber.-Phys. Syst. 2(3), 1–26 (2018). Article no. 18
Liu, W., Yang, Y., Wang, E., Wu, J.: User recruitment for enhancing data inference accuracy in sparse mobile crowdsensing. IEEE Internet Things J. 7(3), 1802–1814 (2020)
Liu, Y., Guo, B., Wang, Y., Wu, W., Yu, Z., Zhang, D.: TaskMe: multi-task allocation in mobile crowd sensing. In: Proceedings of the 2016 ACM International Joint Conference on Pervasive and Ubiquitous Computing, UbiComp 2016, pp. 403–414. Association for Computing Machinery, New York (2016)
Tao, X., Song, W.: Location-dependent task allocation for mobile crowdsensing with clustering effect. IEEE Internet Things J. 6(1), 1029–1045 (2019)
Wang, E., Yang, Y., Jie, W., Liu, W., Wang, X.: An efficient prediction-based user recruitment for mobile crowdsensing. IEEE Trans. Mob. Comput. 17(1), 16–28 (2018)
Wang, E., Yang, Y., Wu, J., Lou, K., Luan, D., Wang, H.: User recruitment system for efficient photo collection in mobile crowdsensing. IEEE Trans. Hum.-Mach. Syst. 50(1), 1–12 (2020)
Wang, J., et al.: HyTasker: hybrid task allocation in mobile crowd sensing. IEEE Trans. Mob. Comput. 19(3), 598–611 (2020)
Wang, J., Wang, F., Wang, Y., Zhang, D., Wang, L., Qiu, Z.: Social-network-assisted worker recruitment in mobile crowd sensing. IEEE Trans. Mob. Comput. 18(7), 1661–1673 (2019)
Wang, L., Yu, Z., Zhang, D., Guo, B., Liu, C.H.: Heterogeneous multi-task assignment in mobile crowdsensing using spatiotemporal correlation. IEEE Trans. Mob. Comput. 18(1), 84–97 (2019)
Zhou, R., Li, Z., Wu, C.: A truthful online mechanism for location-aware tasks in mobile crowd sensing. IEEE Trans. Mob. Comput. 17(8), 1737–1749 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Xiao, J., Li, P., Nie, L. (2020). A Reliable Multi-task Allocation Based on Reverse Auction for Mobile Crowdsensing. In: Yu, D., Dressler, F., Yu, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2020. Lecture Notes in Computer Science(), vol 12384. Springer, Cham. https://doi.org/10.1007/978-3-030-59016-1_44
Download citation
DOI: https://doi.org/10.1007/978-3-030-59016-1_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-59015-4
Online ISBN: 978-3-030-59016-1
eBook Packages: Computer ScienceComputer Science (R0)