A Differentially Private Data Aggregation Method Based on Worker Partition and Location Obfuscation for Mobile Crowdsensing

With the popularity of sensor-rich mobile devices,mobile crowdsensing(MCS)has emerged as an effective method for data collection and processing.However,MCS platform usually need workers’precise locations for optimal task execution and collect sensing data from workers,which raises severe concerns of privacy leakage.Trying to preserve workers’location and sensing data from the untrusted MCS platform,a differentially private data aggregation method based on worker partition and location obfuscation(DP-DAWL method)is proposed in the paper.DP-DAWL method firstly use an improved K-means algorithm to divide workers into groups and assign different privacy budget to the group according to group size(the number of workers).Then each worker’s location is obfuscated and his/her sensing data is perturbed by adding Laplace noise before uploading to the platform.In the stage of data aggregation,DP-DAWL method adopts an improved Kalman filter algorithm to filter out the added noise(including both added noise of sensing data and the system noise in the sensing process).Through using optimal estimation of noisy aggregated sensing data,the platform can finally gain better utility of aggregated data while preserving workers’privacy.Extensive experiments on the synthetic datasets demonstrate the effectiveness of the proposed method.

Secure Mobile Crowdsensing Based on Deep Learning

To improve the quality of multimedia services and stimulate secure sensing in Internet of Things applications, such as healthcare and traffic monitoring, mobile crowdsensing(MCS) systems must address security threats such as jamming, spoofing and faked sensing attacks during both sensing and information exchange processes in large-scale dynamic and heterogeneous networks. In this article, we investigate secure mobile crowdsensing and present ways to use deep learning(DL) methods, such as stacked autoencoder, deep neural networks, convolutional neural networks, and deep reinforcement learning, to improve approaches to MCS security, including authentication, privacy protection, faked sensing countermeasures, intrusion detection and anti-jamming transmissions in MCS. We discuss the performance gain of these DLbased approaches compared to traditional security schemes and identify the challenges that must be addressed to implement these approaches in practical MCS systems.

Dynamic data-sharing based user recruitment in mobile crowdsensing

Mobile crowdsensing(MCS) has become an emerging paradigm to solve urban sensing problems by leveraging the ubiquitous sensing capabilities of the crowd. One critical issue in MCS is how to recruit users to fulfill more sensing tasks with budget restriction, while sharing data among tasks can be a credible way to improve the efficiency. The data-sharing based user recruitment problem under budget constraint in a realistic scenario is studied, where multiple tasks require homogeneous data but have various spatio-temporal execution ranges, meanwhile users suffer from uncertain future positions. The problem is formulated in a manner of probability by predicting user mobility, then a dynamic user recruitment algorithm is proposed to solve it. In the algorithm a greedy-adding-and-substitution(GAS) heuristic is repeatedly implemented by updating user mobility prediction in each time slot to gradually achieve the final solution. Extensive simulations are conducted using a real-world taxi trace dataset, and the results demonstrate that the approach can fulfill more tasks than existing methods.

BPPF:Bilateral Privacy-Preserving Framework for Mobile Crowdsensing

With the emergence of mobile crowdsensing (MCS), merchants can use their mobiledevices to collect data that customers are interested in. Now there are many mobilecrowdsensing platforms in the market, such as Gigwalk, Uber and Checkpoint, which publishand select the right workers to complete the task of some specific locations (for example,taking photos to collect the price of goods in a shopping mall). In mobile crowdsensing, in orderto select the right workers, the platform needs the actual location information of workersand tasks, which poses a risk to the location privacy of workers and tasks. In this paper, westudy privacy protection in MCS. The main challenge is to assign the most suitable worker toa task without knowing the task and the actual location of the worker. We propose a bilateralprivacy protection framework based on matrix multiplication, which can protect the locationprivacy between the task and the worker, and keep their relative distance unchanged.

Achieving dynamic privacy measurement and protection based on reinforcement learning for mobile edge crowdsensing of IoT

With the maturity and development of 5G field,Mobile Edge CrowdSensing(MECS),as an intelligent data collection paradigm,provides a broad prospect for various applications in IoT.However,sensing users as data uploaders lack a balance between data benefits and privacy threats,leading to conservative data uploads and low revenue or excessive uploads and privacy breaches.To solve this problem,a Dynamic Privacy Measurement and Protection(DPMP)framework is proposed based on differential privacy and reinforcement learning.Firstly,a DPM model is designed to quantify the amount of data privacy,and a calculation method for personalized privacy threshold of different users is also designed.Furthermore,a Dynamic Private sensing data Selection(DPS)algorithm is proposed to help sensing users maximize data benefits within their privacy thresholds.Finally,theoretical analysis and ample experiment results show that DPMP framework is effective and efficient to achieve a balance between data benefits and sensing user privacy protection,in particular,the proposed DPMP framework has 63%and 23%higher training efficiency and data benefits,respectively,compared to the Monte Carlo algorithm.

User selection based on user-union and relative entropy in mobile crowdsensing

A critical issue in mobile crowdsensing(MCS) involves selecting appropriate users from a number of participants to guarantee the completion of a sensing task. Users may upload unnecessary data to the sensing platform, leading to redundancy and low user selection efficiency. Furthermore, using exact values to evaluate the quality of the user-union will further reduce selection accuracy when users form a union. This paper proposes a user selection method based on user-union and relative entropy in MCS. More specifically, a user-union matching scheme based on similarity calculation is constructed to achieve user-union and reduce data redundancy effectively. Then, considering the interval-valued influence, a user-union selection strategy with the lowest relative entropy is proposed. Extensive testing was conducted to investigate the impact of various parameters on user selection. The results obtained are encouraging and provide essential insights into the different aspects impacting the data redundancy and interval-valued estimation of MCS user selection.

Blockchain-Based MCS Detection Framework of Abnormal Spectrum Usage for Satellite Spectrum Sharing Scenario

In this paper, the problem of abnormal spectrum usage between satellite spectrum sharing systems is investigated to support multi-satellite spectrum coexistence. Given the cost of monitoring, the mobility of low-orbit satellites, and the directional nature of their signals, traditional monitoring methods are no longer suitable, especially in the case of multiple power level. Mobile crowdsensing(MCS), as a new technology, can make full use of idle resources to complete a variety of perceptual tasks. However, traditional MCS heavily relies on a centralized server and is vulnerable to single point of failure attacks. Therefore, we replace the original centralized server with a blockchain-based distributed service provider to enable its security. Therefore, in this work, we propose a blockchain-based MCS framework, in which we explain in detail how this framework can achieve abnormal frequency behavior monitoring in an inter-satellite spectrum sharing system. Then, under certain false alarm probability, we propose an abnormal spectrum detection algorithm based on mixed hypothesis test to maximize detection probability in single power level and multiple power level scenarios, respectively. Finally, a Bad out of Good(BooG) detector is proposed to ease the computational pressure on the blockchain nodes. Simulation results show the effectiveness of the proposed framework.

Enhancing Task Assignment in Crowdsensing Systems Based on Sensing Intervals and Location

The popularity of mobile devices with sensors is captivating the attention of researchers to modern techniques,such as the internet of things(IoT)and mobile crowdsensing(MCS).The core concept behind MCS is to use the power of mobile sensors to accomplish a difficult task collaboratively,with each mobile user completing much simpler micro-tasks.This paper discusses the task assignment problem in mobile crowdsensing,which is dependent on sensing time and path planning with the constraints of participant travel distance budgets and sensing time intervals.The goal is to minimize aggregate sensing time for mobile users,which reduces energy consumption to encourage more participants to engage in sensing activities and maximize total task quality.This paper introduces a two-phase task assignment framework called location time-based algorithm(LTBA).LTBA is a framework that enhances task assignment in MCS,whereas assigning tasks requires overlapping time intervals between tasks and mobile users’tasks and the location of tasks and mobile users’paths.The process of assigning the nearest task to the mobile user’s current path depends on the ant colony optimization algorithm(ACO)and Euclidean distance.LTBA combines two algorithms:(1)greedy online allocation algorithm and(2)bio-inspired traveldistance-balance-based algorithm(B-DBA).The greedy algorithm was sensing time interval-based and worked on reducing the overall sensing time of the mobile user.B-DBA was location-based and worked on maximizing total task quality.The results demonstrate that the average task quality is 0.8158,0.7093,and 0.7733 for LTBA,B-DBA,and greedy,respectively.The sensing time was reduced to 644,1782,and 685 time units for LTBA,B-DBA,and greedy,respectively.Combining the algorithms improves task assignment in MCS for both total task quality and sensing time.The results demonstrate that combining the two algorithms in LTBA is the best performance for total task quality and total sensing time,and the greedy algorithm follows it then B-DBA.

Maximum-Profit Advertising Strategy Using Crowdsensing Trajectory Data

Out-door billboard advertising plays an important role in attracting potential customers.However,whether a customer can be attracted is influenced by many factors,such as the probability that he/she sees the billboard,the degree of his/her interest,and the detour distance for buying the product.Taking the above factors into account,we propose advertising strategies for selecting an effective set of billboards under the advertising budget to maximize commercial profit.By using the data collected by Mobile Crowdsensing(MCS),we extract potential customers’implicit information,such as their trajectories and preferences.We then study the billboard selection problem under two situations,where the advertiser may have only one or multiple products.When only one kind of product needs advertising,the billboard selection problem is formulated as the probabilistic set coverage problem.We propose two heuristic advertising strategies to greedily select advertising billboards,which achieves the expected maximum commercial profit with the lowest cost.When the advertiser has multiple products,we formulate the problem as searching for an optimal solution and adopt the simulated annealing algorithm to search for global optimum instead of local optimum.Extensive experiments based on three real-world data sets verify that our proposed advertising strategies can achieve the superior commercial profit compared with the state-of-the-art strategies.

Real-time and generic queue time estimation based on mobile crowdsensing

People often have to queue for a busy service in many places around a city, and knowing the queue time can be helpful for making better activity plans to avoid long queues. Traditional solutions to the queue time monitoring are based on pre-deployed infrastructures, such as cameras and infrared sensors, which are costly and fail to deliver the queue time information to scattered citizens. This paper presents CrowdQTE, a mobile crowdsensing system, which utilizes the sensor-enhanced mobile devices and crowd hu- man intelligence to monitor and provide real-time queue time information for various queuing scenarios. When people are waiting in a line, we utilize the accelerometer sensor data and ambient contexts to automatically detect the queueing behav- ior and calculate the queue time. When people are not waiting in a line, it estimates the queue time based on the information reported manually by participants. We evaluate the perfor- mance of the system with a two-week and 12-person deploy- ment using commercially-available smartphones. The results demonstrate that CrowdQTE is effective in estimating queu- ing status.

Multi-sensing paradigm based urban air quality monitoring and hazardous gas source analyzing:a review

Effectively monitoring urban air quality,and analyzing the source terms of the main atmospheric pollutants is important for public authorities to take air quality management actions.Previous works,such as long-term obser-vations by monitoring stations,cannot provide customized data services and in-time emergency response under urgent situations(gas leakage incidents).Therefore,we first review the up-to-date approaches(often machine learning and optimization methods)with respect to urban air quality monitoring and hazardous gas source anal-ysis.To bridge the gap between present solutions and practical requirements,we design a conceptual framework,namely MAsmed(Multi-Agents for sensing,monitoring,estimating and determining),to provide fine-grained concentration maps,customized data services,and on-demand emergency management.In this framework,we leverage the hybrid design of wireless sensor networks(WSNs)and mobile crowdsensing(MCS)to sense urban air quality and relevant data(e.g.traffic data,meteorological data,etc.);Using the sensed data,we can create a fine-grained air quality map for the authorities and relevant stakeholders,and provide on-demand source term estimation and source searching methods to estimate,seek,and determine the sources,thereby aiding decision-makers in emergency response(e.g.for evacuation).In this paper,we also identify several potential opportunities for future research.