Mobile crowdsourcing is an emerging crowdsourcing paradigm, which generates large-scale sensing tasks and sensing data. One of the major issues in mobile crowdsourcing is how to maximize social welfare through selecting appropriate sensing tasks for crowd workers and selecting appropriate workers for sensing tasks such that it can improve the effectiveness and efficiency of mobile crowdsourcing. This paper proposes an incentive mechanism to maximize social welfare for mobile crowdsourcing and, respectively, investigates worker-centric task selection and platform-centric worker selection. This paper applies an optimization algorithm in task selection for mobile crowdsourcing systems. A discrete particle swarm optimization (DPSO) algorithm for worker-centric task selection is designed to maximize the utilities of workers. In addition, a platform-centric worker selection method, which integrates multiattribute auction and two-stage auction, is proposed to maximize the utility of the platform. The performance of the proposed incentive mechanism is evaluated through experiments. The experimental results show that the proposed incentive mechanism can improve the efficiency and truthfulness of mobile crowdsourcing effectively.

With the rapid development of Industry 5.0 and mobile devices, the research of mobile crowdsensing networks has become an important research focus. Task allocation is an important research content that can inspire crowd workers to participate in crowd tasks and provide truthful sensed data in mobile crowdsourcing systems. However, how to inspire crowd workers to participate in crowd tasks and provide truthful sensed data still has many challenges. In this article, based on the Markov model and collaborative filtering model, the similarities, trajectory prediction, dwell time, and trust degree are considered to propose the Markov and Collaborative filtering-based Task Recommendation (MCTR) model. Then, based on the Walrasian equilibrium, the optimum solution is researched to maximize the social welfare of mobile crowdsourcing systems. Finally, the comparison experiments are carried out to evaluate the performance of the proposed multiobjective optimization and the Markov-based task allocation with other methods. Through comparison experiments, the efficiency and adaptation of mobile crowdsourcing systems could be improved by the proposed task allocation.

Internet of Things (IoT) devices are being used widely in the fields of smart city, smart grid, environmental monitoring, Internet of Vehicles and other fields that need large-scale sensing data. However, the research on storage and computation power for IoT is still in its early stages. The game theory converts the interaction between two IoT devices into a game where the conflict is resolved by utilizing the game’s equilibrium conditions. Our goal with the game theory is to maximize the utility for every device in the IoT network. In this article, we review the recent game-theory-based solutions proposed in IoT networks. We summarize game theory concepts and categorize the common game models for ease of understanding for the reader. Later, we focus on analyzing solutions proposed in resource allocation, task scheduling, node selection, quality of service, and network security. Finally, we summarize research challenges and propose future research directions.

With the rapid development of the Internet of Things (IoT) and the rapid popularization of 5 G networks, the data that needs to be processed in Mobile Crowdsourcing (MCS) system is increasing every day. Traditional cloud computing can no longer meet the needs of crowdsourcing for real-time data and processing efficiency, thus, edge computing was born. Edge computing can be calculated at the edge of network so that greatly improve the efficiency and real-time performance of data processing. In addition, most of the existing privacy protection technologies are based on the trusted third parties. Therefore, in view of the semi-trustworthiness of edge servers and the transparency of blockchain, this paper proposes a triple real-time trajectory privacy protection mechanism (T-LGEB) based on edge computing and blockchain. Through combining the localized differential privacy and multiple probability extension mechanism, the T-LGEB mechanism is proposed to send the requests and data to the edge server in this paper. Then, through the spatio-temporal dynamic pseudonym mechanism proposed in the paper, the entire trajectory of task participants is divided into multiple unrelated trajectory segments with different pseudonymous identities in order to protect the trajectory privacy of task participants while ensuring high data availability and real-time data. Through a large number of experiments and comparative analysis on multiple real data sets, the proposed T-LGEB has extremely high privacy protection capabilities and data availability, and the resource consumption caused is relatively low.

With the development of mobile networks and intelligent equipment, as a new intelligent data sensing paradigm in large-scale sensor applications such as the industrial Internet of Things, mobile crowd sensing (MCS) assigns industrial sensing tasks to workers for data collection and sharing, which has created a bright future for building a strong industrial system and improving industrial services. How to design an effective worker selection mechanism to maximize the utility of crowdsourcing is the research hotspot of mobile sensing technologies. This article studies the problem of least workers selection to make large MCS system perform sensing tasks more effective and achieve certain coverage with certain constraints being meeting. A many-objective worker selection method is proposed to achieve the desired tradeoff and an optimization mechanism is designed based on the enhanced differential evolution algorithm to ensure data integrity and search solution optimality. The effectiveness of the proposed method is verified through a large scale of experimental evaluation datasets collected from real world.