A cost-efficient deal that can achieve high sensing quality with a low reward is the permanent goal of the requestor in mobile crowdsensing, which heavily depends on the quantity and quality of the workers. However, the spatial diversity and temporal dynamics lead to heterogeneous worker supplies, making it hard for the requestor to utilize a homogeneous pricing strategy to realize a cost-efficient deal from a systematic point of view. Therefore, a cost-efficient deal calls for a cost-efficient pricing strategy, boosting the whole sensing quality with less operation (computation) cost. However, the state-of-The-Art studies ignore the dual cost-efficient demands of large-scale sensing tasks. Hence, we propose a combinatorial pinning zero-determinant (ZD) strategy, which empowers the requestor to utilize a single strategy within its feasible range to minimize the total expected utilities of the workers throughout all sensing regions for each time interval, without being affected by the strategies of the workers. Through turning the worker-customized strategy to an interval-customized one, the proposed combinatorial pinning ZD strategy reduces the number of pricing strategies required by the requestor from O(n3) O(n3) to O(n) O(n). Besides, it extends the application scenarios of the classical ZD strategy from two-player simultaneous-move games to multiple-heterogeneous-player sequential-move ones, where a leader can determine the linear relationship of the players' expected utilities. Such an extension enriches the theoretical hierarchy of ZD strategies, broadening their application scope. Extensive simulations based on real-world data verify the effectiveness and efficiency of the proposed scheme.
- Mobile crowdsensing
- game theory
- pricing strategy
- quality control
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering