Spatial Crowdsourcing Systems Research Articles

SQCS: A sustainable quality control system for spatial crowdsourcing via three-party evolutionary game: Theory and practice

Quality control of sensing data poses a fundamental challenge in Spatial Crowdsourcing (SC) applications, and various incentive mechanisms have been proposed to effectively motivate workers. However, real-world SC systems involve multiple stakeholders, namely workers, platforms, and requesters, who exhibit bounded rationality. Moreover, prior research has often neglected the practical aspect of platforms needing to verify sensing data against ground truth information, which incurs a cost. Therefore, platforms face the constraint of verification cost and must judiciously select the verification rate. In this paper, a Sustainable Quality Control System (SQCS) is proposed, which employs a three-party evolutionary game to model the dynamic interaction among workers, platforms, and requesters in practical SC scenarios. Based on this dynamic model: (1) In theory, we derive the minimum verification rate required for effective worker monitoring and the maximum verification cost that platforms can sustainably bear via the analysis of evolutionary stable strategies. These findings serve as guidelines for achieving sustainable quality control within the SQCS framework; (2) In practice, we apply the SQCS framework to the SC scenario of urban air pollution monitoring. The optimal quality control strategy that maximizes overall social benefits is analyzed via numerical methods. Extensive experimental validation is conducted to demonstrate the effectiveness of the proposed theory and practical approach. These findings provide valuable insights for the sustainable development of SC systems.

PPTA: A location privacy-preserving and flexible task assignment service for spatial crowdsourcing

With the rapid growth of sensor-rich mobile devices, spatial crowdsourcing (SC) has emerged as a new crowdsourcing paradigm harnessing the crowd to perform location-dependent tasks. To appropriately select workers that are near the tasks, SC systems need to perform location-based task assignment, which requires collecting worker locations and task locations. Such practice, however, may easily compromise the location privacy of workers. In light of this, in this paper, we design, implement, and evaluate PPTA, a new system framework for location privacy-preserving task assignment in SC with strong security guarantees. PPTA takes advantage of only lightweight cryptography (such as additive secret sharing, function secret sharing, and secure shuffle), and provides a suite of tailored secure components required by practical location-based task assignment processes. Specifically, aiming for practical usability, PPTA is designed to flexibly support two realistic task assignment settings: (i) the online setting where tasks arrive and get processed at the SC platform one by one, and (ii) the batch-based setting where tasks arrive and get processed in a batch. Extensive experiments over a real-world dataset demonstrate that while providing strong security guarantees, PPTA supports task assignment with efficacy comparable to plaintext baselines and with promising performance.

On the task assignment with group fairness for spatial crowdsourcing

Task assignment, the core problem of Spatial Crowdsourcing (SC), is often modeled as an optimization problem with multiple constraints, and the quality and efficiency of its solution determines how well the SC system works. Fairness is a critical aspect of task assignment that affects worker participation and satisfaction. Although the existing studies on SC have noticed the fairness problem, they mainly focus on fairness at the individual level rather than at the group level. However, differences among groups in certain attributes (e.g. race, gender, age) can easily lead to discrimination in task assignment, which triggers ethical issues and even deteriorates the quality of the SC system. Therefore, we study the problem of task assignment with group fairness for SC. According to the principle of fair budget allocation, we define a well-designed constraint that can be considered in the task assignment problem of SC systems, resulting in assignment with group fairness. We mainly consider the task assignment problem in a common One-to-One SC system (O2-SC), and our goal is to maximize the quality of the task assignment while satisfying group fairness and other constraints such as budget and spatial constraints. Specifically, we first give the formal definition of task assignment with group fairness constraint for O2-SC. Then, we prove that it is essentially an NP-hard combinatorial optimization problem. Next, we provide a novel fast algorithm with theoretical guarantees to solve it. Finally, we conduct extensive experiments using both synthetic and real datasets. The experimental results show that the proposed constraint can significantly improve the group fairness level of algorithms, even for a completely random algorithm. The results also show that our algorithm can efficiently and effectively complete the task assignment of SC systems while ensuring group fairness.

A Blockchain-Based Spatial Crowdsourcing System for Spatial Information Collection Using a Reward Distribution.

Due to the increasing relevance of spatial information in different aspects of location-based services, various methods are used to collect this information. The use of crowdsourcing due to plurality and distribution is a remarkable strategy for collecting information, especially spatial information. Crowdsourcing can have a substantial effect on increasing the accuracy of data. However, many centralized crowdsourcing systems lack security and transparency due to a trusted party’s existence. With the emergence of blockchain technology, there has been an increase in security, transparency, and traceability in spatial crowdsourcing systems. In this paper, we propose a blockchain-based spatial crowdsourcing system in which workers confirm or reject the accuracy of tasks. Tasks are reports submitted by requesters to the system; a report comprises type and location. To our best knowledge, the proposed system is the first system that all participants receive rewards. This system considers spatial and non-spatial reward factors to encourage users’ participation in collecting accurate spatial information. Privacy preservation and security of spatial information are considered in the system. We also evaluated the system efficiency. According to the experiment results, using the proposed system, information accuracy increased by 40%, and the minimum time for reviewing reports by facilities reduced by 30%. Moreover, we compared the proposed system with the current centralized and distributed crowdsourcing systems. This comparison shows that, although our proposed system omits the user’s history to preserve privacy, it considers a consensus-based approach to guarantee submitted reports’ accuracy. The proposed system also has a reward mechanism to encourage more participation.

Toward Privacy-Preserving Task Assignment for Fully Distributed Spatial Crowdsourcing

With the proliferation of human-carried mobile devices, spatial crowdsourcing has emerged as a transformative system, where requesters outsource their spatiotemporal tasks to a set of workers who are willing to perform the tasks at the specified locations. However, in order to make efficient assignments, the existing spatial crowdsourcing system usually requires workers and/or tasks to expose their locations, which raises a significant concern of compromising location privacy. In addition, traditional spatial crowdsourcing systems employ a centralized server to manage the information of workers and tasks. Such a centralized design does not scale to a large number of workers/tasks, making the server easily a bottleneck. In this article, we present an online framework for assigning tasks to workers without compromising the location privacy in a fully distributed manner. Our system protects the location privacy of both workers and tasks through homomorphic encryption. We further propose a novel wait-and-decide mechanism and a proportional-backoff mechanism to increase the number of assigned tasks. Extensive experiments on real-world data sets illustrate that our proposed system achieves a large number of task assignments in an efficient and privacy-preserving manner.

Blockchain and Deep Reinforcement Learning Empowered Spatial Crowdsourcing in Software-Defined Internet of Vehicles

Owing to its benefits such as flexibility, scalability, and interoperability, Software-Defined Networking (SDN) has been incorporated into Internet of Vehicles (IoV) to cope with the increasing demands of vehicular applications. The integration of SDN and IoV, namely SDN-IoV, can enrich many new applications for intelligent transportation such as traffic monitoring, smart navigation, and self-driving. The spatial crowdsourcing technology has been adopted as an effective data collection and processing method that is the premise of various SDN-IoV applications. However, as huge amounts of data are generated in spatial crowdsourcing services, the data privacy and security has become a key challenge for SDN-IoV. To overcome abovementioned challenge, a Deep Reinforcement Learning (DRL) and Blockchain empowered Spatial Crowdsourcing System (DB-SCS) is proposed. In DB-SCS, we design an improved multi-blockchain structure and a blockchain-based hierarchical task management method, which divide the spatial tasks into different categories according to the privacy requirements and the areas of the task and then decompose different categories of tasks and task receivers into sub-blockchains. While guaranteeing the data privacy, DB-SCS can also enhance the spatial crowdsourcing performance by using the proposed DRL-based management strategy to dynamically select the consensus algorithm, block size, and block generation rule. Extensive simulation experiments demonstrate that the DB-SCS can obtain high throughput, low overhead, and data privacy under various SDN-IoV scenarios.

Location Privacy-Preserving Distance Computation for Spatial Crowdsourcing

Data privacy, especially location privacy, is paramountly important for protecting individual's information in smart cities in the big data era. One of the examples is in spatial crowdsourcing (SC). It enables people not only to issue spatiotemporal tasks to ask for help as requesters but also to solve others' tasks as workers on the SC platform. While SC brings convenience to people, it also produces severe location privacy problems, which have been recently paid more attention from both academia and industries. In this article, we address the location privacy problem in SC in a practical and secure way. We propose a location privacy-preserving framework for almost all existed mainstream distance computations in the SC system, namely, Euclidean-L3P, Minkowski-L3P, Manhattan-L3P, and Chebyshev-L3P, among which the first two are constructed based on homomorphic encryption and composite-order multilinear mapping while the latter two on the homomorphic encryption and prefix membership verification approach. Location privacy is resolved because of the above techniques having enabled that all distance computations are evaluated through ciphertexts without disclosing any location information. Security analysis shows that our framework can prevent a strong adversary from obtaining participants' location privacy. Performance analysis evaluates computation and communication overheads between protocols. The results show that Euclidean-L3P is more efficient than Manhattan-L3P and Chebyshev-L3P in terms of computation overheads when the SC applications require a small number of participants, a large plaintext space, and a small number of base stations. Moreover, compared with Manhattan-L3P and Chebyshev-L3P, Euclidean-L3P is a better choice in terms of communication overhead.

SRA: Secure Reverse Auction for Task Assignment in Spatial Crowdsourcing

In this paper, we study a new type of spatial crowdsourcing, namely competitive detour tasking, where workers can make detours from their original travel paths to perform multiple tasks, and each worker is allowed to compete for preferred tasks by strategically claiming his/her detour costs. The objective is to make suitable task assignment by maximizing the social welfare of crowdsourcing systems and protecting workers’ private sensitive information. We first model the task assignment problem as a reverse auction process. We formalize the winning bid selection of reverse auction as an $n$ n -to-one weighted bipartite graph matching problem with multiple 0-1 knapsack constraints. Since this problem is NP-hard, we design an approximation algorithm to select winning bids and determine corresponding payments. Based on this, a Secure Reverse Auction (SRA) protocol is proposed for this novel spatial crowdsourcing. We analyze the approximation performance of the proposed protocol and prove that it has some desired properties, including truthfulness, individual rationality, computational efficiency, and security. To the best of our knowledge, this is the first theoretically provable secure auction protocol for spatial crowdsourcing systems. In addition, we also conduct extensive simulations on a real trace to verify the performance of the proposed protocol.

Spatial crowdsourcing based on Web mapping services

With the rapid development of mobile Internet and smartphones, crowdsourcing marketplaces has extended to spatial crowdsourcing (SC), where crowd workers perform spatial tasks (i.e., tasks related to a location) in the physical world using their mobile phones. Currently, most of existing spatial crowdsourcing algorithms (e.g., task assignment) assume the underlying road network is given or simply base on Euclidean space. However, in fact, not every spatial crowdsourcing platform has enough resources to possess map data (e.g., the road network and live traffic information) by itself, especially for these that are small or startup companies, while the Euclidean distance is usually not accurate enough for SC processing. To overcome these limitations, we propose a spatial crowdsourcing system based on Web mapping services, i.e., the spatial crowdsourcing platform can subscribe distance, live travel time and detailed route information from Web mapping services through their APIs, and utilize these retrieved map data for SC processing; furthermore, workers and task requesters can also snap their real locations to the locations on the road for privacy protection through the APIs. As retrieving map data from Web mapping services is much more expensive than accessing local data, we take the advantage of the pruning and route sharing approaches to reduce the number of external requests to Web mapping services, and our experimental results have proved their effectiveness.

Preserving Location Privacy in Spatial Crowdsourcing Under Quality Control

Emerging spatial crowdsourcing (SC) provides an approach for collecting and analyzing spatiotemporal information from intelligent transportation systems. However, the exposure of massive location privacy to potential adversaries for the purpose of quality control makes workers more vulnerable. To protect workers' location privacy, an obfuscation scheme is proposed to incorporate uncertainties into the SC quality control problem through obfuscating the standard location data in terms of both space and time. Two measures, location entropy and results accuracy, are used to evaluate the performance of location privacy protection. We theoretically and experimentally confirm the security and accuracy of the obfuscation approach. The results of experiments show that: a) hiding workers' location from the requester reduces the quality of SC; and b) obfuscation arithmetic with appropriate obfuscation coefficients protects workers' location privacy with little effect on SC quality. Under the protection of this obfuscation scheme, the new system provides better security and similar quality compared to the existing SC system.

An experimental evaluation of task assignment in spatial crowdsourcing

Recently, with the rapid development of mobile devices and the crowdsourcing platforms, the spatial crowdsourcing has attracted much attention from the database community. Specifically, spatial crowdsourcing refers to sending a location-based request to workers according to their positions, and workers need to physically move to specified locations to conduct tasks. Many works have studied task assignment problems in spatial crowdsourcing, however, their problem settings are different from each other. Thus, it is hard to compare the performances of existing algorithms on task assignment in spatial crowdsourcing. In this paper, we present a comprehensive experimental comparison of most existing algorithms on task assignment in spatial crowdsourcing. Specifically, we first give general definitions about spatial workers and spatial tasks based on definitions in the existing works such that the existing algorithms can be applied on the same synthetic and real data sets. Then, we provide a uniform implementation for all the tested algorithms of task assignment problems in spatial crowdsourcing (open sourced). Finally, based on the results on both synthetic and real data sets, we discuss the strengths and weaknesses of tested algorithms, which can guide future research on the same area and practical implementations of spatial crowdsourcing systems.

Task-Management Method Using R-Tree Spatial Cloaking for Large-Scale Crowdsourcing

With the development of sensor technology and the popularization of the data-driven service paradigm, spatial crowdsourcing systems have become an important way of collecting map-based location data. However, large-scale task management and location privacy are important factors for participants in spatial crowdsourcing. In this paper, we propose the use of an R-tree spatial cloaking-based task-assignment method for large-scale spatial crowdsourcing. We use an estimated R-tree based on the requested crowdsourcing tasks to reduce the crowdsourcing server-side inserting cost and enable the scalability. By using Minimum Bounding Rectangle (MBR)-based spatial anonymous data without exact position data, this method preserves the location privacy of participants in a simple way. In our experiment, we showed that our proposed method is faster than the current method, and is very efficient when the scale is increased.

Efficient task assignment in spatial crowdsourcing with worker and task privacy protection

Spatial crowdsourcing (SC) outsources tasks to a set of workers who are required to physically move to specified locations and accomplish tasks. Recently, it is emerging as a promising tool for emergency management, as it enables efficient and cost-effective collection of critical information in emergency such as earthquakes, when search and rescue survivors in potential ares are required. However in current SC systems, task locations and worker locations are all exposed in public without any privacy protection. SC systems if attacked thus have penitential risk of privacy leakage. In this paper, we propose a protocol for protecting the privacy for both workers and task requesters while maintaining the functionality of SC systems. The proposed protocol is built on partially homomorphic encryption schemes, and can efficiently realize complex operations required during task assignment over encrypted data through a well-designed computation strategy. We prove that the proposed protocol is privacy-preserving against semi-honest adversaries. Simulation on two real-world datasets shows that the proposed protocol is more effective than existing solutions and can achieve mutual privacy-preserving with acceptable computation and communication cost.

Spatial crowdsourcing

Crowdsourcing is a new computing paradigm where humans are actively enrolled to participate in the procedure of computing, especially for tasks that are intrinsically easier for humans than for computers. The popularity of mobile computing and sharing economy has extended conventional web-based crowdsourcing to spatial crowdsourcing (SC), where spatial data such as location, mobility and the associated contextual information, plays a central role. In fact, spatial crowdsourcing has stimulated a series of recent industrial successes including Citizen Sensing (Waze), P2P ride-sharing (Uber) and Real-time Online-To-Offline (O2O) services (Instacart and Postmates). In this tutorial, we review the paradigm shift from web-based crowdsourcing to spatial crowdsourcing. We dive deep into the challenges and techniques brought by the unique spatio-temporal characteristics of spatial crowdsourcing. Particularly, we survey new designs in task assignment, quality control, incentive mechanism design and privacy protection on spatial crowdsourcing platforms, as well as the new trend to incorporate crowdsourcing to enhance existing spatial data processing techniques. We also discuss case studies of representative spatial crowdsourcing systems and raise open questions and current challenges for the audience to easily comprehend the tutorial and to advance this important research area.

SpatialRecruiter: Maximizing Sensing Coverage in Selecting Workers for Spatial Crowdsourcing

Spatial crowdsourcing and crowdsensing are two emerging crowdsourcing paradigms, which enable a variety of location-based query and sensing tasks. In spatial crowdsourcing, mobile workers are required to travel physically to target locations in order to complete query tasks. Most existing work, hence, has focused on designing efficient query task assignment schemes to maximize the task completion rate under traveling constraints of workers for spatial crowdsourcing systems. In crowdsensing, on the other hand, sensor recordings of workers’ smartphones are of interest and have been collected to build various applications. Therefore, work concerning crowdsensing has strived to maximize the coverage area of sensor trajectories by selecting a set of workers. In this paper, we investigate the integration of these two paradigms. We notice a key link between these paradigms: While a worker is traveling to the target location of a query task, his trajectory may provide valuable coverage for a sensing task. Therefore, we propose a task management framework, named SpatialRecruiter, to efficiently match workers to the merged query and sensing tasks. We propose two coverage estimation functions to compute the coverage potential of a worker. Then, we design a greedy heuristic to select and assign workers. The experimental results on a real-world dataset demonstrate that the proposed strategies are efficient and effective in meeting the requirements of both paradigms.