In the Internet of things (IoT) era, user authentication is an essential to ensure the security of connected devices and the customization of passive services. However, conventional knowledge-based and physiological biometric-based authentication systems (e.g., password, face recognition, and fingerprints) are susceptible to shoulder surfing attacks, smudge attacks and heat attacks. The powerful sensing capabilities of IoT devices including smartphones, wearables, robots and autonomous vehicles enable the continuous authentication (CA) based on behavioral biometrics. Artificial Intelligence (AI) approaches hold significant promise in sifting through large volumes of heterogeneous biometrics data to offer unprecedented user authentication and user identification capabilities. In this survey paper, we outline the nature of continuous authentication in IoT applications, highlight the key behavioral signals, and summarize the extant solutions from an AI perspective. Based on our systematic and comprehensive analysis, we discuss the challenges and promising future directions to guide the next generation of AI-based continuous authentication research.

With the rapid development of mobile networks and the proliferation of mobile devices, spatial crowdsourcing, which refers to recruiting mobile workers to perform location-based tasks, has gained emerging interest from both research communities and industries. In this paper, we consider a spatial crowdsourcing scenario: in addition to specific spatial constraints, each task has a valid duration, operation complexity, budget limitation, and the number of required workers. Each volunteer worker completes assigned tasks while conducting his/her routine tasks. The system has a desired task probability coverage and budget constraint. Under this scenario, we investigate an important problem, namely heterogeneous spatial crowdsourcing task allocation (HSC-TA), which strives to search a set of representative Pareto-optimal allocation solutions for the multi-objective optimization problem, such that the assigned task coverage is maximized and incentive cost is minimized simultaneously. To accommodate the multi-constraints in heterogeneous spatial crowdsourcing, we build a worker mobility behavior prediction model to align with allocation process. We prove that the HSC-TA problem is NP-hard. We propose effective heuristic methods, including multi-round linear weight optimization and enhanced multi-objective particle swarm optimization algorithms to achieve adequate Pareto-optimal allocation. Comprehensive experiments on both real-world and synthetic data sets clearly validate the effectiveness and efficiency of our proposed approaches.

Spatial crowdsourcing (SC) is an emerging paradigm of crowdsourcing, which commits workers to move to some particular locations to perform spatio-temporal-relevant tasks (e.g., sensing, activity organization). Task allocation or worker selection is a significant problem that may impact the quality of completion of SC tasks. Based on a conceptual model and generic framework of SC task allocation, this paper firstly gives a review of the current state of research in this field, including single task allocation, multiple task allocation, low-cost task allocation, and quality-enhanced task allocation. We further investigate the future trends and open issues of SC task allocation, including skill-based task allocation, group recommendation and collaboration, task composition and decomposition, and privacy-preserving task allocation. Finally, we discuss the practical issues on real-world deployment as well as the challenges for large-scale user study in SC task allocation.

Mobile crowdsensing (MCS) is a new paradigm to collect sensing data and infer useful knowledge over a vast area for numerous monitoring applications. In urban environments, as more and more applications need to utilize multi-source sensing information, it is almost indispensable to develop a generic mechanism supporting multiple concurrent MCS task assignment. However, most existing multi-task assignment methods focus on homogeneous tasks. Due to the diverse spatiotemporal task requirements and sensing contexts, MCS tasks often differ from each other in many aspects (e.g., spatial coverage, temporal interval). To this end, in the paper, we present and formalize an important Heterogeneous Multi-Task Assignment (HMTA) problem in mobile crowdsensing systems, and try to maximize data quality and minimize total incentive budget. By leveraging the implicit spatiotemporal correlations among heterogeneous tasks, we propose a two-stage HMTA problem-solving approach to effectively handle multiple concurrent tasks in a shared resource pool. Finally, in order to improve the assignment search efficiency, a decomposition-and-combination framework is devised to accommodate large-scale problem scenario. We evaluate our approach extensively using two large-scale real-world data sets. The experimental results validate the effectiveness and efficiency of our proposed approach.

This paper builds a Food Delivery Network (FooDNet in short) using spatial crowdsourcing. It investigates the participation of urban taxis to support on demand take-out food delivery. Unlike existing SC-enabled service sharing systems, the delivery of food in FooDNet is more time-sensitive and the optimization problem is more complex regarding high-efficiency, huge-number of delivery needs. In particular, two on demand food delivery problems under different situations are studied in our work: (1) for O-OTOD, the food is opportunistically delivered by taxis when carrying passengers, and the optimization goal is to minimize the number of selected taxis to maintain a relatively high incentive to the participated drivers; (2) for D-OTOD, taxis dedicatedly deliver food without taking passengers, and the aim is to minimize the number of selected taxis and the total traveling distance to reduce the cost. A two-stage approach, including the construction algorithm and the Adaptive Large Neighborhood Search algorithm based on simulated annealing, is proposed to solve the problem. We have conducted extensive experiments based on the real-world datasets, including city-wide restaurant data, cell tower data, and the large-scale taxi trajectory data with 10,000 taxis. Experimental results demonstrate that our proposed algorithms are more effective and efficient than baselines.