{'fraction_non_alphanumeric': 0.018114011720831113, 'fraction_numerical': 0.002131060202450719, 'mean_word_length': 5.566433566433567, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Crowd Foraging: A QoS-Oriented Self-Organized Mobile Crowdsourcing Framework Over Opportunistic Networks

Recent years have witnessed the proliferation of mobile crowdsourcing that brings a new opportunity to leverage human intelligence and movement behaviors to wider application areas. In parallel with the development of online centralized platforms, we look into the realization of self-organized mobile crowdsourcing drawing on opportunistic networks, and propose the Crowd Foraging framework, in which a mobile task requester can proactively recruit a massive crowd of opportunistic encountered mobile workers in real time for quick and high-quality results. We present a comprehensive framework model that fully integrates human behavior factors for modeling task profile, worker arrival, and work ability, and then introduce a service quality concept to indicate the expected service gain that a requester can enjoy when she recruits an arrival worker by jointly considering the work ability of workers as well as timeliness and reward of tasks. Furthermore, we formulate a sequential worker recruitment problem as an online multiple stopping problem to maximize the expected sum of service quality, and accordingly derive an optimal worker recruitment policy through the dynamic programming principle, which exhibits a nice threshold-based structure. We provide data-driven case studies to validate the assumptions used in the policy design, and conduct extensive trace-driven numerical evaluations, which demonstrate that our policy can achieve superior performance (e.g., improve more than 30% performance over classic policies). Besides, our Android prototype shows that the Crowd Foraging framework is cost-efficient, such as requiring less than 7 s and 6 J in terms of time and energy consumption for the optimal threshold calculation in our policy in most cases.