Taming the big to small: efficient selfish task allocation in mobile crowdsourcing systems

Qingyu Li, Panlong Yang*, Xiaochen Fan, Shaojie Tang, Chaocan Xiang, Deke Guo, Fan Li

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

6 引用 (Scopus)
Plum Print visual indicator of research metrics
  • Citations
    • Citation Indexes: 6
  • Captures
    • Readers: 8
see details

摘要

This paper investigates the selfish load balancing problem in mobile distributed crowdsourcing networks. Conventional methods heavily relied on cooperation among users to achieve balanced resource utilization in a platform-centric view. In achieving fairly low communication and computational overhead, this work leverages the d-choice method based on Ball and Bin theory for effective balancing under limited information and the Proportional Allocation scheme for selfish load balancing, maintaining good load balancing property among selfish users. Even with limited information, the balancing performance could be improved significantly. Moreover, theoretical analysis has been presented in convergence property. Extensive evaluations have been made to show that Chance-Choice outperforms several existing algorithms. Typically, comparing with Proportional Allocation scheme, it could decrease the load gap between the maximum and the minimal in system by 50% to 80% and reduce the overhead complexity from O(n) to O(1) comparing with the Max-weight Best Response algorithm, where n denotes the number of mobile users in a crowdsourcing system.

源语言英语
文章编号e4121
期刊Concurrency Computation Practice and Experience
29
14
DOI
出版状态已出版 - 25 7月 2017

指纹

探究 'Taming the big to small: efficient selfish task allocation in mobile crowdsourcing systems' 的科研主题。它们共同构成独一无二的指纹。

引用此

Li, Q., Yang, P., Fan, X., Tang, S., Xiang, C., Guo, D., & Li, F. (2017). Taming the big to small: efficient selfish task allocation in mobile crowdsourcing systems. Concurrency Computation Practice and Experience, 29(14), 文章 e4121. https://doi.org/10.1002/cpe.4121