With the popularity of smart mobile devices embedded with rich sensors, mobile crowdsensing (MCS) has gradually attracted the attention of researchers in recent years. Task allocation is a key research problem in MCS systems, where platforms recruit workers and assign them crowd tasks. While previous research has focused on the utility of recruiting workers, the location factor of workers has been ignored. Therefore, this paper proposes a two-stage worker recruitment framework named BW-Selector, which recruits workers in two stages. In the offline stage, this paper proposes an opportunity-crowd worker recruitment algorithm, which first divides the task area with a Voronoi diagram, and then builds a prediction model based on long short-term memory (LSTM) to predict the movement trajectory of workers and solve the cold start in the traditional MCS system. In the online stage, for maximizing the task space coverage under the premise of a limited task budget, this paper proposes a participatory-crowd worker recruitment algorithm based on adaptive threshold selection. Finally, through experiments on real datasets, it is verified that BW-Selector has better performance in terms of task space coverage and running time under the same constraints compared with other methods.

With the widespread use of mobile networks and smart devices, opportunistic mobile crowdsensing (MCS) has emerged as one of the most promising sensing paradigms for intelligent data. In Opportunistic MCS, the real-time mobility of participants and requesters is a crucial feature, as it significantly impacts the quality of MCS services. However, most existing task allocation approaches focus on optimizing the overall system performance while disregarding the mobile attribute of participants and requesters. To remedy this issue, this article proposes a real-time route prediction-based multiobjective task allocation for Opportunistic MCS, called RRP-MOTA, which presents the participants’ route-considered task allocation scheme to maximize social welfare comprehensively. Specifically, instead of merely optimizing system performance, a two-stage mechanism is designed to comprehensively enhance task allocation efficiency by estimating and leveraging participants’ routes. Moreover, by utilizing participants’ spatio–temporal location information, an improved graph convolutional network-based participant route prediction method is developed to provide more accurate participant location information for task allocation. Furthermore, a reference vector-based multiobjective task allocation method is suggested to cater to diverse usage preferences by balancing quality of service and task cost. To validate the performance of our proposed method, extensive simulations are performed on synthetic and real datasets in two scenarios. Experimental results demonstrate that the proposed RRP-MOTA significantly outperforms the chosen existing designs.

With the rise of sensor-equipped mobile devices, Mobile Crowd Sensing (MCS) has emerged as an efficient method for information gathering. In smart city environmental sensing, workers can acquire data by merely being within the sensing area. Currently, most studies select opportunistic workers based on the workers’ prior preferences and ignore the effect of movement trajectories on potential opportunistic workers. This may result in the selected opportunistic workers being less-than-ideal, or even ignoring the failure of some tasks to be accomplished, thus resulting in a waste of resources. Therefore, this paper proposes a Recruitment Framework for judging Opportunistic Workers based on Movement Trajectories (RFOW-MT), a two-phase framework for worker recruitment. In the offline phase, combining the neural network model Long Short-Term Memory (LSTM) and Geohash algorithm, an algorithm to detect the set of candidate opportunistic workers is proposed, solving the problems of location privacy and search efficiency. In the online phase, in order to maximize the task spatial coverage under the task budget constraint, a task allocation algorithm based on geographic location packed grouping is proposed. Finally, RFOW-MT outperforms other methods in terms of task spatial coverage and runtime as verified by experiments on real datasets.

Deep neural networks are powerful and popular learning models; however, recent studies have shown that deep neural network-based policies are susceptible to deception by adversarial attacks. A minimalistic attack is a specialized form of adversarial attack that aims to accomplish successful attacks at the lowest possible cost. Recently, transfer optimization algorithms have been applied to deceive previously trained policies by acquiring knowledge from previously solved tasks. Experiments indicate that the transfer optimization algorithms perform well compared to traditional optimization algorithms. However, current transfer algorithms for addressing minimalistic attacks not only select a single source task for knowledge transfer but also tend to overly rely on identified appropriate source tasks. To address this issue, this paper introduces a similar locality based transfer evolutionary optimization algorithm. It can adaptively select multiple source tasks and extract valuable knowledge from these source tasks. Moreover, by leveraging the concept of similar locality, the algorithm alleviates its excessive dependence on familiar tasks, thereby providing fresh knowledge for the optimization of the target task. On this basis, the algorithm can mine more valuable knowledge from the large source task space to achieve a successful attack in a shorter period. The algorithm is tested on three Atari games-BeamRider, Qbert, and Seaquest-demonstrating its ability and potential to outperform other transfer optimization algorithms currently available in solving this problem.

Support Vector Machines (SVMs), as well-known algorithms, have been successfully applied to classification problems. However, when dealing with imbalanced data, the classification performance of SVMs could be significantly compromised. One approach to tackle the class imbalance is oversampling the minority class, exemplified by methods like SMOTE and its variants. These methods generate new samples by interpolation between existing ones and determine the weights based on the ratio of samples from different classes, leading to inaccurate weight assignment, limited generation scope, and indiscriminate sample generation. To address these limitations, we propose novel evolutionary oversampling algorithms based on Support Vector Machine (SVM) and Evolutionary Algorithms (EAs) called SEOA. SEOA leverages the inherent capability of SVM to identify the samples that have a critical influence on the decision boundary and assign them appropriate weights, thereby eliminating the reliance on human experience. Furthermore, SEOA utilizes a novel approach for sample generation and emphasizes the significance of margin for classification, introducing a mechanism that employs margin as the metric to evaluate the quality of generated samples. To assess the performance of SEOA, we conducted a comprehensive comparison against various oversampling methods across 19 real-world datasets. The results underscore SEOA's superiority, showcasing its distinct strengths in addressing the challenges posed by imbalanced classification.

Mobile crowdsourcing is rapidly growing with Artificial Intelligent of Things. At the same time, the type and complexity of the tasks requested by the requester change and diversify. Therefore, how to design allocation algorithms for the situation of increasing task complexity is particularly critical. In this paper, to cope with this problem, the idea of worker coalition collaboration and reputation evaluation mechanisms are introduced into it. A two-stage allocation based on same-region and cross-region is performed in the divided regional grid. In the first stage, multi-worker and multi-task allocation is realized by combining the reverse auction theory based on the workers’ historical reputation value, which motivates the workers with high reputation value to choose their tasks and contribute data with high sensed quality. The second stage utilizes genetic algorithms to select a coalition of workers for cross-region sensed execution for tasks that do not meet sensed quality requirements. This process will provide additional payoff incentives to compensate for travel costs within the worker coalition, increasing the number of tasks completed and maximizing social welfare. Finally, multiple comparison experiments on the real dataset Yelp are conducted for validation.

With the rapid progression of mobile crowdsourcing (MCS) technology, its growing influence in our daily lives has established it as a crucial component of modern society. However, while the convenience of MCS is widely appreciated, it also poses significant threats to personal privacy, particularly location privacy. This article introduces a novel system for personalized location privacy protection in MCS. The system is divided into three main parts. The first part presents an innovative algorithm that calculates the location privacy level of crowd workers. This algorithm is crucial in determining the location privacy level required by each individual crowd worker. The second part involves the design of a personalized differential privacy protection (P-DP) algorithm, which is based on the exponential mechanism. This algorithm provides varying degrees of privacy protection strength, tailored to the location privacy protection level of each crowd worker. Furthermore, we incorporate a trusted third party (TP) server to act as an intermediary. This server eliminates any correlation between the crowd workers and the data. It is also tasked with calculating the location privacy level and reward for each crowd worker. The third part of the system is the personalized localized differential privacy (LDP) protection (P- LDP) algorithm, this algorithm is designed to further solve the problem of privacy disclosure caused by the TP server being attacked. Finally, we have conducted a comprehensive evaluation of the proposed location privacy protection system using real data sets, and the results demonstrate that the system can effectively balance the location privacy protection of crowd workers and the availability of location data, thereby improving the efficiency and reliability of MCS.

Mobile crowdsourcing (MCS) is a new paradigm that uses various mobile devices to collect sensed data. Mobile edge computing (MEC) can effectively utilize the device resources of mobile edge, greatly relieve the pressure of network bandwidth and improve the response speed. In this article, we construct a four-party evolutionary game model consisting of the platform, crowd workers, task requesters, and edge servers. The computing tasks are conducted on edge servers, which greatly reduce remote data transmission and network operating costs and improve service quality. Taking into account the collusion between the platform and workers, and that between the platform and requesters, we analyze the stability of the strategic equilibrium in MCS using replicator dynamics methods. The optimal payoff strategies of the participants in different initial states are obtained. To prevent cheating and false-reporting problems, reward and punishment strategies are provided. Finally, the stability of the equilibrium of the four-party evolutionary game system is verified by simulation experiments, and an incentive strategy is designed to motivate all parties to choose the trust strategies.

Federated learning (FL) offers a credible solution for distributed data trading since it could train machine learning models in a distributed manner thereby enhancing data privacy without sharing local data. However, it is still challenging to trade data through FL due to unfair model allocation issues arising from the unreliability of user-provided data. To tackle it, we propose F2UL, a Fairness-aware Federated UnLearning solution that distributes models to users commensurate with their data quality. F2UL is trained in a two-stage (TST) way and contains three main components: 1) Label-free model quality assessment (LMQA) promotes fairness by evaluating models without user-specific data, ensuring uniform assessment standards. 2) Fair model distribution (FMD) addresses the issue of unfair model distribution by allocating models with feature mapping deviation, ensuring that users who contribute low-quality models do not receive enhanced models. 3) User data federated unlearning (UDFU) ensures fairness in model distribution by employing rapid recovery federated unlearning, safeguarding regular users from the adverse effects of low-quality data on model performance. In experiments on CIFAR10, F2UL reduces the low-quality data user accuracy to 9.09% and increases regular users’ accuracy by 3.02%, thereby demonstrating F2UL's capacity to ensure fairness in data trading.

Collaborative Mobile Crowdsourcing (CMCS) allows platforms to recruit worker teams to collaboratively execute complex sensing tasks. The efficiency of such collaborations could be influenced by trust relationships among workers. To obtain the asymmetric trust values among all workers in the social network, the Trust Reinforcement Evaluation Framework (TREF) based on Graph Convolutional Neural Networks (GCNs) is proposed in this paper. The task completion effect is comprehensively calculated by considering the workers' ability benefits, distance benefits, and trust benefits in this paper. The worker recruitment problem is modeled as an Undirected Complete Recruitment Graph (UCRG), for which a specific Tabu Search Recruitment (TSR) algorithm solution is proposed. An optimal execution team is recruited for each task by the TSR algorithm, and the collaboration team for the task is obtained under the constraint of privacy loss. To enhance the efficiency of the recruitment algorithm on a large scale and scope, the Mini-Batch K-Means clustering algorithm and edge computing technology are introduced, enabling distributed worker recruitment. Lastly, extensive experiments conducted on five real datasets validate that the recruitment algorithm proposed in this paper outperforms other baselines. Additionally, TREF proposed herein surpasses the performance of state-of-the-art trust evaluation methods in the literature.

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.

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 advent of intelligent technology, the users of spatio-temporal crowdsourcing and their participation in the crowdsourcing tasks continue to increase exponentially. This poses new challenges to the crowdsourcing field. One of the core research areas of spatio-temporal crowdsourcing is task assignment. Most of the existing research on task assignment is focused on offline optimal task assignment, where, the platform has already learned all the information about workers and tasks beforehand. However, these studies cannot obtain good results in real-world situations. At the same time, online task assignment problems often result in local optimal assignment. To solve these problems, more attention needs to be paid to online task assignments and the arrival time of workers. This paper proposes an Online Bilateral Assignment (OBA) problem based on the online assignment model. The competitive ratio of the Greedy algorithm is analyzed according to the OBA problem model. Also, another solution to the OBA problem according to the Greedy algorithm, the Improved-Baseline algorithm, is proposed. Additionally, a Bilateral Online Priority Reassignment algorithm (BOPR) is proposed. The BOPR algorithm realizes real-time task/worker assignment through the bilateral assignment as a solution for online task assignment. In order to guarantee the number of matching tasks, a priority queue is designed in the BOPR algorithm. Considering the waiting time deadlines of tasks and workers and the error rate for priority ranking, it avoids tasks and workers waiting too long and assigns each task to the best possible extent. On this basis, a two-stage assignment strategy is designed for unsuccessful tasks, which could minimize the error rate of the task and significantly improve the efficiency of task assignment. Finally, through experiments on real data sets, the algorithm's performance in terms of global utility value and the number of matches is evaluated.

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.

As a new paradigm to solve problems by gathering the intelligence of crowds, mobile crowdsourcing has become one of the hot spots in academic and industrial fields. Task requester, platform, and crowd workers are stakeholders in mobile crowdsourcing, which inevitably leads to conflicts of interest. In order to solve this problem, this article constructs a three-party evolutionary game model among task requester, platform, and crowd workers. This model also considers the collusion between crowd workers and the platform to make it more realistic. Then, the replication dynamics method is utilized to analyze the evolutionary stability strategy. The strategies of rewards and penalties are given to avoid free-riding and false-reporting problems. Finally, the stability of the equilibrium point in the three-party game system is verified through simulation experiments, and the effective methods to motivate each player to choose a trusted strategy are given.

With the rise of the Internet of Things (IoT) and fifth-generation (5G) networks, which have led to a surge in data processing and increased data transfer time, traditional cloud computing could no longer meet the needs of workers, so edge computing has emerged. Edge computing could meet the demand for low time consumption by processing data at the edge of the network and then transmitting it to a third-party platform. However, since the credibility of the third-party platform is unknown which can easily leak the privacy of workers. For the transparent mechanism of blockchain, a two-stage privacy protection mechanism based on blockchain is proposed to solve this problem. In the first stage, this paper proposes a double disturbance localized differential privacy (DDLDP) algorithm to disturb the location information of workers. In the second stage, all the sensing data are uploaded to the blockchain through edge nodes, processed by the edge cloud, and fed back to the requester. Blockchain technology not only guarantees the integrity of sensing data, but also prevents the possibility of third-party platforms from leaking workers' privacy. Through extensive performance evaluation and comparative experiments on real data sets, the DDLDP algorithm could effectively protect the privacy of workers and has higher service quality and data availability.

The problem of route planning on road network is essential to many Location-Based Services (LBSs). Road networks are dynamic in the sense that the weights of the edges in the corresponding graph constantly change over time, representing evolving traffic conditions. Thus, a practical route planning strategy is required to supply the continuous route optimization considering the historic, current, and future traffic condition. However, few existing works comprehensively take into account these various traffic conditions during the route planning. Moreover, the LBSs usually suffer from extensive concurrent route planning requests in rush hours, which imposes a pressing need to handle numerous queries in parallel for reducing the response time of each query. However, this issue is also not involved by most existing solutions. We therefore investigate a parallel traffic condition driven route planning model on a cluster of processors. To embed the future traffic condition into the route planning, we employ a GCN model to periodically predict the travel costs of roads within a specified time period, which facilitates the robustness of the route planning model against the varying traffic condition. To reduce the response time, a Dual-Level Path (DLP) index is proposed to support a parallel route planning algorithm with the filter-and-refine principle. The bottom level of DLP partitions the entire graph into different subgraphs, and the top level is a skeleton graph that consists of all border vertices in all subgraphs. The filter step identifies a global directional path for a given query based on the skeleton graph. In the refine step, the overall route planning for this query is decomposed into multiple sub-optimizations in the subgraphs passed through by the directional path. Since the subgraphs are independently maintained by different processors, the sub-optimizations of extensive queries can be operated in parallel. Finally, extensive evaluations are conducted to confirm the effectiveness and superiority of the proposal.

For many high-tech fields such as space exploration, nuclear technology, and smart automobiles, it is vital to timely find faulty components of man-made devices to ensure safety. However, there is nearlynoenough diagnostic experience accumulated in these new devices, and thus, it is hardly suitable to only apply the traditional expert/experience-based fault diagnosis approach. Thus, model-based diagnosis was proposed for efficient detection of faulty components; this approach explores the behavioral and structural information of the device to be diagnosed, and no experience is required. In model-based diagnosis, for a device to be diagnosed, minimal conflict sets of components are first generated, and all minimal hitting-sets for them will be derived as candidate diagnoses. Therefore, it is vital to efficiently generate all minimal hitting-sets to find the final diagnosis. Unfortunately, it is proven to be NP-hard when deriving all minimal hitting-sets for given minimal conflict sets. To improve the computing efficiency, in this article, we propose a novel approach calledTreeMerge, which considers a special type oftreestructure of minimal conflict sets of large sizes since structural information usually plays an important role in solving complex problems. Theoretically, compared with other algorithms, the time complexity of the new algorithm is greatly reduced, as the time complexity of the new algorithm becomeslinearrather thanquadratic. Furthermore, experimental results on multiple synthetic and benchmark examples show that the proposedTreeMergealgorithm is more efficient than many other state-of-the-art methods, with a reduction ofseveral orders of magnituderuntime (seconds).

With the advent of the Internet of Things (IoT) era, various application requirements have put forward higher requirements for data transmission bandwidth and real‐time data processing. Mobile edge computing (MEC) can greatly alleviate the pressure on network bandwidth and improve the response speed by effectively using the device resources of mobile edge. Research on mobile crowdsourcing in edge computing has become a hot spot. Hence, we studied resource utilization issues between edge mobile devices, namely, crowdsourcing scenarios in mobile edge computing. We aimed to design an incentive mechanism to ensure the long‐term participation of users and high quality of tasks. This paper designs a long‐term incentive mechanism based on game theory. The long‐term incentive mechanism is to encourage participants to provide long‐term and continuous quality data for mobile crowdsourcing systems. The multistrategy repeated game‐based incentive mechanism (MSRG incentive mechanism) is proposed to guide participants to provide long‐term participation and high‐quality data. The proposed mechanism regards the interaction between the worker and the requester as a repeated game and obtains a long‐term incentive based on the historical information and discount factor. In addition, the evolutionary game theory and the Wright‐Fisher model in biology are used to analyze the evolution of participants’ strategies. The optimal discount factor is found within the range of discount factors based on repeated games. Finally, simulation experiments verify the existing crowdsourcing dilemma and the effectiveness of the incentive mechanism. The results show that the proposed MSRG incentive mechanism has a long‐term incentive effect for participants in mobile crowdsourcing systems.

Trust relationships have an important effect on coalition formation. In many real scenarios, agents usually cooperate with others in their trusted social networks to form coalitions. Therefore, the trust value between agents should constrain the utility of forming coalitions when cooperating. At the same time, most studies ignore the impact of the number of coalitions in coalition structure. In this paper, the coalition formation of trust‐utility relationship in social networks is researched. Each node represents an agent, and the trust‐utility networks that connect the agents constrain coalition formation. To solve the task assignment problem, this paper proposes a greedy algorithm which is based on the edge contraction. Under the premise of ensuring the agent’s individually rationality, this algorithm simulates the formation process of coalitions between agents through continuous edge contraction and constrains the number of forming coalitions to k to solve the problem of coalition structure. Finally, the simulation results show that our algorithm has great scalability because of the ability of solving the coalition structure on a large‐scale agent set. It can meet the growing demand for data intensive applications in the Internet of things and artificial intelligence era. The quality of the solution is much higher than other algorithms, and the running time is negligible.

In the participatory sensing framework, privacy protection of the Internet of Things (IoT) is very important. In this article, cryptography-based methods are utilized to protect participants' privacy information in unsecured network channels for dynamic and real-time sensing tasks. The edge computing paradigm is introduced in the traditional participatory sensing framework to reduce network latency. Then, the Rivest Cipher 4 stream cipher and logistic mapping are combined to deal with the problems of participants' limited resources and untruthful third-party platforms. Finally, the product algebra and logistic mapping are combined to deal with the problems of large numbers of participants' access and poor randomness of keystream. Through extensive performance evaluation and comparison experiments on the real-world data, the effectiveness and adaptation of the proposed privacy protection based on stream cipher are verified. It could effectively solve the problem of poor network latency and improve the privacy protection level of IoT.

In spatiotemporal crowdsourcing applications, sensing data uploaded by participants usually contain spatiotemporal sensitive data. If application servers publish the unprocessed sensing data directly, it is easy to expose the privacy of participants. In addition, application servers usually adopt the static publishing mechanism, which is easy to produce problems such as poor timeliness and large information loss for spatiotemporal crowdsourcing applications. Therefore, this paper proposes a spatiotemporal privacy protection (STPP) method based on dynamic clustering methods to solve the privacy protection problem for crowd participants in spatiotemporal crowdsourcing systems. Firstly, the working principles of a dynamic privacy protection mechanism are introduced. Then, based on k-anonymity and l-diversity, the spatiotemporal sensitive data are anonymized. In addition, this paper designs the dynamic k-anonymity algorithm based on the previous anonymous results. Through extensive performance evaluation on real-world data, compared with existing methods, the proposed STPP algorithm could effectively solve the problem of poor timeliness and improve the privacy protection level while reducing the information loss of sensing data.

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.

We address the challenge of effective exploration while maintaining good performance in policy gradient methods. As a solution, we propose diverse exploration (DE) via conjugate policies. DE learns and deploys a set of conjugate policies which can be conveniently generated as a byproduct of conjugate gradient descent. We provide both theoretical and empirical results showing the effectiveness of DE at achieving exploration, improving policy performance, and the advantage of DE over exploration by random policy perturbations.

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.

We analyze motivations for people to take some actions when they are reached by messages in information network. The concept of interest associate with people's motivations and actions in network is presented and defined. Then we propose a logic model in which interest can be formalized in a logic of time, actions, beliefs, and choices. The properties of interest are also studied.