Load Balanced Mobile User Recruitment for Mobile Crowdsensing Systems
Load Balanced Mobile User Recruitment for Mobile Crowdsensing Systems
复制标题
移动人群感知系统的负载平衡移动用户招募
DOI：
10.1109/lcomm.2017.2732403
复制
发表时间：
2017-11-01
期刊：
影响因子：
--
通讯作者：
Chen, Xiaoming
中科院分区：
文献类型：
--
作者：
An, Xin;Guo, Hao;Chen, Xiaoming
在这封信中，我们研究了移动群智系统的移动用户招募问题。这封信的目的不是最小化总体感知成本或用户效用，而是优化移动用户的负载平衡，这对于资源受限的个人用户尤为重要。我们将此类问题称为负载平衡移动用户招募（LB-MUR）问题。具体来说，我们首先将 LB-MUR 问题表述为混合整数线性规划（LP），并证明它是 NP 困难的。然后提出了一种基于LP松弛的高效多项式时间次优算法。此外，我们推导了所提出算法的近似率。最后，我们通过仿真评估所提出方案的有效性。
In this letter, we study the mobile user recruitment problem for mobile crowdsensing systems. Instead of minimizing the overall sensing cost or user utility, this letter aims to optimize the load balancing of the mobile users, which is particularly important for the resource-constrained individual user. We refer to such a problem as the load balanced mobile user recruitment (LB-MUR) problem. Specifically, we first formulate the LB-MUR problem as a mixed integer linear programming (LP) and prove that it is NP-hard. Then an efficient polynomial-time suboptimal algorithm is proposed, which is based on LP relaxation. Furthermore, we derive the approximation ratio of the proposed algorithm. Finally, we evaluate the effectiveness of the proposed scheme through simulations.