Skip to main content

Minimum Cost Spatial-Temporal Task Allocation in Mobile Crowdsensing

  • Conference paper
  • First Online:
Wireless Algorithms, Systems, and Applications (WASA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9798))

Abstract

With the advances of sensors in smart devices, Mobile Crowdsensing (MCS) is flourishing. In this paper, we focus on Cost-minimizing Task Allocation (CTA) problem with spatial-temporal constraints in MCS. The MCS platform gives a set of tasks with different locations and sensing durations. Meanwhile, the platform hopes to allocate the spatial-temporal tasks to a part of participants with the minimum cost. We prove the NP-hardness of this problem and solve it based on the classical primal-dual algorithm. Moreover, we demonstrate that the approximation ratio is a variable about the scale of the problem. Then, we design a heuristic algorithm based on the Tabu search to solve the CTA problem and point out that the lower bound is guaranteed by the initialization progress. Finally, we conduct extensive simulations to show the significant performance of our algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alvarez-Valdes, R., Parreo, F., Tamarit, J.: A tabu search algorithm for a two-dimensional non-guillotine cutting problem. Eur. J. Oper. Res. 183(3), 1167–1182 (2007)

    Article  MATH  Google Scholar 

  2. Chu, E.T.H., Chen, Y., Liu, J., Zao, J.: Strategies for crowdsourcing for disaster situation information. WIT Trans. Built Environ. 119, 257–269 (2011)

    Article  Google Scholar 

  3. Du, D.Z., Ko, K.I., Hu, X.: Primal-dual schema and local ratio. In: Du, D.Z., Ko, K.I., Hu, X. (eds.) Design and Analysis of Approximation Algorithms. Springer Optimization and Its Applications, vol. 62, pp. 297–337. Springer, New York (2012)

    Chapter  Google Scholar 

  4. Feige, U.: A threshold of ln n for approximating set cover (preliminary version). In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing (1996)

    Google Scholar 

  5. Ganti, R.K., Ye, F., Lei, H.: Mobile crowdsensing: current state and future challenges. IEEE Commun. Mag. 49(11), 32–39 (2011)

    Article  Google Scholar 

  6. He, S., Shin, D.H., Zhang, J., Chen, J.: Toward optimal allocation of location dependent tasks in crowdsensing. In: INFOCOM (2014)

    Google Scholar 

  7. He, Z., Cao, J., Liu, X.: High quality participant recruitment in vehicle-based crowdsourcing using predictable mobility. In: INFOCOM (2015)

    Google Scholar 

  8. Karaliopoulos, M., Telelis, O., Koutsopoulos, I.: User recruitment for mobile crowdsensing over opportunistic networks. In: INFOCOM (2015)

    Google Scholar 

  9. Koukoumidis, E., Martonosi, M., Peh, L.S.: Leveraging smartphone cameras for collaborative road advisories. IEEE Trans. Mobile Comput. 11(5), 707–723 (2012)

    Article  Google Scholar 

  10. Rajagopalan, S., Vazirani, V.V.: Primal-dual rnc approximation algorithms for set cover and covering integer programs. SIAM J. Comput. 28(2), 525–540 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  11. Reddy, S., Estrin, D., Srivastava, M.: Recruitment framework for participatory sensing data collections. In: Floréen, P., Krüger, A., Spasojevic, M. (eds.) Pervasive 2010. LNCS, vol. 6030, pp. 138–155. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Santis, V.D.: Ear temperature increase produced by cellular phones under extreme exposure conditions. IEEE Trans. Microw. Theory Tech. 60(6), 1728–1734 (2012)

    Article  Google Scholar 

  13. Sherchan, W., Jayaraman, P.P., Krishnaswamy, S., Zaslavsky, A., Loke, S., Sinha, A.: Using on-the-move mining for mobile crowdsensing. In: 2012 IEEE 13th International Conference on Mobile Data Management (MDM) (2012)

    Google Scholar 

  14. Wan, P.J., Du, D.Z., Pardalos, P., Wu, W.: Greedy approximations for minimum submodular cover with submodular cost. Comput. Optim. Appl. 45(2), 463–474 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Xiao, M., Wu, J., Huang, L.: Community-aware opportunistic routing in mobile social networks. IEEE Trans. Comput. 63(7), 1682–1695 (2014)

    Article  MathSciNet  Google Scholar 

  16. Xiao, M., Wu, J., Huang, L., Wang, Y., Liu, C.: Multi-task assignment for crowdsensing in mobile social networks. In: INFOCOM (2015)

    Google Scholar 

  17. Xu, J., Xiang, J., Yang, D.: Incentive mechanisms for time window dependent tasks in mobile crowdsensing. IEEE Trans. Wirel. Commun. 14(11), 6353–6364 (2015)

    Article  Google Scholar 

Download references

Acknowledgment

This research was supported by the National Natural Science Foundation of China (NSFC) (Grant No. 61572457, 61379132, 61303206, 61572342, 61502261) and the Natural Science Foundation of Jiangsu Province in China (Grant No. BK20131174, BK2009150).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mingjun Xiao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Yu, J., Xiao, M., Gao, G., Hu, C. (2016). Minimum Cost Spatial-Temporal Task Allocation in Mobile Crowdsensing. In: Yang, Q., Yu, W., Challal, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2016. Lecture Notes in Computer Science(), vol 9798. Springer, Cham. https://doi.org/10.1007/978-3-319-42836-9_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42836-9_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42835-2

  • Online ISBN: 978-3-319-42836-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics